./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_2calls_8-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 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:44:57,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:44:58,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:44:58,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:44:58,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:44:58,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:44:58,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:44:58,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:44:58,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:44:58,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:44:58,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:44:58,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:44:58,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:44:58,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:44:58,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:44:58,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:44:58,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:44:58,035 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:44:58,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:44:58,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:44:58,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:44:58,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:44:58,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:44:58,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:44:58,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:44:58,036 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 -> 5952061731474d390646c291ccf1d0136c1d856e30481accbc86db371431d703 [2025-03-08 05:44:58,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:44:58,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:44:58,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:44:58,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:44:58,278 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:44:58,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2025-03-08 05:44:59,416 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e767e33/72c86e3d886247ccba7758e2d9fe4a3e/FLAGca78da2fb [2025-03-08 05:44:59,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:44:59,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2025-03-08 05:44:59,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e767e33/72c86e3d886247ccba7758e2d9fe4a3e/FLAGca78da2fb [2025-03-08 05:44:59,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3e767e33/72c86e3d886247ccba7758e2d9fe4a3e [2025-03-08 05:44:59,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:44:59,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:44:59,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:44:59,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:44:59,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:44:59,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:44:59" (1/1) ... [2025-03-08 05:44:59,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f833fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:44:59, skipping insertion in model container [2025-03-08 05:44:59,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:44:59" (1/1) ... [2025-03-08 05:44:59,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:45:00,079 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_2calls_8-2.c[947,960] [2025-03-08 05:45:00,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:45:00,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:45:00,100 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_2calls_8-2.c[947,960] [2025-03-08 05:45:00,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:45:00,111 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:45:00,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00 WrapperNode [2025-03-08 05:45:00,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:45:00,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:45:00,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:45:00,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:45:00,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,133 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-08 05:45:00,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:45:00,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:45:00,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:45:00,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:45:00,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,147 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-08 05:45:00,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,149 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:45:00,153 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:45:00,153 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:45:00,153 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:45:00,153 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (1/1) ... [2025-03-08 05:45:00,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:45:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:00,178 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-08 05:45:00,183 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-08 05:45:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:45:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:45:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2025-03-08 05:45:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2025-03-08 05:45:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2025-03-08 05:45:00,197 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2025-03-08 05:45:00,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:45:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:45:00,240 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:45:00,242 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:45:00,313 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~ret6;havoc #t~ret7; [2025-03-08 05:45:00,333 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L15: havoc #t~ret4;havoc #t~ret5; [2025-03-08 05:45:00,341 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 05:45:00,342 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:45:00,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:45:00,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:45:00,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:45:00 BoogieIcfgContainer [2025-03-08 05:45:00,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:45:00,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:45:00,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:45:00,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:45:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:44:59" (1/3) ... [2025-03-08 05:45:00,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184e6b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:45:00, skipping insertion in model container [2025-03-08 05:45:00,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:45:00" (2/3) ... [2025-03-08 05:45:00,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184e6b02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:45:00, skipping insertion in model container [2025-03-08 05:45:00,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:45:00" (3/3) ... [2025-03-08 05:45:00,359 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2025-03-08 05:45:00,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:45:00,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_2calls_8-2.c that has 3 procedures, 29 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:45:00,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:45:00,423 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;@25d3c771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:45:00,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:45:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 05:45:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 05:45:00,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:00,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:00,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:00,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -402987893, now seen corresponding path program 1 times [2025-03-08 05:45:00,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:00,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198444318] [2025-03-08 05:45:00,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:00,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:00,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 05:45:00,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 05:45:00,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:00,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:00,625 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-08 05:45:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:00,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198444318] [2025-03-08 05:45:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198444318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:45:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:45:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:45:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118345935] [2025-03-08 05:45:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:45:00,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:45:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:00,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:45:00,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:45:00,641 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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-08 05:45:00,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:00,680 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-08 05:45:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:45:00,683 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-08 05:45:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:00,687 INFO L225 Difference]: With dead ends: 39 [2025-03-08 05:45:00,688 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 05:45:00,691 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-08 05:45:00,694 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 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-08 05:45:00,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:45:00,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 05:45:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 05:45:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:45:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-08 05:45:00,723 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2025-03-08 05:45:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:00,723 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-08 05:45:00,724 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-08 05:45:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-08 05:45:00,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 05:45:00,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:00,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:00,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:45:00,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:00,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:00,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1356301235, now seen corresponding path program 1 times [2025-03-08 05:45:00,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:00,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683589249] [2025-03-08 05:45:00,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:00,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 05:45:00,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 05:45:00,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:00,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:00,807 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-08 05:45:00,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:00,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683589249] [2025-03-08 05:45:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683589249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:45:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:45:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:45:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391940464] [2025-03-08 05:45:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:45:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:45:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:00,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:45:00,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:45:00,811 INFO L87 Difference]: Start difference. First operand 27 states and 34 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-08 05:45:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:00,832 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2025-03-08 05:45:00,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:45:00,832 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-08 05:45:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:00,833 INFO L225 Difference]: With dead ends: 33 [2025-03-08 05:45:00,833 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 05:45:00,834 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-08 05:45:00,834 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-08 05:45:00,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:45:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 05:45:00,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-08 05:45:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:45:00,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2025-03-08 05:45:00,840 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 11 [2025-03-08 05:45:00,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:00,840 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2025-03-08 05:45:00,840 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-08 05:45:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2025-03-08 05:45:00,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 05:45:00,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:00,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:00,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:45:00,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:00,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:00,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1190707769, now seen corresponding path program 1 times [2025-03-08 05:45:00,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:00,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637078998] [2025-03-08 05:45:00,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:00,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:00,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:45:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:45:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:45:00,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637078998] [2025-03-08 05:45:00,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637078998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:00,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335563522] [2025-03-08 05:45:00,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:00,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:00,956 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-08 05:45:00,964 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-08 05:45:00,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 05:45:01,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 05:45:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:01,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:45:01,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:45:01,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:01,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:45:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335563522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:01,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2025-03-08 05:45:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635501478] [2025-03-08 05:45:01,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:45:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:01,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:45:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:45:01,294 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-08 05:45:01,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:01,403 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2025-03-08 05:45:01,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:45:01,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-08 05:45:01,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:01,407 INFO L225 Difference]: With dead ends: 55 [2025-03-08 05:45:01,408 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 05:45:01,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:45:01,409 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 22 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:01,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 105 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 05:45:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-03-08 05:45:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-08 05:45:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-08 05:45:01,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2025-03-08 05:45:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:01,413 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-08 05:45:01,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 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-08 05:45:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-08 05:45:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 05:45:01,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:01,414 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:01,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:45:01,619 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-08 05:45:01,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:01,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1027112458, now seen corresponding path program 1 times [2025-03-08 05:45:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771550170] [2025-03-08 05:45:01,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:01,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:45:01,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:45:01,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:01,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:01,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:45:01,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:01,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771550170] [2025-03-08 05:45:01,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771550170] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:01,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340643162] [2025-03-08 05:45:01,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:01,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:01,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:01,721 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-08 05:45:01,722 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-08 05:45:01,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 05:45:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 05:45:01,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:01,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:01,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:45:01,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:45:01,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 05:45:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340643162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:01,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:01,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-08 05:45:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000908952] [2025-03-08 05:45:01,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:01,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:45:01,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:01,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:45:01,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:45:01,953 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 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-08 05:45:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:02,062 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-03-08 05:45:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:45:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 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-08 05:45:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:02,064 INFO L225 Difference]: With dead ends: 40 [2025-03-08 05:45:02,064 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 05:45:02,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:45:02,065 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 13 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:02,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 135 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 05:45:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-08 05:45:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 05:45:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 05:45:02,076 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 24 [2025-03-08 05:45:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 05:45:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.125) internal successors, (25), 10 states have internal predecessors, (25), 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-08 05:45:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 05:45:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 05:45:02,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:02,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:02,085 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-08 05:45:02,283 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-08 05:45:02,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1200844378, now seen corresponding path program 1 times [2025-03-08 05:45:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628308943] [2025-03-08 05:45:02,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:02,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:45:02,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:45:02,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:02,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:45:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628308943] [2025-03-08 05:45:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628308943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134589251] [2025-03-08 05:45:02,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:02,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:02,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:02,358 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-08 05:45:02,359 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-08 05:45:02,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 05:45:02,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 05:45:02,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:02,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:02,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:45:02,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:45:02,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:45:02,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134589251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:02,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:02,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 14 [2025-03-08 05:45:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11633360] [2025-03-08 05:45:02,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:02,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 05:45:02,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:02,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 05:45:02,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:45:02,751 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:45:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:02,898 INFO L93 Difference]: Finished difference Result 69 states and 100 transitions. [2025-03-08 05:45:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:45:02,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2025-03-08 05:45:02,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:02,899 INFO L225 Difference]: With dead ends: 69 [2025-03-08 05:45:02,899 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 05:45:02,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:45:02,900 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:02,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 146 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 05:45:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-08 05:45:02,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.173913043478261) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-08 05:45:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2025-03-08 05:45:02,906 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 36 [2025-03-08 05:45:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:02,906 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2025-03-08 05:45:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.090909090909091) internal successors, (45), 14 states have internal predecessors, (45), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:45:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2025-03-08 05:45:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 05:45:02,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:02,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:02,916 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-08 05:45:03,108 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-08 05:45:03,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:03,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash -255039370, now seen corresponding path program 1 times [2025-03-08 05:45:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334868403] [2025-03-08 05:45:03,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:03,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:45:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:45:03,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:03,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:45:03,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334868403] [2025-03-08 05:45:03,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334868403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:03,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181045215] [2025-03-08 05:45:03,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:03,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:03,239 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-08 05:45:03,240 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-08 05:45:03,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-08 05:45:03,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 05:45:03,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:03,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:03,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:45:03,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:45:03,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:03,599 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:45:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181045215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:03,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:03,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2025-03-08 05:45:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364423382] [2025-03-08 05:45:03,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:03,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:45:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:03,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:45:03,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:45:03,601 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:45:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:03,913 INFO L93 Difference]: Finished difference Result 101 states and 161 transitions. [2025-03-08 05:45:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:45:03,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 37 [2025-03-08 05:45:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:03,914 INFO L225 Difference]: With dead ends: 101 [2025-03-08 05:45:03,914 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 05:45:03,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=578, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:45:03,916 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:03,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 300 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:45:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 05:45:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-03-08 05:45:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 39 states have internal predecessors, (41), 11 states have call successors, (11), 3 states have call predecessors, (11), 9 states have return successors, (34), 13 states have call predecessors, (34), 11 states have call successors, (34) [2025-03-08 05:45:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2025-03-08 05:45:03,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 37 [2025-03-08 05:45:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:03,924 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2025-03-08 05:45:03,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2025-03-08 05:45:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2025-03-08 05:45:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 05:45:03,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:03,926 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:03,931 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-08 05:45:04,126 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-08 05:45:04,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1862824006, now seen corresponding path program 1 times [2025-03-08 05:45:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535877745] [2025-03-08 05:45:04,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:04,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 05:45:04,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 05:45:04,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:04,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 05:45:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535877745] [2025-03-08 05:45:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535877745] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442410699] [2025-03-08 05:45:04,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:04,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:04,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:04,258 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-08 05:45:04,260 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-08 05:45:04,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 05:45:04,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 05:45:04,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:04,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:04,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:45:04,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:45:04,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:04,750 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 05:45:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442410699] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:04,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:04,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2025-03-08 05:45:04,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090335747] [2025-03-08 05:45:04,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:04,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:45:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:04,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:45:04,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:45:04,752 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 05:45:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:04,912 INFO L93 Difference]: Finished difference Result 102 states and 193 transitions. [2025-03-08 05:45:04,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:45:04,913 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) Word has length 51 [2025-03-08 05:45:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:04,914 INFO L225 Difference]: With dead ends: 102 [2025-03-08 05:45:04,916 INFO L226 Difference]: Without dead ends: 98 [2025-03-08 05:45:04,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:45:04,917 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 35 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:04,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 161 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-08 05:45:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2025-03-08 05:45:04,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 11 states have return successors, (48), 16 states have call predecessors, (48), 12 states have call successors, (48) [2025-03-08 05:45:04,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2025-03-08 05:45:04,939 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 51 [2025-03-08 05:45:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:04,939 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2025-03-08 05:45:04,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 17 states have internal predecessors, (55), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (18), 8 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-08 05:45:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2025-03-08 05:45:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:45:04,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:04,942 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:04,949 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-08 05:45:05,142 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-08 05:45:05,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:05,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1757221303, now seen corresponding path program 1 times [2025-03-08 05:45:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773026037] [2025-03-08 05:45:05,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:05,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:45:05,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:45:05,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:05,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 81 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-08 05:45:05,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773026037] [2025-03-08 05:45:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773026037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63107836] [2025-03-08 05:45:05,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:05,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:05,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:05,321 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-08 05:45:05,322 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-08 05:45:05,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:45:05,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:45:05,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:05,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:05,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:05,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:05,490 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-08 05:45:05,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:06,219 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 129 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 05:45:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63107836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:06,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2025-03-08 05:45:06,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308875251] [2025-03-08 05:45:06,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:06,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:45:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:06,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:45:06,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:45:06,222 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand has 23 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 23 states have internal predecessors, (75), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 10 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-08 05:45:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:06,755 INFO L93 Difference]: Finished difference Result 177 states and 369 transitions. [2025-03-08 05:45:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 05:45:06,756 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 23 states have internal predecessors, (75), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 10 states have call predecessors, (27), 18 states have call successors, (27) Word has length 107 [2025-03-08 05:45:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:06,758 INFO L225 Difference]: With dead ends: 177 [2025-03-08 05:45:06,760 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 05:45:06,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 05:45:06,762 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 78 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:06,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 352 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:45:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 05:45:06,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2025-03-08 05:45:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 64 states have internal predecessors, (73), 16 states have call successors, (16), 8 states have call predecessors, (16), 14 states have return successors, (43), 20 states have call predecessors, (43), 16 states have call successors, (43) [2025-03-08 05:45:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 132 transitions. [2025-03-08 05:45:06,787 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 132 transitions. Word has length 107 [2025-03-08 05:45:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:06,788 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 132 transitions. [2025-03-08 05:45:06,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 23 states have internal predecessors, (75), 18 states have call successors, (23), 1 states have call predecessors, (23), 9 states have return successors, (27), 10 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-08 05:45:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2025-03-08 05:45:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:45:06,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:06,793 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:06,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:45:06,993 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-08 05:45:06,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 869810860, now seen corresponding path program 1 times [2025-03-08 05:45:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268577513] [2025-03-08 05:45:06,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:45:07,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:45:07,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:07,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:07,191 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 49 proven. 151 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-03-08 05:45:07,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268577513] [2025-03-08 05:45:07,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268577513] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:07,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837671838] [2025-03-08 05:45:07,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:45:07,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:07,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:07,195 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-08 05:45:07,196 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-08 05:45:07,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:45:07,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:45:07,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:07,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:45:07,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 36 proven. 205 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2025-03-08 05:45:07,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 36 proven. 221 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-08 05:45:08,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837671838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:08,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:08,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 15] total 23 [2025-03-08 05:45:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912784123] [2025-03-08 05:45:08,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:08,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 05:45:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:08,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 05:45:08,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:45:08,232 INFO L87 Difference]: Start difference. First operand 93 states and 132 transitions. Second operand has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-08 05:45:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:08,417 INFO L93 Difference]: Finished difference Result 132 states and 227 transitions. [2025-03-08 05:45:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:45:08,417 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) Word has length 146 [2025-03-08 05:45:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:08,419 INFO L225 Difference]: With dead ends: 132 [2025-03-08 05:45:08,419 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 05:45:08,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 276 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2025-03-08 05:45:08,420 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:08,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 209 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 05:45:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 118. [2025-03-08 05:45:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.1428571428571428) internal successors, (88), 79 states have internal predecessors, (88), 21 states have call successors, (21), 8 states have call predecessors, (21), 19 states have return successors, (85), 30 states have call predecessors, (85), 21 states have call successors, (85) [2025-03-08 05:45:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 194 transitions. [2025-03-08 05:45:08,438 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 194 transitions. Word has length 146 [2025-03-08 05:45:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:08,438 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 194 transitions. [2025-03-08 05:45:08,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.6666666666666665) internal successors, (77), 23 states have internal predecessors, (77), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (30), 12 states have call predecessors, (30), 18 states have call successors, (30) [2025-03-08 05:45:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 194 transitions. [2025-03-08 05:45:08,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-03-08 05:45:08,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:08,443 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 19, 16, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:08,450 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-08 05:45:08,646 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-08 05:45:08,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:08,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash 108794173, now seen corresponding path program 2 times [2025-03-08 05:45:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:08,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-08 05:45:08,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:08,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 285 statements into 2 equivalence classes. [2025-03-08 05:45:08,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 05:45:08,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:08,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 94 proven. 566 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2025-03-08 05:45:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127436292] [2025-03-08 05:45:09,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127436292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:09,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140322089] [2025-03-08 05:45:09,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:09,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:09,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:09,007 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-08 05:45:09,009 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-08 05:45:09,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 285 statements into 2 equivalence classes. [2025-03-08 05:45:09,106 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 285 of 285 statements. [2025-03-08 05:45:09,106 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:09,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:09,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:45:09,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 94 proven. 566 refuted. 0 times theorem prover too weak. 1591 trivial. 0 not checked. [2025-03-08 05:45:09,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:10,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2251 backedges. 94 proven. 590 refuted. 0 times theorem prover too weak. 1567 trivial. 0 not checked. [2025-03-08 05:45:10,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140322089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:10,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:10,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 19 [2025-03-08 05:45:10,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240864650] [2025-03-08 05:45:10,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:10,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:45:10,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:10,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:45:10,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:45:10,489 INFO L87 Difference]: Start difference. First operand 118 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-08 05:45:10,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:10,630 INFO L93 Difference]: Finished difference Result 148 states and 283 transitions. [2025-03-08 05:45:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:45:10,631 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) Word has length 285 [2025-03-08 05:45:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:10,633 INFO L225 Difference]: With dead ends: 148 [2025-03-08 05:45:10,633 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 05:45:10,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 560 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:45:10,634 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 57 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:10,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 170 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 05:45:10,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2025-03-08 05:45:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 76 states have internal predecessors, (85), 20 states have call successors, (20), 8 states have call predecessors, (20), 18 states have return successors, (75), 28 states have call predecessors, (75), 20 states have call successors, (75) [2025-03-08 05:45:10,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 180 transitions. [2025-03-08 05:45:10,647 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 180 transitions. Word has length 285 [2025-03-08 05:45:10,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:10,648 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 180 transitions. [2025-03-08 05:45:10,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 16 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (23), 8 states have call predecessors, (23), 16 states have call successors, (23) [2025-03-08 05:45:10,648 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 180 transitions. [2025-03-08 05:45:10,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-08 05:45:10,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:10,654 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 36, 36, 31, 29, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 12, 11, 10, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:10,660 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-08 05:45:10,854 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-08 05:45:10,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:10,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:10,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1861076176, now seen corresponding path program 3 times [2025-03-08 05:45:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299288930] [2025-03-08 05:45:10,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:10,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 514 statements into 32 equivalence classes. [2025-03-08 05:45:10,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 120 of 514 statements. [2025-03-08 05:45:10,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 05:45:10,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:11,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 808 proven. 112 refuted. 0 times theorem prover too weak. 6731 trivial. 0 not checked. [2025-03-08 05:45:11,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299288930] [2025-03-08 05:45:11,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299288930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:11,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809010775] [2025-03-08 05:45:11,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:11,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:11,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:11,004 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-08 05:45:11,005 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-08 05:45:11,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 514 statements into 32 equivalence classes. [2025-03-08 05:45:11,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 120 of 514 statements. [2025-03-08 05:45:11,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 05:45:11,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:11,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:11,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 827 proven. 115 refuted. 0 times theorem prover too weak. 6709 trivial. 0 not checked. [2025-03-08 05:45:11,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 831 proven. 121 refuted. 0 times theorem prover too weak. 6699 trivial. 0 not checked. [2025-03-08 05:45:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809010775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:12,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 17 [2025-03-08 05:45:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532969045] [2025-03-08 05:45:12,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:12,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:45:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:12,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:45:12,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:45:12,480 INFO L87 Difference]: Start difference. First operand 113 states and 180 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-08 05:45:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:12,631 INFO L93 Difference]: Finished difference Result 159 states and 292 transitions. [2025-03-08 05:45:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 05:45:12,631 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) Word has length 514 [2025-03-08 05:45:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:12,633 INFO L225 Difference]: With dead ends: 159 [2025-03-08 05:45:12,633 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 05:45:12,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1043 GetRequests, 1018 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:45:12,634 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:12,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 05:45:12,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2025-03-08 05:45:12,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 94 states have internal predecessors, (107), 26 states have call successors, (26), 10 states have call predecessors, (26), 22 states have return successors, (116), 36 states have call predecessors, (116), 26 states have call successors, (116) [2025-03-08 05:45:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 249 transitions. [2025-03-08 05:45:12,645 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 249 transitions. Word has length 514 [2025-03-08 05:45:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:12,645 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 249 transitions. [2025-03-08 05:45:12,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 11 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 10 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-08 05:45:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 249 transitions. [2025-03-08 05:45:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2025-03-08 05:45:12,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:12,658 INFO L218 NwaCegarLoop]: trace histogram [66, 66, 57, 57, 52, 47, 33, 33, 33, 33, 33, 33, 33, 28, 28, 28, 28, 28, 28, 28, 24, 14, 14, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:12,664 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-08 05:45:12,858 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-08 05:45:12,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1445432073, now seen corresponding path program 4 times [2025-03-08 05:45:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900250623] [2025-03-08 05:45:12,859 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:45:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:12,876 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 841 statements into 2 equivalence classes. [2025-03-08 05:45:12,938 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 716 of 841 statements. [2025-03-08 05:45:12,938 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:45:12,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:13,380 INFO L134 CoverageAnalysis]: Checked inductivity of 20995 backedges. 311 proven. 1613 refuted. 0 times theorem prover too weak. 19071 trivial. 0 not checked. [2025-03-08 05:45:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900250623] [2025-03-08 05:45:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900250623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92022800] [2025-03-08 05:45:13,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:45:13,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:13,383 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-08 05:45:13,384 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-08 05:45:13,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 841 statements into 2 equivalence classes. [2025-03-08 05:45:13,587 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 716 of 841 statements. [2025-03-08 05:45:13,587 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:45:13,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:13,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:45:13,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 20995 backedges. 311 proven. 1613 refuted. 0 times theorem prover too weak. 19071 trivial. 0 not checked. [2025-03-08 05:45:13,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 20995 backedges. 311 proven. 1629 refuted. 0 times theorem prover too weak. 19055 trivial. 0 not checked. [2025-03-08 05:45:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92022800] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:15,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 17 [2025-03-08 05:45:15,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829370817] [2025-03-08 05:45:15,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:15,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 05:45:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:15,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 05:45:15,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:45:15,778 INFO L87 Difference]: Start difference. First operand 141 states and 249 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-03-08 05:45:15,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:15,957 INFO L93 Difference]: Finished difference Result 195 states and 463 transitions. [2025-03-08 05:45:15,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:45:15,957 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) Word has length 841 [2025-03-08 05:45:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:15,965 INFO L225 Difference]: With dead ends: 195 [2025-03-08 05:45:15,965 INFO L226 Difference]: Without dead ends: 191 [2025-03-08 05:45:15,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1673 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:45:15,966 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:15,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 180 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:15,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-08 05:45:15,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 156. [2025-03-08 05:45:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 101 states have (on average 1.1485148514851484) internal successors, (116), 103 states have internal predecessors, (116), 29 states have call successors, (29), 10 states have call predecessors, (29), 25 states have return successors, (161), 42 states have call predecessors, (161), 29 states have call successors, (161) [2025-03-08 05:45:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 306 transitions. [2025-03-08 05:45:15,986 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 306 transitions. Word has length 841 [2025-03-08 05:45:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:15,987 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 306 transitions. [2025-03-08 05:45:15,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 13 states have call successors, (18), 1 states have call predecessors, (18), 7 states have return successors, (21), 9 states have call predecessors, (21), 13 states have call successors, (21) [2025-03-08 05:45:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 306 transitions. [2025-03-08 05:45:15,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-03-08 05:45:15,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:15,991 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 43, 43, 34, 33, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 12, 12, 11, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:15,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 05:45:16,191 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-08 05:45:16,192 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash -470342676, now seen corresponding path program 5 times [2025-03-08 05:45:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:16,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137435275] [2025-03-08 05:45:16,192 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:45:16,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:16,203 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 593 statements into 41 equivalence classes. [2025-03-08 05:45:16,231 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 196 of 593 statements. [2025-03-08 05:45:16,231 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 05:45:16,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10249 backedges. 715 proven. 1089 refuted. 0 times theorem prover too weak. 8445 trivial. 0 not checked. [2025-03-08 05:45:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137435275] [2025-03-08 05:45:16,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137435275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:16,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783044697] [2025-03-08 05:45:16,422 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:45:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:16,424 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-08 05:45:16,426 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-08 05:45:16,527 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 593 statements into 41 equivalence classes. [2025-03-08 05:45:16,566 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 196 of 593 statements. [2025-03-08 05:45:16,566 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 05:45:16,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:16,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 05:45:16,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10249 backedges. 5627 proven. 129 refuted. 0 times theorem prover too weak. 4493 trivial. 0 not checked. [2025-03-08 05:45:16,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10249 backedges. 716 proven. 1090 refuted. 0 times theorem prover too weak. 8443 trivial. 0 not checked. [2025-03-08 05:45:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783044697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:18,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:18,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 24 [2025-03-08 05:45:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8995899] [2025-03-08 05:45:18,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:18,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 05:45:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:18,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 05:45:18,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:45:18,421 INFO L87 Difference]: Start difference. First operand 156 states and 306 transitions. Second operand has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 24 states have internal predecessors, (92), 16 states have call successors, (28), 2 states have call predecessors, (28), 8 states have return successors, (31), 11 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-08 05:45:18,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:18,796 INFO L93 Difference]: Finished difference Result 347 states and 874 transitions. [2025-03-08 05:45:18,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:45:18,797 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 24 states have internal predecessors, (92), 16 states have call successors, (28), 2 states have call predecessors, (28), 8 states have return successors, (31), 11 states have call predecessors, (31), 16 states have call successors, (31) Word has length 593 [2025-03-08 05:45:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:18,799 INFO L225 Difference]: With dead ends: 347 [2025-03-08 05:45:18,799 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 05:45:18,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1216 GetRequests, 1172 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=1192, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 05:45:18,803 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 56 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:18,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 325 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:45:18,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 05:45:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2025-03-08 05:45:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 111 states have internal predecessors, (128), 31 states have call successors, (31), 12 states have call predecessors, (31), 26 states have return successors, (183), 44 states have call predecessors, (183), 31 states have call successors, (183) [2025-03-08 05:45:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 342 transitions. [2025-03-08 05:45:18,848 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 342 transitions. Word has length 593 [2025-03-08 05:45:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 342 transitions. [2025-03-08 05:45:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 24 states have internal predecessors, (92), 16 states have call successors, (28), 2 states have call predecessors, (28), 8 states have return successors, (31), 11 states have call predecessors, (31), 16 states have call successors, (31) [2025-03-08 05:45:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 342 transitions. [2025-03-08 05:45:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-08 05:45:18,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:18,851 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 29, 29, 24, 22, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 9, 8, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:18,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 05:45:19,055 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-08 05:45:19,055 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:19,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:19,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1385566663, now seen corresponding path program 6 times [2025-03-08 05:45:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525188133] [2025-03-08 05:45:19,055 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:45:19,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:19,065 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 404 statements into 24 equivalence classes. [2025-03-08 05:45:19,092 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 268 of 404 statements. [2025-03-08 05:45:19,092 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-08 05:45:19,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:19,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4655 backedges. 258 proven. 736 refuted. 0 times theorem prover too weak. 3661 trivial. 0 not checked. [2025-03-08 05:45:19,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525188133] [2025-03-08 05:45:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525188133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032168203] [2025-03-08 05:45:19,241 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:45:19,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:19,242 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:19,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 05:45:19,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 404 statements into 24 equivalence classes. [2025-03-08 05:45:19,380 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) and asserted 268 of 404 statements. [2025-03-08 05:45:19,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2025-03-08 05:45:19,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:19,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:19,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4655 backedges. 1828 proven. 49 refuted. 0 times theorem prover too weak. 2778 trivial. 0 not checked. [2025-03-08 05:45:19,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4655 backedges. 259 proven. 756 refuted. 0 times theorem prover too weak. 3640 trivial. 0 not checked. [2025-03-08 05:45:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032168203] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:20,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 18 [2025-03-08 05:45:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146612985] [2025-03-08 05:45:20,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:20,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:45:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:20,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:45:20,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:45:20,568 INFO L87 Difference]: Start difference. First operand 168 states and 342 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 11 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-08 05:45:20,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:20,800 INFO L93 Difference]: Finished difference Result 330 states and 775 transitions. [2025-03-08 05:45:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:45:20,801 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 11 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) Word has length 404 [2025-03-08 05:45:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:20,803 INFO L225 Difference]: With dead ends: 330 [2025-03-08 05:45:20,803 INFO L226 Difference]: Without dead ends: 170 [2025-03-08 05:45:20,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 797 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:45:20,805 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 34 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:20,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 258 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-08 05:45:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-03-08 05:45:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 110 states have internal predecessors, (130), 29 states have call successors, (29), 15 states have call predecessors, (29), 25 states have return successors, (138), 41 states have call predecessors, (138), 29 states have call successors, (138) [2025-03-08 05:45:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 297 transitions. [2025-03-08 05:45:20,824 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 297 transitions. Word has length 404 [2025-03-08 05:45:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 297 transitions. [2025-03-08 05:45:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 18 states have internal predecessors, (81), 11 states have call successors, (23), 2 states have call predecessors, (23), 8 states have return successors, (27), 9 states have call predecessors, (27), 11 states have call successors, (27) [2025-03-08 05:45:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 297 transitions. [2025-03-08 05:45:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2025-03-08 05:45:20,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:20,827 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 25, 24, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:20,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 05:45:21,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 05:45:21,028 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:21,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:21,028 INFO L85 PathProgramCache]: Analyzing trace with hash 685535414, now seen corresponding path program 7 times [2025-03-08 05:45:21,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053082618] [2025-03-08 05:45:21,028 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:45:21,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:21,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-08 05:45:21,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-08 05:45:21,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5956 backedges. 204 proven. 912 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2025-03-08 05:45:21,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053082618] [2025-03-08 05:45:21,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053082618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:21,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893166916] [2025-03-08 05:45:21,364 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:45:21,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:21,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:21,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:21,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 05:45:21,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 455 statements into 1 equivalence classes. [2025-03-08 05:45:21,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 455 of 455 statements. [2025-03-08 05:45:21,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:21,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:45:21,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 5956 backedges. 204 proven. 912 refuted. 0 times theorem prover too weak. 4840 trivial. 0 not checked. [2025-03-08 05:45:21,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5956 backedges. 204 proven. 933 refuted. 0 times theorem prover too weak. 4819 trivial. 0 not checked. [2025-03-08 05:45:23,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893166916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:23,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:23,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 19 [2025-03-08 05:45:23,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052849775] [2025-03-08 05:45:23,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:23,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:45:23,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:23,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:45:23,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:45:23,170 INFO L87 Difference]: Start difference. First operand 167 states and 297 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 15 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2025-03-08 05:45:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:23,315 INFO L93 Difference]: Finished difference Result 214 states and 466 transitions. [2025-03-08 05:45:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:45:23,316 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 15 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) Word has length 455 [2025-03-08 05:45:23,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:23,319 INFO L225 Difference]: With dead ends: 214 [2025-03-08 05:45:23,319 INFO L226 Difference]: Without dead ends: 210 [2025-03-08 05:45:23,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 900 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:45:23,321 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:23,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 198 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-08 05:45:23,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2025-03-08 05:45:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 110 states have (on average 1.1636363636363636) internal successors, (128), 108 states have internal predecessors, (128), 29 states have call successors, (29), 15 states have call predecessors, (29), 24 states have return successors, (131), 40 states have call predecessors, (131), 29 states have call successors, (131) [2025-03-08 05:45:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 288 transitions. [2025-03-08 05:45:23,336 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 288 transitions. Word has length 455 [2025-03-08 05:45:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:23,337 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 288 transitions. [2025-03-08 05:45:23,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 15 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (24), 10 states have call predecessors, (24), 15 states have call successors, (24) [2025-03-08 05:45:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 288 transitions. [2025-03-08 05:45:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-08 05:45:23,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:23,339 INFO L218 NwaCegarLoop]: trace histogram [38, 38, 33, 33, 28, 27, 19, 19, 19, 19, 19, 19, 19, 16, 16, 16, 16, 16, 16, 16, 12, 10, 8, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:23,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 05:45:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 05:45:23,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:23,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash -526005879, now seen corresponding path program 8 times [2025-03-08 05:45:23,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341542110] [2025-03-08 05:45:23,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:23,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 485 statements into 2 equivalence classes. [2025-03-08 05:45:23,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 05:45:23,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:23,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6817 backedges. 728 proven. 386 refuted. 0 times theorem prover too weak. 5703 trivial. 0 not checked. [2025-03-08 05:45:23,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341542110] [2025-03-08 05:45:23,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341542110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:23,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101266912] [2025-03-08 05:45:23,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:23,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:23,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:23,887 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:23,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 05:45:24,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 485 statements into 2 equivalence classes. [2025-03-08 05:45:24,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 485 of 485 statements. [2025-03-08 05:45:24,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:24,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:24,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 05:45:24,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6817 backedges. 282 proven. 778 refuted. 0 times theorem prover too weak. 5757 trivial. 0 not checked. [2025-03-08 05:45:24,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6817 backedges. 284 proven. 792 refuted. 0 times theorem prover too weak. 5741 trivial. 0 not checked. [2025-03-08 05:45:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101266912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:25,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 15] total 29 [2025-03-08 05:45:25,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110421860] [2025-03-08 05:45:25,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:25,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 05:45:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:25,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 05:45:25,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-03-08 05:45:25,477 INFO L87 Difference]: Start difference. First operand 164 states and 288 transitions. Second operand has 29 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 29 states have internal predecessors, (90), 20 states have call successors, (27), 1 states have call predecessors, (27), 13 states have return successors, (33), 17 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-08 05:45:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:26,150 INFO L93 Difference]: Finished difference Result 456 states and 1062 transitions. [2025-03-08 05:45:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 05:45:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 29 states have internal predecessors, (90), 20 states have call successors, (27), 1 states have call predecessors, (27), 13 states have return successors, (33), 17 states have call predecessors, (33), 20 states have call successors, (33) Word has length 485 [2025-03-08 05:45:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:26,154 INFO L225 Difference]: With dead ends: 456 [2025-03-08 05:45:26,154 INFO L226 Difference]: Without dead ends: 297 [2025-03-08 05:45:26,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 951 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=433, Invalid=2647, Unknown=0, NotChecked=0, Total=3080 [2025-03-08 05:45:26,157 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 128 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:26,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 426 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:45:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-08 05:45:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 248. [2025-03-08 05:45:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 168 states have (on average 1.130952380952381) internal successors, (190), 161 states have internal predecessors, (190), 47 states have call successors, (47), 25 states have call predecessors, (47), 32 states have return successors, (253), 61 states have call predecessors, (253), 47 states have call successors, (253) [2025-03-08 05:45:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 490 transitions. [2025-03-08 05:45:26,176 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 490 transitions. Word has length 485 [2025-03-08 05:45:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 490 transitions. [2025-03-08 05:45:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 3.3333333333333335) internal successors, (90), 29 states have internal predecessors, (90), 20 states have call successors, (27), 1 states have call predecessors, (27), 13 states have return successors, (33), 17 states have call predecessors, (33), 20 states have call successors, (33) [2025-03-08 05:45:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 490 transitions. [2025-03-08 05:45:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-08 05:45:26,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:26,180 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 28, 28, 23, 22, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 8, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:26,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 05:45:26,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:26,381 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:26,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:26,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1580308533, now seen corresponding path program 9 times [2025-03-08 05:45:26,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:26,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270355847] [2025-03-08 05:45:26,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:26,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:26,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 391 statements into 24 equivalence classes. [2025-03-08 05:45:26,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 146 of 391 statements. [2025-03-08 05:45:26,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 05:45:26,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:26,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 651 proven. 138 refuted. 0 times theorem prover too weak. 3559 trivial. 0 not checked. [2025-03-08 05:45:26,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270355847] [2025-03-08 05:45:26,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270355847] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:26,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101366672] [2025-03-08 05:45:26,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:26,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:26,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:26,505 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:26,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 05:45:26,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 391 statements into 24 equivalence classes. [2025-03-08 05:45:26,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 146 of 391 statements. [2025-03-08 05:45:26,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 05:45:26,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:26,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:26,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 1850 proven. 31 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2025-03-08 05:45:26,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4348 backedges. 721 proven. 160 refuted. 0 times theorem prover too weak. 3467 trivial. 0 not checked. [2025-03-08 05:45:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101366672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:27,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 20 [2025-03-08 05:45:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094535267] [2025-03-08 05:45:27,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:27,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:45:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:27,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:45:27,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:45:27,698 INFO L87 Difference]: Start difference. First operand 248 states and 490 transitions. Second operand has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 12 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-08 05:45:27,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:27,904 INFO L93 Difference]: Finished difference Result 492 states and 1050 transitions. [2025-03-08 05:45:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:45:27,905 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 12 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 391 [2025-03-08 05:45:27,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:27,909 INFO L225 Difference]: With dead ends: 492 [2025-03-08 05:45:27,909 INFO L226 Difference]: Without dead ends: 255 [2025-03-08 05:45:27,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 769 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-03-08 05:45:27,913 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:27,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 229 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:27,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-08 05:45:27,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2025-03-08 05:45:27,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 172 states have (on average 1.0988372093023255) internal successors, (189), 164 states have internal predecessors, (189), 47 states have call successors, (47), 26 states have call predecessors, (47), 32 states have return successors, (241), 61 states have call predecessors, (241), 47 states have call successors, (241) [2025-03-08 05:45:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 477 transitions. [2025-03-08 05:45:27,940 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 477 transitions. Word has length 391 [2025-03-08 05:45:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:27,940 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 477 transitions. [2025-03-08 05:45:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.1) internal successors, (82), 20 states have internal predecessors, (82), 12 states have call successors, (23), 2 states have call predecessors, (23), 7 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-08 05:45:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 477 transitions. [2025-03-08 05:45:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2025-03-08 05:45:27,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:27,946 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 37, 37, 33, 30, 22, 22, 22, 22, 22, 22, 22, 18, 18, 18, 18, 18, 18, 18, 15, 11, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:27,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 05:45:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:45:28,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1407951146, now seen corresponding path program 10 times [2025-03-08 05:45:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710893685] [2025-03-08 05:45:28,147 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:45:28,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:28,160 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 553 statements into 2 equivalence classes. [2025-03-08 05:45:28,189 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 470 of 553 statements. [2025-03-08 05:45:28,189 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:45:28,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8947 backedges. 560 proven. 521 refuted. 0 times theorem prover too weak. 7866 trivial. 0 not checked. [2025-03-08 05:45:28,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:28,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710893685] [2025-03-08 05:45:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710893685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:28,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784344449] [2025-03-08 05:45:28,490 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:45:28,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:28,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:28,494 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:28,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 05:45:28,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 553 statements into 2 equivalence classes. [2025-03-08 05:45:28,725 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 470 of 553 statements. [2025-03-08 05:45:28,725 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 05:45:28,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:28,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:45:28,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8947 backedges. 279 proven. 1127 refuted. 0 times theorem prover too weak. 7541 trivial. 0 not checked. [2025-03-08 05:45:28,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8947 backedges. 287 proven. 1140 refuted. 0 times theorem prover too weak. 7520 trivial. 0 not checked. [2025-03-08 05:45:30,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784344449] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:30,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:30,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 25 [2025-03-08 05:45:30,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047812191] [2025-03-08 05:45:30,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:30,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 05:45:30,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:30,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 05:45:30,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-03-08 05:45:30,609 INFO L87 Difference]: Start difference. First operand 252 states and 477 transitions. Second operand has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 15 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2025-03-08 05:45:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:30,879 INFO L93 Difference]: Finished difference Result 330 states and 788 transitions. [2025-03-08 05:45:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:45:30,880 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 15 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) Word has length 553 [2025-03-08 05:45:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:30,883 INFO L225 Difference]: With dead ends: 330 [2025-03-08 05:45:30,883 INFO L226 Difference]: Without dead ends: 214 [2025-03-08 05:45:30,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1128 GetRequests, 1088 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=891, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 05:45:30,886 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:30,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 391 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:45:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-08 05:45:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2025-03-08 05:45:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 143 states have (on average 1.118881118881119) internal successors, (160), 136 states have internal predecessors, (160), 35 states have call successors, (35), 24 states have call predecessors, (35), 26 states have return successors, (91), 44 states have call predecessors, (91), 35 states have call successors, (91) [2025-03-08 05:45:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2025-03-08 05:45:30,903 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 553 [2025-03-08 05:45:30,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:30,904 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2025-03-08 05:45:30,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 25 states have internal predecessors, (80), 15 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (30), 16 states have call predecessors, (30), 15 states have call successors, (30) [2025-03-08 05:45:30,905 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2025-03-08 05:45:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-08 05:45:30,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:30,908 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 29, 29, 25, 23, 17, 17, 17, 17, 17, 17, 17, 14, 14, 14, 14, 14, 14, 14, 11, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:30,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-08 05:45:31,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 05:45:31,109 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:31,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:31,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1100642248, now seen corresponding path program 11 times [2025-03-08 05:45:31,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:31,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555366368] [2025-03-08 05:45:31,109 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:45:31,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:31,118 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 430 statements into 27 equivalence classes. [2025-03-08 05:45:31,127 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 204 of 430 statements. [2025-03-08 05:45:31,127 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 05:45:31,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 451 proven. 356 refuted. 0 times theorem prover too weak. 4522 trivial. 0 not checked. [2025-03-08 05:45:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555366368] [2025-03-08 05:45:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555366368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848713504] [2025-03-08 05:45:31,228 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 05:45:31,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:31,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:31,229 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:31,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 05:45:31,370 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 430 statements into 27 equivalence classes. [2025-03-08 05:45:31,409 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 204 of 430 statements. [2025-03-08 05:45:31,409 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 05:45:31,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:31,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:45:31,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:31,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 3013 proven. 21 refuted. 0 times theorem prover too weak. 2295 trivial. 0 not checked. [2025-03-08 05:45:31,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:32,316 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 504 proven. 418 refuted. 0 times theorem prover too weak. 4407 trivial. 0 not checked. [2025-03-08 05:45:32,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848713504] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:32,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:32,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2025-03-08 05:45:32,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608163823] [2025-03-08 05:45:32,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:32,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 05:45:32,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:32,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 05:45:32,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:45:32,317 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 10 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (21), 5 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 05:45:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:32,517 INFO L93 Difference]: Finished difference Result 381 states and 537 transitions. [2025-03-08 05:45:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:45:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 10 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (21), 5 states have call predecessors, (21), 10 states have call successors, (21) Word has length 430 [2025-03-08 05:45:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:32,520 INFO L225 Difference]: With dead ends: 381 [2025-03-08 05:45:32,520 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 05:45:32,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 847 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2025-03-08 05:45:32,522 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:32,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 140 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 05:45:32,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 197. [2025-03-08 05:45:32,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.1231884057971016) internal successors, (155), 131 states have internal predecessors, (155), 34 states have call successors, (34), 24 states have call predecessors, (34), 24 states have return successors, (82), 41 states have call predecessors, (82), 34 states have call successors, (82) [2025-03-08 05:45:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 271 transitions. [2025-03-08 05:45:32,534 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 271 transitions. Word has length 430 [2025-03-08 05:45:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:32,535 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 271 transitions. [2025-03-08 05:45:32,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.166666666666667) internal successors, (75), 19 states have internal predecessors, (75), 10 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (21), 5 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-08 05:45:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 271 transitions. [2025-03-08 05:45:32,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-03-08 05:45:32,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:32,537 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 37, 37, 35, 30, 23, 23, 23, 23, 23, 23, 23, 18, 18, 18, 18, 18, 18, 18, 17, 11, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:32,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-08 05:45:32,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:32,739 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:32,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2096094284, now seen corresponding path program 12 times [2025-03-08 05:45:32,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:32,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315403996] [2025-03-08 05:45:32,740 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:45:32,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:32,749 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 567 statements into 32 equivalence classes. [2025-03-08 05:45:32,762 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 187 of 567 statements. [2025-03-08 05:45:32,762 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 05:45:32,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9458 backedges. 1099 proven. 93 refuted. 0 times theorem prover too weak. 8266 trivial. 0 not checked. [2025-03-08 05:45:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:32,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315403996] [2025-03-08 05:45:32,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315403996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:32,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330493532] [2025-03-08 05:45:32,872 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 05:45:32,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:32,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:32,874 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:32,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 05:45:33,013 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 567 statements into 32 equivalence classes. [2025-03-08 05:45:33,046 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 187 of 567 statements. [2025-03-08 05:45:33,046 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-08 05:45:33,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:33,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:45:33,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:33,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9458 backedges. 2787 proven. 18 refuted. 0 times theorem prover too weak. 6653 trivial. 0 not checked. [2025-03-08 05:45:33,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9458 backedges. 1231 proven. 120 refuted. 0 times theorem prover too weak. 8107 trivial. 0 not checked. [2025-03-08 05:45:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330493532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:34,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 18 [2025-03-08 05:45:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183843771] [2025-03-08 05:45:34,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:34,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 05:45:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:34,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 05:45:34,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:45:34,426 INFO L87 Difference]: Start difference. First operand 197 states and 271 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (26), 6 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:45:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:34,543 INFO L93 Difference]: Finished difference Result 360 states and 503 transitions. [2025-03-08 05:45:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:45:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (26), 6 states have call predecessors, (26), 11 states have call successors, (26) Word has length 567 [2025-03-08 05:45:34,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:34,545 INFO L225 Difference]: With dead ends: 360 [2025-03-08 05:45:34,545 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 05:45:34,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1148 GetRequests, 1122 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:45:34,547 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:34,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 231 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 05:45:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2025-03-08 05:45:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 122 states have (on average 1.1229508196721312) internal successors, (137), 117 states have internal predecessors, (137), 30 states have call successors, (30), 22 states have call predecessors, (30), 21 states have return successors, (59), 34 states have call predecessors, (59), 30 states have call successors, (59) [2025-03-08 05:45:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 226 transitions. [2025-03-08 05:45:34,561 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 226 transitions. Word has length 567 [2025-03-08 05:45:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:34,561 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 226 transitions. [2025-03-08 05:45:34,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (26), 6 states have call predecessors, (26), 11 states have call successors, (26) [2025-03-08 05:45:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 226 transitions. [2025-03-08 05:45:34,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 05:45:34,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:34,564 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 28, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 11, 7, 5, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:34,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 05:45:34,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:34,765 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:34,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:34,766 INFO L85 PathProgramCache]: Analyzing trace with hash 592037828, now seen corresponding path program 13 times [2025-03-08 05:45:34,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:34,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305806218] [2025-03-08 05:45:34,766 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:45:34,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:34,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 05:45:34,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 05:45:34,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:34,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 6109 backedges. 717 proven. 114 refuted. 0 times theorem prover too weak. 5278 trivial. 0 not checked. [2025-03-08 05:45:34,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305806218] [2025-03-08 05:45:34,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305806218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:34,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226444188] [2025-03-08 05:45:34,988 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 05:45:34,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:34,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:34,990 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:34,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 05:45:35,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 05:45:35,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 05:45:35,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:35,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:35,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:35,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6109 backedges. 717 proven. 114 refuted. 0 times theorem prover too weak. 5278 trivial. 0 not checked. [2025-03-08 05:45:35,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6109 backedges. 717 proven. 126 refuted. 0 times theorem prover too weak. 5266 trivial. 0 not checked. [2025-03-08 05:45:36,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226444188] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:36,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-03-08 05:45:36,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435190387] [2025-03-08 05:45:36,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:45:36,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:36,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:45:36,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:45:36,227 INFO L87 Difference]: Start difference. First operand 174 states and 226 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 8 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 12 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-08 05:45:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:36,366 INFO L93 Difference]: Finished difference Result 194 states and 253 transitions. [2025-03-08 05:45:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:45:36,366 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 8 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 12 states have call predecessors, (19), 8 states have call successors, (19) Word has length 461 [2025-03-08 05:45:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:36,368 INFO L225 Difference]: With dead ends: 194 [2025-03-08 05:45:36,368 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 05:45:36,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 914 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:45:36,370 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 12 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:36,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 278 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:36,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 05:45:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2025-03-08 05:45:36,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 124 states have (on average 1.1209677419354838) internal successors, (139), 119 states have internal predecessors, (139), 30 states have call successors, (30), 22 states have call predecessors, (30), 22 states have return successors, (59), 35 states have call predecessors, (59), 30 states have call successors, (59) [2025-03-08 05:45:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 228 transitions. [2025-03-08 05:45:36,422 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 228 transitions. Word has length 461 [2025-03-08 05:45:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:36,422 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 228 transitions. [2025-03-08 05:45:36,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 15 states have internal predecessors, (58), 8 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 12 states have call predecessors, (19), 8 states have call successors, (19) [2025-03-08 05:45:36,423 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2025-03-08 05:45:36,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 05:45:36,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:36,425 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 9, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:36,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 05:45:36,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:36,626 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:36,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash -185548246, now seen corresponding path program 14 times [2025-03-08 05:45:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:36,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619834631] [2025-03-08 05:45:36,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:36,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:36,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 459 statements into 2 equivalence classes. [2025-03-08 05:45:36,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 05:45:36,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:36,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 604 proven. 200 refuted. 0 times theorem prover too weak. 5252 trivial. 0 not checked. [2025-03-08 05:45:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619834631] [2025-03-08 05:45:36,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619834631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:36,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997358434] [2025-03-08 05:45:36,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:45:36,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:36,869 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:36,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 05:45:37,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 459 statements into 2 equivalence classes. [2025-03-08 05:45:37,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 05:45:37,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:45:37,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:37,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 05:45:37,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 604 proven. 200 refuted. 0 times theorem prover too weak. 5252 trivial. 0 not checked. [2025-03-08 05:45:37,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:38,089 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 604 proven. 210 refuted. 0 times theorem prover too weak. 5242 trivial. 0 not checked. [2025-03-08 05:45:38,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997358434] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:38,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:38,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 15 [2025-03-08 05:45:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388545671] [2025-03-08 05:45:38,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:38,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:45:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:38,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:45:38,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:45:38,091 INFO L87 Difference]: Start difference. First operand 177 states and 228 transitions. Second operand has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-08 05:45:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:38,171 INFO L93 Difference]: Finished difference Result 189 states and 241 transitions. [2025-03-08 05:45:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:45:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) Word has length 459 [2025-03-08 05:45:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:38,173 INFO L225 Difference]: With dead ends: 189 [2025-03-08 05:45:38,173 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 05:45:38,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 933 GetRequests, 910 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2025-03-08 05:45:38,175 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:38,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 128 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 05:45:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2025-03-08 05:45:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 124 states have (on average 1.1209677419354838) internal successors, (139), 119 states have internal predecessors, (139), 30 states have call successors, (30), 22 states have call predecessors, (30), 22 states have return successors, (58), 35 states have call predecessors, (58), 30 states have call successors, (58) [2025-03-08 05:45:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 227 transitions. [2025-03-08 05:45:38,185 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 227 transitions. Word has length 459 [2025-03-08 05:45:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:38,185 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 227 transitions. [2025-03-08 05:45:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (19), 11 states have call predecessors, (19), 9 states have call successors, (19) [2025-03-08 05:45:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 227 transitions. [2025-03-08 05:45:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 05:45:38,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:38,187 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 26, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 9, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:38,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 05:45:38,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 05:45:38,388 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:38,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:38,388 INFO L85 PathProgramCache]: Analyzing trace with hash 820249680, now seen corresponding path program 15 times [2025-03-08 05:45:38,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:38,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120792647] [2025-03-08 05:45:38,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:38,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:38,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 459 statements into 32 equivalence classes. [2025-03-08 05:45:38,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) and asserted 274 of 459 statements. [2025-03-08 05:45:38,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2025-03-08 05:45:38,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 411 proven. 227 refuted. 0 times theorem prover too weak. 5418 trivial. 0 not checked. [2025-03-08 05:45:38,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:45:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120792647] [2025-03-08 05:45:38,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120792647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:45:38,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616993489] [2025-03-08 05:45:38,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:45:38,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:45:38,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:45:38,501 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:45:38,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 05:45:38,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 459 statements into 32 equivalence classes. [2025-03-08 05:45:38,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) and asserted 274 of 459 statements. [2025-03-08 05:45:38,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2025-03-08 05:45:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:45:38,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:45:38,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:45:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3248 proven. 6 refuted. 0 times theorem prover too weak. 2802 trivial. 0 not checked. [2025-03-08 05:45:38,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:45:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 480 proven. 279 refuted. 0 times theorem prover too weak. 5297 trivial. 0 not checked. [2025-03-08 05:45:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616993489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:45:39,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:45:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-08 05:45:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953658070] [2025-03-08 05:45:39,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:45:39,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:45:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:45:39,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:45:39,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:45:39,516 INFO L87 Difference]: Start difference. First operand 177 states and 227 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 05:45:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:45:39,623 INFO L93 Difference]: Finished difference Result 329 states and 432 transitions. [2025-03-08 05:45:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:45:39,623 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) Word has length 459 [2025-03-08 05:45:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:45:39,625 INFO L225 Difference]: With dead ends: 329 [2025-03-08 05:45:39,625 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 05:45:39,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 908 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:45:39,626 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:45:39,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 234 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:45:39,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 05:45:39,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2025-03-08 05:45:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 114 states have (on average 1.131578947368421) internal successors, (129), 109 states have internal predecessors, (129), 28 states have call successors, (28), 22 states have call predecessors, (28), 18 states have return successors, (46), 29 states have call predecessors, (46), 28 states have call successors, (46) [2025-03-08 05:45:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 203 transitions. [2025-03-08 05:45:39,636 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 203 transitions. Word has length 459 [2025-03-08 05:45:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:45:39,636 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 203 transitions. [2025-03-08 05:45:39,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 7 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (20), 5 states have call predecessors, (20), 7 states have call successors, (20) [2025-03-08 05:45:39,636 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 203 transitions. [2025-03-08 05:45:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-08 05:45:39,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:45:39,639 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:39,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 05:45:39,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 05:45:39,840 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:45:39,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:45:39,840 INFO L85 PathProgramCache]: Analyzing trace with hash 692310468, now seen corresponding path program 16 times [2025-03-08 05:45:39,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:45:39,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924534200] [2025-03-08 05:45:39,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 05:45:39,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:45:39,852 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 460 statements into 2 equivalence classes. [2025-03-08 05:45:39,877 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 05:45:39,877 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 05:45:39,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:45:39,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 05:45:39,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-08 05:45:39,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-08 05:45:39,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:45:39,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 05:45:39,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 05:45:39,942 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 05:45:39,943 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 05:45:39,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:45:39,946 INFO L422 BasicCegarLoop]: Path program histogram: [16, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:45:40,018 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 05:45:40,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:45:40 BoogieIcfgContainer [2025-03-08 05:45:40,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 05:45:40,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 05:45:40,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 05:45:40,020 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 05:45:40,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:45:00" (3/4) ... [2025-03-08 05:45:40,021 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 05:45:40,087 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 257. [2025-03-08 05:45:40,202 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 05:45:40,203 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 05:45:40,203 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 05:45:40,204 INFO L158 Benchmark]: Toolchain (without parser) took 40241.09ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 114.5MB in the beginning and 499.0MB in the end (delta: -384.5MB). Peak memory consumption was 100.6MB. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.65ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 103.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.50ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: Boogie Preprocessor took 18.83ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: IcfgBuilder took 197.65ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 90.1MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: TraceAbstraction took 39667.60ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 89.6MB in the beginning and 515.8MB in the end (delta: -426.2MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. [2025-03-08 05:45:40,205 INFO L158 Benchmark]: Witness Printer took 182.73ms. Allocated memory is still 629.1MB. Free memory was 515.8MB in the beginning and 499.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 05:45:40,206 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.62ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.65ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 103.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.50ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 102.3MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.83ms. Allocated memory is still 142.6MB. Free memory was 102.3MB in the beginning and 101.3MB in the end (delta: 985.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 197.65ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 90.1MB in the end (delta: 11.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 39667.60ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 89.6MB in the beginning and 515.8MB in the end (delta: -426.2MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB. * Witness Printer took 182.73ms. Allocated memory is still 629.1MB. Free memory was 515.8MB in the beginning and 499.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 8; VAL [x=8] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=8] [L39] int result = fibo1(x); [L40] COND TRUE result == 21 VAL [x=8] [L41] reach_error() VAL [x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 41 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.5s, OverallIterations: 24, TraceHistogramMax: 66, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.1s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 808 mSDsluCounter, 4989 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4362 mSDsCounter, 888 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5724 IncrementalHoareTripleChecker+Invalid, 6612 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 888 mSolverCounterUnsat, 627 mSDtfsCounter, 5724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15043 GetRequests, 14413 SyntacticMatches, 114 SemanticMatches, 516 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3180 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=252occurred in iteration=17, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 302 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 15123 NumberOfCodeBlocks, 10781 NumberOfCodeBlocksAsserted, 212 NumberOfCheckSat, 21919 ConstructedInterpolants, 0 QuantifiedInterpolants, 27492 SizeOfPredicates, 79 NumberOfNonLiveVariables, 11625 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 65 InterpolantComputations, 2 PerfectInterpolantSequences, 295221/317361 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-08 05:45:40,231 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