./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:35:22,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:35:22,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:35:22,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:35:22,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:35:22,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:35:22,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:35:22,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:35:22,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:35:22,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:35:22,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:35:22,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:35:22,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:22,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:35:22,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:35:22,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:35:22,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:35:22,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:35:22,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:35:22,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:35:22,143 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 40add90db9f8d501baba3978de407d6383e788a1a5fafc7225d7676b58d18c84 [2025-03-03 14:35:22,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:35:22,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:35:22,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:35:22,377 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:35:22,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:35:22,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2025-03-03 14:35:23,510 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a98d36d/71aca4cf1bac4e1f9b4cf0c0b365fddd/FLAG4e9915171 [2025-03-03 14:35:23,686 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:35:23,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2025-03-03 14:35:23,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a98d36d/71aca4cf1bac4e1f9b4cf0c0b365fddd/FLAG4e9915171 [2025-03-03 14:35:24,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11a98d36d/71aca4cf1bac4e1f9b4cf0c0b365fddd [2025-03-03 14:35:24,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:35:24,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:35:24,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:24,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:35:24,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:35:24,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63604a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24, skipping insertion in model container [2025-03-03 14:35:24,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:35:24,198 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2025-03-03 14:35:24,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:24,208 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:35:24,217 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c[741,754] [2025-03-03 14:35:24,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:24,229 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:35:24,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24 WrapperNode [2025-03-03 14:35:24,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:24,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:24,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:35:24,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:35:24,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,252 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-03 14:35:24,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:24,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:35:24,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:35:24,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:35:24,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,268 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-03-03 14:35:24,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,272 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:35:24,276 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:35:24,277 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:35:24,277 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:35:24,278 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (1/1) ... [2025-03-03 14:35:24,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:24,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:24,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:35:24,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:35:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:35:24,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:35:24,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:35:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:35:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-03 14:35:24,329 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-03 14:35:24,372 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:35:24,374 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:35:24,433 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-03 14:35:24,438 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:35:24,439 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:35:24,445 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:35:24,445 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:35:24,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:24 BoogieIcfgContainer [2025-03-03 14:35:24,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:35:24,447 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:35:24,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:35:24,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:35:24,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:35:24" (1/3) ... [2025-03-03 14:35:24,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562e356b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:24, skipping insertion in model container [2025-03-03 14:35:24,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:24" (2/3) ... [2025-03-03 14:35:24,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562e356b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:24, skipping insertion in model container [2025-03-03 14:35:24,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:24" (3/3) ... [2025-03-03 14:35:24,452 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2025-03-03 14:35:24,462 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:35:24,463 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_7-2.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:35:24,498 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:35:24,506 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;@26dbfc8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:35:24,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:35:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:35:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:35:24,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:24,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:24,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-03-03 14:35:24,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873036879] [2025-03-03 14:35:24,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:24,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:35:24,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:35:24,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:24,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:35:24,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:24,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873036879] [2025-03-03 14:35:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873036879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:35:24,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:35:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:35:24,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88783503] [2025-03-03 14:35:24,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:35:24,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:35:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:24,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:35:24,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:24,691 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:35:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:24,727 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-03 14:35:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:35:24,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-03 14:35:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:24,736 INFO L225 Difference]: With dead ends: 30 [2025-03-03 14:35:24,736 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 14:35:24,738 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-03-03 14:35:24,740 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:24,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 14:35:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 14:35:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-03-03 14:35:24,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:35:24,764 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-03 14:35:24,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:24,764 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:35:24,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:35:24,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:35:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:35:24,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:24,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:24,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:35:24,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-03-03 14:35:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934909125] [2025-03-03 14:35:24,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:24,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:35:24,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:35:24,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:24,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:35:24,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934909125] [2025-03-03 14:35:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934909125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:35:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:35:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:35:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461336033] [2025-03-03 14:35:24,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:35:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:35:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:24,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:35:24,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:24,845 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-03-03 14:35:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:24,857 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-03 14:35:24,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:35:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-03-03 14:35:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:24,859 INFO L225 Difference]: With dead ends: 24 [2025-03-03 14:35:24,859 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:35:24,860 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-03-03 14:35:24,861 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:24,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:35:24,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 14:35:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 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-03-03 14:35:24,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:35:24,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-03 14:35:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:24,866 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:35:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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-03-03 14:35:24,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:35:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:35:24,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:24,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:24,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:35:24,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:24,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-03-03 14:35:24,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661851818] [2025-03-03 14:35:24,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:24,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:35:24,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:35:24,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:24,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:35:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661851818] [2025-03-03 14:35:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661851818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716194704] [2025-03-03 14:35:24,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:24,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:24,971 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:24,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:35:24,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:35:25,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:35:25,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:25,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:25,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:35:25,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:35:25,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:25,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:35:25,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716194704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:25,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:25,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-03 14:35:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788742794] [2025-03-03 14:35:25,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:25,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:35:25,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:25,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:35:25,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:35:25,280 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:35:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:25,358 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-03 14:35:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:35:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-03-03 14:35:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:25,359 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:35:25,359 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:35:25,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:35:25,360 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:25,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:35:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 14:35:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:35:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-03 14:35:25,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-03 14:35:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:25,368 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-03 14:35:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:35:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-03 14:35:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:35:25,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:25,369 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-03-03 14:35:25,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:25,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:25,573 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:25,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:25,574 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-03-03 14:35:25,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:25,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437693658] [2025-03-03 14:35:25,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:25,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:25,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:35:25,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:35:25,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:25,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:35:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:25,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437693658] [2025-03-03 14:35:25,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437693658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017945671] [2025-03-03 14:35:25,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:25,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:25,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:25,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:25,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:35:25,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:35:25,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:35:25,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:25,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:25,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:35:25,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:35:25,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:25,886 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:35:25,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017945671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:25,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-03 14:35:25,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993425652] [2025-03-03 14:35:25,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:25,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:35:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:25,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:35:25,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:35:25,888 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:35:25,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:25,940 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-03 14:35:25,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:35:25,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-03-03 14:35:25,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:25,942 INFO L225 Difference]: With dead ends: 29 [2025-03-03 14:35:25,942 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 14:35:25,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:35:25,942 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:25,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:25,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 14:35:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 14:35:25,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 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-03-03 14:35:25,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-03 14:35:25,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-03 14:35:25,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:25,947 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-03 14:35:25,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:35:25,947 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-03 14:35:25,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:35:25,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:25,948 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:25,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:26,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 14:35:26,149 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:26,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-03-03 14:35:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:26,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003547754] [2025-03-03 14:35:26,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:26,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:35:26,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:35:26,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:26,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:35:26,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003547754] [2025-03-03 14:35:26,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003547754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:26,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679197918] [2025-03-03 14:35:26,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:26,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:26,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:26,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:26,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:35:26,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:35:26,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:35:26,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:26,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:26,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:35:26,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:35:26,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:35:26,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679197918] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:26,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:26,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2025-03-03 14:35:26,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138831091] [2025-03-03 14:35:26,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:26,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:35:26,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:26,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:35:26,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:35:26,773 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:27,036 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2025-03-03 14:35:27,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:35:27,037 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-03-03 14:35:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:27,038 INFO L225 Difference]: With dead ends: 46 [2025-03-03 14:35:27,038 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 14:35:27,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:35:27,039 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:27,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 14:35:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-03 14:35:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-03 14:35:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2025-03-03 14:35:27,054 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2025-03-03 14:35:27,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:27,054 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2025-03-03 14:35:27,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2025-03-03 14:35:27,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:35:27,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:27,056 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:27,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:35:27,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:27,257 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash 525573421, now seen corresponding path program 3 times [2025-03-03 14:35:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:27,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-03-03 14:35:27,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:27,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:27,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-03 14:35:27,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-03 14:35:27,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:35:27,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:27,388 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 14:35:27,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:27,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-03-03 14:35:27,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193747357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:27,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951991835] [2025-03-03 14:35:27,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:27,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:27,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:27,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:27,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:35:27,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-03 14:35:27,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-03 14:35:27,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:35:27,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:27,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:35:27,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 215 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 14:35:27,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:27,851 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 14:35:27,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951991835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:27,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:27,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-03 14:35:27,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385401915] [2025-03-03 14:35:27,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:35:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:27,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:35:27,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:35:27,854 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:35:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:27,954 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2025-03-03 14:35:27,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:35:27,955 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2025-03-03 14:35:27,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:27,956 INFO L225 Difference]: With dead ends: 62 [2025-03-03 14:35:27,956 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 14:35:27,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:35:27,957 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:27,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:27,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 14:35:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-03 14:35:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-03 14:35:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-03-03 14:35:27,965 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 91 [2025-03-03 14:35:27,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:27,965 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-03-03 14:35:27,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:35:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-03-03 14:35:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:35:27,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:27,967 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:27,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:35:28,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:28,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:28,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:28,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 4 times [2025-03-03 14:35:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:28,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279464482] [2025-03-03 14:35:28,168 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:28,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:28,176 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 14:35:28,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-03 14:35:28,185 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:28,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 14:35:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:28,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279464482] [2025-03-03 14:35:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279464482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669175164] [2025-03-03 14:35:28,265 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:28,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:28,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:28,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:28,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:35:28,300 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 14:35:28,318 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 78 of 93 statements. [2025-03-03 14:35:28,318 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:28,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:28,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:35:28,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 14:35:28,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:28,832 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 181 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked. [2025-03-03 14:35:28,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669175164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:28,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:28,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-03 14:35:28,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873275325] [2025-03-03 14:35:28,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:28,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:35:28,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:28,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:35:28,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:35:28,834 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:28,916 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2025-03-03 14:35:28,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:35:28,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 93 [2025-03-03 14:35:28,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:28,918 INFO L225 Difference]: With dead ends: 41 [2025-03-03 14:35:28,918 INFO L226 Difference]: Without dead ends: 37 [2025-03-03 14:35:28,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:28,919 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:28,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-03 14:35:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-03 14:35:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2025-03-03 14:35:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2025-03-03 14:35:28,932 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 93 [2025-03-03 14:35:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:28,932 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2025-03-03 14:35:28,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2025-03-03 14:35:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 14:35:28,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:28,933 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 25, 14, 14, 14, 14, 14, 14, 14, 11, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:28,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:35:29,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:29,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:29,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:29,134 INFO L85 PathProgramCache]: Analyzing trace with hash -398227603, now seen corresponding path program 5 times [2025-03-03 14:35:29,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:29,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509586622] [2025-03-03 14:35:29,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:29,141 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-03-03 14:35:29,150 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-03-03 14:35:29,150 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 14:35:29,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 259 proven. 360 refuted. 0 times theorem prover too weak. 1669 trivial. 0 not checked. [2025-03-03 14:35:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509586622] [2025-03-03 14:35:29,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509586622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393328281] [2025-03-03 14:35:29,247 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:29,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:29,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:29,249 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:29,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:35:29,284 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 203 statements into 24 equivalence classes. [2025-03-03 14:35:29,301 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 81 of 203 statements. [2025-03-03 14:35:29,301 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 14:35:29,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:29,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:35:29,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 1311 proven. 33 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-03 14:35:29,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:30,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2288 backedges. 281 proven. 428 refuted. 0 times theorem prover too weak. 1579 trivial. 0 not checked. [2025-03-03 14:35:30,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393328281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:30,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:30,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 16 [2025-03-03 14:35:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912251842] [2025-03-03 14:35:30,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:30,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:35:30,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:30,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:35:30,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:30,086 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-03 14:35:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:30,211 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2025-03-03 14:35:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:35:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) Word has length 203 [2025-03-03 14:35:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:30,213 INFO L225 Difference]: With dead ends: 85 [2025-03-03 14:35:30,215 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:35:30,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 396 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:35:30,216 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:30,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 105 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:30,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:35:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-03 14:35:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (35), 11 states have call predecessors, (35), 7 states have call successors, (35) [2025-03-03 14:35:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2025-03-03 14:35:30,230 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 74 transitions. Word has length 203 [2025-03-03 14:35:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 74 transitions. [2025-03-03 14:35:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.3125) internal successors, (53), 16 states have internal predecessors, (53), 9 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (18), 6 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-03 14:35:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 74 transitions. [2025-03-03 14:35:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-03 14:35:30,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:30,232 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 23, 13, 13, 13, 13, 13, 13, 13, 10, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:30,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:30,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:30,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:30,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1403071511, now seen corresponding path program 6 times [2025-03-03 14:35:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:30,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119290943] [2025-03-03 14:35:30,433 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:30,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:30,439 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 22 equivalence classes. [2025-03-03 14:35:30,448 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 189 statements. [2025-03-03 14:35:30,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 14:35:30,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 612 proven. 39 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2025-03-03 14:35:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119290943] [2025-03-03 14:35:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119290943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579304753] [2025-03-03 14:35:30,567 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:30,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:30,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:30,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:30,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:35:30,607 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 189 statements into 22 equivalence classes. [2025-03-03 14:35:30,629 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 189 statements. [2025-03-03 14:35:30,629 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 14:35:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:30,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:35:30,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:30,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 586 proven. 43 refuted. 0 times theorem prover too weak. 1340 trivial. 0 not checked. [2025-03-03 14:35:30,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1969 backedges. 586 proven. 46 refuted. 0 times theorem prover too weak. 1337 trivial. 0 not checked. [2025-03-03 14:35:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579304753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:31,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:31,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 15 [2025-03-03 14:35:31,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708557044] [2025-03-03 14:35:31,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:31,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:35:31,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:31,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:35:31,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:35:31,280 INFO L87 Difference]: Start difference. First operand 45 states and 74 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:35:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:31,382 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2025-03-03 14:35:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:35:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) Word has length 189 [2025-03-03 14:35:31,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:31,383 INFO L225 Difference]: With dead ends: 87 [2025-03-03 14:35:31,383 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:35:31,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 372 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=320, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:35:31,384 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:31,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:35:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 14:35:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-03 14:35:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-03 14:35:31,389 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 189 [2025-03-03 14:35:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:31,389 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-03 14:35:31,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (14), 6 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:35:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-03-03 14:35:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:35:31,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:31,390 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:31,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:31,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:31,591 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -240813463, now seen corresponding path program 7 times [2025-03-03 14:35:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:31,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-03 14:35:31,592 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:35:31,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:31,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:35:31,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:35:31,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:31,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:31,743 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 14:35:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775637707] [2025-03-03 14:35:31,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775637707] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:31,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16997762] [2025-03-03 14:35:31,744 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:35:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:31,770 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:31,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:35:31,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:35:31,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:35:31,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:31,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:31,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:35:31,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2025-03-03 14:35:31,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-03-03 14:35:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16997762] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:32,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2025-03-03 14:35:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972763345] [2025-03-03 14:35:32,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:32,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:35:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:32,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:35:32,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:35:32,522 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-03 14:35:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:32,600 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2025-03-03 14:35:32,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:35:32,601 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) Word has length 133 [2025-03-03 14:35:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:32,601 INFO L225 Difference]: With dead ends: 54 [2025-03-03 14:35:32,601 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 14:35:32,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:35:32,602 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:32,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 73 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:32,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 14:35:32,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 14:35:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 33 states have internal predecessors, (38), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (24), 11 states have call predecessors, (24), 7 states have call successors, (24) [2025-03-03 14:35:32,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-03-03 14:35:32,607 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 133 [2025-03-03 14:35:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-03-03 14:35:32,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 15 states have internal predecessors, (46), 12 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (16), 6 states have call predecessors, (16), 12 states have call successors, (16) [2025-03-03 14:35:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2025-03-03 14:35:32,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 14:35:32,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:32,609 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:32,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:32,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:35:32,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash -555793953, now seen corresponding path program 8 times [2025-03-03 14:35:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400561399] [2025-03-03 14:35:32,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:32,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-03 14:35:32,826 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:35:32,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2025-03-03 14:35:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400561399] [2025-03-03 14:35:33,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400561399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:33,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121098699] [2025-03-03 14:35:33,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:33,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:33,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:33,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:33,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:35:33,065 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-03 14:35:33,101 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 14:35:33,101 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:33,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:33,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:35:33,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:33,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2025-03-03 14:35:33,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 756 refuted. 0 times theorem prover too weak. 1716 trivial. 0 not checked. [2025-03-03 14:35:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121098699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:34,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 16 [2025-03-03 14:35:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593200000] [2025-03-03 14:35:34,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:34,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:35:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:34,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:35:34,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:34,099 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-03 14:35:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:34,215 INFO L93 Difference]: Finished difference Result 59 states and 87 transitions. [2025-03-03 14:35:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:35:34,215 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) Word has length 215 [2025-03-03 14:35:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:34,217 INFO L225 Difference]: With dead ends: 59 [2025-03-03 14:35:34,217 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 14:35:34,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 422 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:35:34,218 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 79 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 14:35:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 14:35:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 36 states have internal predecessors, (41), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (34), 13 states have call predecessors, (34), 8 states have call successors, (34) [2025-03-03 14:35:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2025-03-03 14:35:34,228 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 215 [2025-03-03 14:35:34,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:34,229 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2025-03-03 14:35:34,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-03 14:35:34,229 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2025-03-03 14:35:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-03 14:35:34,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:34,234 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 42, 26, 26, 26, 26, 26, 26, 26, 16, 11, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:34,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:34,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:34,435 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:34,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1207572172, now seen corresponding path program 9 times [2025-03-03 14:35:34,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:34,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-03-03 14:35:34,435 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:34,446 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 364 statements into 42 equivalence classes. [2025-03-03 14:35:34,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 148 of 364 statements. [2025-03-03 14:35:34,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-03 14:35:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 1443 proven. 183 refuted. 0 times theorem prover too weak. 6047 trivial. 0 not checked. [2025-03-03 14:35:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-03-03 14:35:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763219444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611404620] [2025-03-03 14:35:34,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:34,640 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:34,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:35:34,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 364 statements into 42 equivalence classes. [2025-03-03 14:35:34,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 148 of 364 statements. [2025-03-03 14:35:34,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-03 14:35:34,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:34,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:35:34,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 1557 proven. 191 refuted. 0 times theorem prover too weak. 5925 trivial. 0 not checked. [2025-03-03 14:35:34,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7673 backedges. 1559 proven. 201 refuted. 0 times theorem prover too weak. 5913 trivial. 0 not checked. [2025-03-03 14:35:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611404620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:35,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:35,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-03 14:35:35,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210760876] [2025-03-03 14:35:35,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:35,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:35:35,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:35,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:35:35,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:35:35,934 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-03 14:35:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:36,200 INFO L93 Difference]: Finished difference Result 133 states and 241 transitions. [2025-03-03 14:35:36,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:35:36,201 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) Word has length 364 [2025-03-03 14:35:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:36,202 INFO L225 Difference]: With dead ends: 133 [2025-03-03 14:35:36,202 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 14:35:36,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 718 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 14:35:36,203 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:36,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 117 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 14:35:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-03-03 14:35:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 44 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (38), 15 states have call predecessors, (38), 10 states have call successors, (38) [2025-03-03 14:35:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2025-03-03 14:35:36,210 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 364 [2025-03-03 14:35:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:36,210 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2025-03-03 14:35:36,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (22), 12 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-03 14:35:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2025-03-03 14:35:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 14:35:36,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:36,213 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:36,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:35:36,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:35:36,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:36,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:36,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1955485102, now seen corresponding path program 10 times [2025-03-03 14:35:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:36,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86460493] [2025-03-03 14:35:36,414 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:36,421 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 324 statements into 2 equivalence classes. [2025-03-03 14:35:36,432 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 275 of 324 statements. [2025-03-03 14:35:36,433 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:36,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 581 proven. 634 refuted. 0 times theorem prover too weak. 4824 trivial. 0 not checked. [2025-03-03 14:35:36,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86460493] [2025-03-03 14:35:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86460493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:36,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426734663] [2025-03-03 14:35:36,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:36,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:36,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:36,614 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:36,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:35:36,683 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 324 statements into 2 equivalence classes. [2025-03-03 14:35:36,723 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 275 of 324 statements. [2025-03-03 14:35:36,723 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:36,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:36,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:35:36,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 707 proven. 851 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2025-03-03 14:35:36,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:38,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 709 proven. 900 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2025-03-03 14:35:38,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426734663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:38,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:38,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 21 [2025-03-03 14:35:38,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118428086] [2025-03-03 14:35:38,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:35:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:38,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:35:38,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:35:38,330 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 15 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-03 14:35:38,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:38,451 INFO L93 Difference]: Finished difference Result 98 states and 180 transitions. [2025-03-03 14:35:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:35:38,452 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 15 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) Word has length 324 [2025-03-03 14:35:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:38,453 INFO L225 Difference]: With dead ends: 98 [2025-03-03 14:35:38,453 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 14:35:38,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 634 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:35:38,455 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:38,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 130 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:38,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 14:35:38,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 14:35:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 46 states have internal predecessors, (52), 10 states have call successors, (10), 7 states have call predecessors, (10), 10 states have return successors, (28), 16 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-03 14:35:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2025-03-03 14:35:38,463 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 324 [2025-03-03 14:35:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:38,463 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2025-03-03 14:35:38,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 15 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-03 14:35:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2025-03-03 14:35:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 14:35:38,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:38,467 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:38,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:38,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:35:38,668 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:38,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1946424999, now seen corresponding path program 11 times [2025-03-03 14:35:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:38,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384817318] [2025-03-03 14:35:38,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:38,675 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 283 statements into 41 equivalence classes. [2025-03-03 14:35:38,708 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:35:38,708 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2025-03-03 14:35:38,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:35:38,708 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:35:38,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 14:35:38,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:35:38,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:38,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:35:38,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:35:38,763 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:35:38,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:35:38,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:35:38,766 INFO L422 BasicCegarLoop]: Path program histogram: [11, 1, 1, 1] [2025-03-03 14:35:38,819 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:35:38,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:35:38 BoogieIcfgContainer [2025-03-03 14:35:38,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:35:38,824 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:35:38,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:35:38,824 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:35:38,825 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:24" (3/4) ... [2025-03-03 14:35:38,825 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:35:38,874 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 158. [2025-03-03 14:35:38,968 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:35:38,972 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:35:38,972 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:35:38,973 INFO L158 Benchmark]: Toolchain (without parser) took 14893.05ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 123.7MB in the beginning and 76.6MB in the end (delta: 47.2MB). Peak memory consumption was 122.2MB. Max. memory is 16.1GB. [2025-03-03 14:35:38,973 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:35:38,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.95ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:35:38,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.13ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.9MB in the end (delta: 910.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:35:38,974 INFO L158 Benchmark]: Boogie Preprocessor took 21.56ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 961.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:35:38,974 INFO L158 Benchmark]: IcfgBuilder took 169.31ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 101.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:35:38,974 INFO L158 Benchmark]: TraceAbstraction took 14376.93ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 100.2MB in the beginning and 90.7MB in the end (delta: 9.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2025-03-03 14:35:38,974 INFO L158 Benchmark]: Witness Printer took 148.21ms. Allocated memory is still 243.3MB. Free memory was 90.7MB in the beginning and 76.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:35:38,975 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.29ms. Allocated memory is still 201.3MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.95ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.13ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.9MB in the end (delta: 910.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.56ms. Allocated memory is still 167.8MB. Free memory was 111.9MB in the beginning and 110.9MB in the end (delta: 961.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 169.31ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 101.0MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14376.93ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 100.2MB in the beginning and 90.7MB in the end (delta: 9.5MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. * Witness Printer took 148.21ms. Allocated memory is still 243.3MB. Free memory was 90.7MB in the beginning and 76.6MB in the end (delta: 14.2MB). 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: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [x=7] [L29] reach_error() VAL [x=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 14, TraceHistogramMax: 53, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 297 mSDsluCounter, 1043 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 817 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1216 IncrementalHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 226 mSDtfsCounter, 1216 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3585 GetRequests, 3314 SyntacticMatches, 52 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=13, InterpolantAutomatonStates: 135, 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, 13 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 3696 NumberOfCodeBlocks, 2624 NumberOfCodeBlocksAsserted, 149 NumberOfCheckSat, 5074 ConstructedInterpolants, 0 QuantifiedInterpolants, 7550 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2694 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 59383/67167 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-03 14:35:38,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE