./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-1.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 17c70baee0bc6a4a26b6403fb6f46125ad9d7f8a7127109634f2327c61aaf5cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:35:20,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:35:20,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:35:20,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:35:20,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:35:20,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:35:20,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:35:20,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:35:20,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:35:20,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:35:20,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:35:20,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:35:20,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:35:20,244 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:35:20,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:35:20,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:35:20,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:20,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:35:20,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:35:20,246 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 -> 17c70baee0bc6a4a26b6403fb6f46125ad9d7f8a7127109634f2327c61aaf5cb [2025-03-03 14:35:20,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:35:20,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:35:20,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:35:20,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:35:20,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:35:20,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-1.c [2025-03-03 14:35:21,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb64eedf2/a0e6cdcd1f2f40169f3ad8fe37185ac9/FLAGf2e4b3e24 [2025-03-03 14:35:21,886 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:35:21,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-1.c [2025-03-03 14:35:21,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb64eedf2/a0e6cdcd1f2f40169f3ad8fe37185ac9/FLAGf2e4b3e24 [2025-03-03 14:35:22,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb64eedf2/a0e6cdcd1f2f40169f3ad8fe37185ac9 [2025-03-03 14:35:22,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:35:22,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:35:22,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:22,197 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:35:22,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:35:22,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,200 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bc94ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22, skipping insertion in model container [2025-03-03 14:35:22,200 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:35:22,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-1.c[741,754] [2025-03-03 14:35:22,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:22,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:35:22,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-1.c[741,754] [2025-03-03 14:35:22,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:22,341 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:35:22,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22 WrapperNode [2025-03-03 14:35:22,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:22,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:22,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:35:22,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:35:22,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,359 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-03 14:35:22,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:22,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:35:22,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:35:22,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:35:22,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,372 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:35:22,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:35:22,380 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:35:22,380 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:35:22,380 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:35:22,381 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (1/1) ... [2025-03-03 14:35:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:22,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:22,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:35:22,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:35:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:35:22,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:35:22,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:35:22,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:35:22,427 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-03 14:35:22,427 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-03 14:35:22,468 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:35:22,469 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:35:22,552 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-03 14:35:22,558 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:35:22,558 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:35:22,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:35:22,567 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:35:22,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:22 BoogieIcfgContainer [2025-03-03 14:35:22,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:35:22,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:35:22,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:35:22,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:35:22,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:35:22" (1/3) ... [2025-03-03 14:35:22,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efc436f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:22, skipping insertion in model container [2025-03-03 14:35:22,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:22" (2/3) ... [2025-03-03 14:35:22,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efc436f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:22, skipping insertion in model container [2025-03-03 14:35:22,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:22" (3/3) ... [2025-03-03 14:35:22,576 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2025-03-03 14:35:22,586 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:35:22,588 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_7-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:35:22,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:35:22,635 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;@6ad41bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:35:22,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:35:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:35:22,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:35:22,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:22,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:22,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:22,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-03-03 14:35:22,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:22,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963929501] [2025-03-03 14:35:22,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:35:22,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:35:22,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:22,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:35:22,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:22,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963929501] [2025-03-03 14:35:22,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963929501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:35:22,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:35:22,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:35:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278397483] [2025-03-03 14:35:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:35:22,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:35:22,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:22,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:35:22,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:22,811 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:35:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:22,864 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-03 14:35:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:35:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-03 14:35:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:22,869 INFO L225 Difference]: With dead ends: 32 [2025-03-03 14:35:22,869 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:35:22,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:22,873 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:22,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:35:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 14:35:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:35:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:35:22,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-03 14:35:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:22,896 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:35:22,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:35:22,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:35:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:35:22,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:22,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:22,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:35:22,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:22,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-03-03 14:35:22,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:22,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265014853] [2025-03-03 14:35:22,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:22,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:22,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:35:22,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:35:22,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:22,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:35:22,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:22,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265014853] [2025-03-03 14:35:22,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265014853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:35:22,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:35:22,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:35:22,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641326525] [2025-03-03 14:35:22,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:35:22,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:35:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:22,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:35:22,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:22,966 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:35:23,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:23,012 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-03 14:35:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:35:23,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-03 14:35:23,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:23,014 INFO L225 Difference]: With dead ends: 24 [2025-03-03 14:35:23,014 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:35:23,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:23,016 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:23,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:23,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:35:23,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 14:35:23,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:35:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:35:23,022 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-03 14:35:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:23,022 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:35:23,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:35:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:35:23,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:35:23,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:23,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:23,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:35:23,023 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:23,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:23,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-03-03 14:35:23,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:23,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121276560] [2025-03-03 14:35:23,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:23,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:23,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:35:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:35:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:23,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:35:23,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121276560] [2025-03-03 14:35:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121276560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649512320] [2025-03-03 14:35:23,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:23,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:23,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:23,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:23,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:35:23,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:35:23,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:35:23,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:23,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:35:23,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:35:23,234 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:35:23,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649512320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:23,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:23,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-03 14:35:23,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221783154] [2025-03-03 14:35:23,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:23,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:35:23,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:23,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:35:23,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:35:23,394 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:35:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:23,458 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-03 14:35:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:35:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2025-03-03 14:35:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:23,459 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:35:23,459 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:35:23,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:35:23,460 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:23,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 60 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:23,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:35:23,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 14:35:23,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:35:23,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-03 14:35:23,464 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-03 14:35:23,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:23,464 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-03 14:35:23,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 14:35:23,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-03 14:35:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:35:23,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:23,466 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:23,472 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-03 14:35:23,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:23,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:23,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:23,667 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-03-03 14:35:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933449937] [2025-03-03 14:35:23,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:23,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:35:23,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:35:23,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:23,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:35:23,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933449937] [2025-03-03 14:35:23,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933449937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:23,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150809029] [2025-03-03 14:35:23,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:23,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:23,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:23,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:35:23,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:35:23,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:35:23,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:23,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:23,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:35:23,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:35:23,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:35:23,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150809029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:23,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:23,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-03 14:35:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346507047] [2025-03-03 14:35:23,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:23,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:35:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:23,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:35:23,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:35:23,932 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:35:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:23,983 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-03 14:35:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:35:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2025-03-03 14:35:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:23,984 INFO L225 Difference]: With dead ends: 29 [2025-03-03 14:35:23,985 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 14:35:23,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:35:23,986 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:23,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 14:35:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 14:35:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:35:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-03 14:35:23,992 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-03 14:35:23,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:23,992 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-03 14:35:23,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 14:35:23,992 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-03 14:35:23,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:35:23,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:23,993 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:24,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:24,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 14:35:24,198 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:24,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-03-03 14:35:24,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:24,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433150843] [2025-03-03 14:35:24,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:24,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:35:24,210 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:35:24,210 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:24,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:35:24,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433150843] [2025-03-03 14:35:24,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433150843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:24,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614186607] [2025-03-03 14:35:24,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:24,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:24,341 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:24,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:35:24,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:35:24,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:35:24,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:24,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:24,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:35:24,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:24,470 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:35:24,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:35:24,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614186607] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:24,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:24,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2025-03-03 14:35:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298895430] [2025-03-03 14:35:24,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:24,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:35:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:24,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:35:24,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:35:24,787 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 18 states, 16 states have (on average 2.8125) internal successors, (45), 18 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:24,965 INFO L93 Difference]: Finished difference Result 60 states and 93 transitions. [2025-03-03 14:35:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:35:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 18 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-03-03 14:35:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:24,967 INFO L225 Difference]: With dead ends: 60 [2025-03-03 14:35:24,967 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 14:35:24,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:35:24,969 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:24,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 95 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 14:35:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 14:35:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-03 14:35:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-03 14:35:24,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2025-03-03 14:35:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:24,976 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-03 14:35:24,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.8125) internal successors, (45), 18 states have internal predecessors, (45), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-03 14:35:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:35:24,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:24,980 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:24,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:25,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:25,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:25,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 3 times [2025-03-03 14:35:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:25,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872445935] [2025-03-03 14:35:25,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:25,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 12 equivalence classes. [2025-03-03 14:35:25,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 59 of 93 statements. [2025-03-03 14:35:25,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 14:35:25,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-03 14:35:25,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872445935] [2025-03-03 14:35:25,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872445935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:25,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81975959] [2025-03-03 14:35:25,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:25,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:25,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:25,294 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:25,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:35:25,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 93 statements into 12 equivalence classes. [2025-03-03 14:35:25,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 59 of 93 statements. [2025-03-03 14:35:25,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 14:35:25,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:25,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:35:25,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-03 14:35:25,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-03 14:35:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81975959] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:25,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2025-03-03 14:35:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567096035] [2025-03-03 14:35:25,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:25,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:35:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:25,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:35:25,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:35:25,736 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:35:25,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:25,827 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2025-03-03 14:35:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:35:25,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 93 [2025-03-03 14:35:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:25,830 INFO L225 Difference]: With dead ends: 72 [2025-03-03 14:35:25,830 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 14:35:25,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:25,831 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:25,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 84 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 14:35:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 14:35:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.103448275862069) internal successors, (32), 27 states have internal predecessors, (32), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-03 14:35:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-03 14:35:25,835 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 93 [2025-03-03 14:35:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:25,836 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-03 14:35:25,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 4 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:35:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2025-03-03 14:35:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:35:25,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:25,836 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:25,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:26,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:26,037 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:26,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash 152396661, now seen corresponding path program 4 times [2025-03-03 14:35:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725423875] [2025-03-03 14:35:26,038 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:26,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:26,042 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-03 14:35:26,046 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 65 statements. [2025-03-03 14:35:26,046 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:26,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 14:35:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725423875] [2025-03-03 14:35:26,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725423875] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:26,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924829567] [2025-03-03 14:35:26,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:26,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:26,115 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:26,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:35:26,144 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-03 14:35:26,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 54 of 65 statements. [2025-03-03 14:35:26,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:26,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:26,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:35:26,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:26,211 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 14:35:26,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 14:35:26,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924829567] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:26,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:26,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-03 14:35:26,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575565312] [2025-03-03 14:35:26,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:26,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:35:26,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:26,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:35:26,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:35:26,600 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:26,677 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2025-03-03 14:35:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:35:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 65 [2025-03-03 14:35:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:26,678 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:35:26,678 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:35:26,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:26,679 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 58 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:35:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 14:35:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.09375) internal successors, (35), 30 states have internal predecessors, (35), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2025-03-03 14:35:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2025-03-03 14:35:26,683 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 65 [2025-03-03 14:35:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:26,683 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2025-03-03 14:35:26,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:35:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2025-03-03 14:35:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:35:26,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:26,684 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:26,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:35:26,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:26,885 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:26,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:26,885 INFO L85 PathProgramCache]: Analyzing trace with hash -240813463, now seen corresponding path program 5 times [2025-03-03 14:35:26,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:26,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356688777] [2025-03-03 14:35:26,885 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:26,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:26,891 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 133 statements into 13 equivalence classes. [2025-03-03 14:35:26,908 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 99 of 133 statements. [2025-03-03 14:35:26,911 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 14:35:26,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 203 proven. 317 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-03 14:35:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356688777] [2025-03-03 14:35:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356688777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290942426] [2025-03-03 14:35:27,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:27,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:27,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:27,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:35:27,127 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 133 statements into 13 equivalence classes. [2025-03-03 14:35:27,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 99 of 133 statements. [2025-03-03 14:35:27,147 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-03 14:35:27,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:27,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:35:27,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-03 14:35:27,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 189 proven. 354 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-03 14:35:28,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290942426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:28,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 17] total 22 [2025-03-03 14:35:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482351408] [2025-03-03 14:35:28,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:35:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:28,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:35:28,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:35:28,068 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 13 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (23), 11 states have call predecessors, (23), 13 states have call successors, (23) [2025-03-03 14:35:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:28,306 INFO L93 Difference]: Finished difference Result 102 states and 151 transitions. [2025-03-03 14:35:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:35:28,306 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 13 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (23), 11 states have call predecessors, (23), 13 states have call successors, (23) Word has length 133 [2025-03-03 14:35:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:28,307 INFO L225 Difference]: With dead ends: 102 [2025-03-03 14:35:28,308 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 14:35:28,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 254 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:35:28,309 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 74 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:28,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 14:35:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2025-03-03 14:35:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.146341463414634) internal successors, (47), 38 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2025-03-03 14:35:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-03 14:35:28,319 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 133 [2025-03-03 14:35:28,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:28,319 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-03 14:35:28,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 22 states have internal predecessors, (69), 13 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (23), 11 states have call predecessors, (23), 13 states have call successors, (23) [2025-03-03 14:35:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2025-03-03 14:35:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:35:28,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:28,320 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:28,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:28,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:28,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:28,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:28,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1813016480, now seen corresponding path program 6 times [2025-03-03 14:35:28,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:28,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461680682] [2025-03-03 14:35:28,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:28,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:28,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 13 equivalence classes. [2025-03-03 14:35:28,546 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 106 statements. [2025-03-03 14:35:28,546 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 14:35:28,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 45 proven. 223 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-03 14:35:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461680682] [2025-03-03 14:35:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461680682] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12609254] [2025-03-03 14:35:28,685 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:28,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:28,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:28,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:35:28,727 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 106 statements into 13 equivalence classes. [2025-03-03 14:35:28,751 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) and asserted 92 of 106 statements. [2025-03-03 14:35:28,751 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2025-03-03 14:35:28,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:28,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:35:28,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2025-03-03 14:35:28,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:29,448 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 255 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-03 14:35:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12609254] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:29,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2025-03-03 14:35:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798704965] [2025-03-03 14:35:29,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:29,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:35:29,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:35:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:29,449 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-03 14:35:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:29,521 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2025-03-03 14:35:29,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:35:29,522 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 106 [2025-03-03 14:35:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:29,523 INFO L225 Difference]: With dead ends: 64 [2025-03-03 14:35:29,524 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 14:35:29,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 204 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:35:29,525 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:29,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 72 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:29,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 14:35:29,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 14:35:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 40 states have internal predecessors, (49), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (20), 11 states have call predecessors, (20), 9 states have call successors, (20) [2025-03-03 14:35:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2025-03-03 14:35:29,534 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 78 transitions. Word has length 106 [2025-03-03 14:35:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:29,534 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 78 transitions. [2025-03-03 14:35:29,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2025-03-03 14:35:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 78 transitions. [2025-03-03 14:35:29,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-03-03 14:35:29,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:29,539 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:29,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:35:29,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:29,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:29,740 INFO L85 PathProgramCache]: Analyzing trace with hash 779620497, now seen corresponding path program 7 times [2025-03-03 14:35:29,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:29,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867363973] [2025-03-03 14:35:29,740 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:35:29,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:29,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:35:29,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:35:29,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2025-03-03 14:35:29,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:29,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867363973] [2025-03-03 14:35:29,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867363973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:29,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462162982] [2025-03-03 14:35:29,928 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:35:29,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:29,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:29,931 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:29,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:35:29,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-03 14:35:30,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-03 14:35:30,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:30,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:30,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:35:30,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2025-03-03 14:35:30,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 693 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2025-03-03 14:35:31,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462162982] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:31,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:31,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 16 [2025-03-03 14:35:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406975489] [2025-03-03 14:35:31,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:31,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 14:35:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:31,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 14:35:31,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:35:31,012 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-03 14:35:31,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:31,135 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2025-03-03 14:35:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:35:31,135 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) Word has length 201 [2025-03-03 14:35:31,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:31,136 INFO L225 Difference]: With dead ends: 69 [2025-03-03 14:35:31,136 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 14:35:31,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 394 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:35:31,137 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 81 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:31,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 84 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 14:35:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-03 14:35:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 43 states have internal predecessors, (52), 10 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (28), 13 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-03 14:35:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-03-03 14:35:31,143 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 201 [2025-03-03 14:35:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:31,144 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-03-03 14:35:31,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 13 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 13 states have call successors, (18) [2025-03-03 14:35:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-03-03 14:35:31,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 14:35:31,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:31,147 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:31,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:35:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:35:31,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -713979081, now seen corresponding path program 8 times [2025-03-03 14:35:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:31,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490543530] [2025-03-03 14:35:31,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:31,360 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 351 statements into 2 equivalence classes. [2025-03-03 14:35:31,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 14:35:31,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:31,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 579 proven. 751 refuted. 0 times theorem prover too weak. 5790 trivial. 0 not checked. [2025-03-03 14:35:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490543530] [2025-03-03 14:35:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490543530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263566291] [2025-03-03 14:35:31,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:31,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:31,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:31,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:31,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:35:31,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 351 statements into 2 equivalence classes. [2025-03-03 14:35:31,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 14:35:31,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:31,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:31,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:35:31,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 705 proven. 1006 refuted. 0 times theorem prover too weak. 5409 trivial. 0 not checked. [2025-03-03 14:35:31,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 707 proven. 1055 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2025-03-03 14:35:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263566291] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:33,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 21 [2025-03-03 14:35:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227468095] [2025-03-03 14:35:33,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:33,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:35:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:33,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:35:33,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:35:33,471 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 15 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-03 14:35:33,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:33,612 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2025-03-03 14:35:33,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:35:33,613 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 15 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) Word has length 351 [2025-03-03 14:35:33,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:33,614 INFO L225 Difference]: With dead ends: 97 [2025-03-03 14:35:33,614 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 14:35:33,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 688 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:35:33,615 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:33,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:33,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 14:35:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-03-03 14:35:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 44 states have internal predecessors, (50), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (24), 14 states have call predecessors, (24), 10 states have call successors, (24) [2025-03-03 14:35:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2025-03-03 14:35:33,620 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 351 [2025-03-03 14:35:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:33,621 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2025-03-03 14:35:33,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.1) internal successors, (62), 21 states have internal predecessors, (62), 15 states have call successors, (19), 1 states have call predecessors, (19), 8 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) [2025-03-03 14:35:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2025-03-03 14:35:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 14:35:33,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:33,622 INFO L218 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:33,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:35:33,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:33,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:33,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:33,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1946424999, now seen corresponding path program 9 times [2025-03-03 14:35:33,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:33,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441389110] [2025-03-03 14:35:33,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:33,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:33,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 283 statements into 41 equivalence classes. [2025-03-03 14:35:33,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:35:33,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2025-03-03 14:35:33,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 6 proven. 1501 refuted. 0 times theorem prover too weak. 3061 trivial. 0 not checked. [2025-03-03 14:35:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441389110] [2025-03-03 14:35:35,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441389110] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561540753] [2025-03-03 14:35:35,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:35,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:35,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:35,657 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:35,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:35:35,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 283 statements into 41 equivalence classes. [2025-03-03 14:35:35,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:35:35,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2025-03-03 14:35:35,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:35,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 167 conjuncts are in the unsatisfiable core [2025-03-03 14:35:35,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2025-03-03 14:35:36,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2025-03-03 14:35:36,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561540753] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:36,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:36,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 28 [2025-03-03 14:35:36,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098278849] [2025-03-03 14:35:36,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:36,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:35:36,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:36,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:35:36,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:35:36,956 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (18), 18 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-03 14:35:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:37,177 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2025-03-03 14:35:37,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 14:35:37,178 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (18), 18 states have call predecessors, (18), 6 states have call successors, (18) Word has length 283 [2025-03-03 14:35:37,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:37,179 INFO L225 Difference]: With dead ends: 92 [2025-03-03 14:35:37,181 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 14:35:37,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:35:37,182 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:37,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 765 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:35:37,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 14:35:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2025-03-03 14:35:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 51 states have internal predecessors, (57), 13 states have call successors, (13), 7 states have call predecessors, (13), 11 states have return successors, (39), 19 states have call predecessors, (39), 13 states have call successors, (39) [2025-03-03 14:35:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2025-03-03 14:35:37,198 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 283 [2025-03-03 14:35:37,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:37,198 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2025-03-03 14:35:37,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (18), 18 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-03 14:35:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2025-03-03 14:35:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 14:35:37,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:37,203 INFO L218 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:37,210 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-03 14:35:37,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:35:37,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:37,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:37,408 INFO L85 PathProgramCache]: Analyzing trace with hash 531590169, now seen corresponding path program 10 times [2025-03-03 14:35:37,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:37,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365263619] [2025-03-03 14:35:37,408 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:37,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 351 statements into 2 equivalence classes. [2025-03-03 14:35:37,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 298 of 351 statements. [2025-03-03 14:35:37,436 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:37,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 944 proven. 386 refuted. 0 times theorem prover too weak. 5790 trivial. 0 not checked. [2025-03-03 14:35:37,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365263619] [2025-03-03 14:35:37,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365263619] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:37,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523334894] [2025-03-03 14:35:37,672 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:37,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:37,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:37,677 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:35:37,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:35:37,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 351 statements into 2 equivalence classes. [2025-03-03 14:35:37,798 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 298 of 351 statements. [2025-03-03 14:35:37,798 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:35:37,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:37,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:35:37,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:37,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1214 proven. 569 refuted. 0 times theorem prover too weak. 5337 trivial. 0 not checked. [2025-03-03 14:35:37,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1214 proven. 620 refuted. 0 times theorem prover too weak. 5286 trivial. 0 not checked. [2025-03-03 14:35:39,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523334894] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:39,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:39,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17] total 21 [2025-03-03 14:35:39,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287067316] [2025-03-03 14:35:39,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:39,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:35:39,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:39,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:35:39,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:35:39,408 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 21 states have internal predecessors, (64), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (27), 12 states have call predecessors, (27), 16 states have call successors, (27) [2025-03-03 14:35:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:39,505 INFO L93 Difference]: Finished difference Result 92 states and 122 transitions. [2025-03-03 14:35:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:35:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 21 states have internal predecessors, (64), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (27), 12 states have call predecessors, (27), 16 states have call successors, (27) Word has length 351 [2025-03-03 14:35:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:39,507 INFO L225 Difference]: With dead ends: 92 [2025-03-03 14:35:39,507 INFO L226 Difference]: Without dead ends: 85 [2025-03-03 14:35:39,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 688 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=240, Invalid=462, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:35:39,508 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:39,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 114 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-03 14:35:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2025-03-03 14:35:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.08) internal successors, (54), 48 states have internal predecessors, (54), 12 states have call successors, (12), 7 states have call predecessors, (12), 10 states have return successors, (29), 17 states have call predecessors, (29), 12 states have call successors, (29) [2025-03-03 14:35:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 95 transitions. [2025-03-03 14:35:39,514 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 95 transitions. Word has length 351 [2025-03-03 14:35:39,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:39,515 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 95 transitions. [2025-03-03 14:35:39,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 21 states have internal predecessors, (64), 16 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (27), 12 states have call predecessors, (27), 16 states have call successors, (27) [2025-03-03 14:35:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 95 transitions. [2025-03-03 14:35:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-03 14:35:39,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:39,519 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 36, 22, 22, 22, 22, 22, 22, 22, 14, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:39,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:35:39,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:35:39,720 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:39,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:39,720 INFO L85 PathProgramCache]: Analyzing trace with hash -628016120, now seen corresponding path program 11 times [2025-03-03 14:35:39,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:39,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960548945] [2025-03-03 14:35:39,720 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:39,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:39,728 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 310 statements into 38 equivalence classes. [2025-03-03 14:35:39,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 189 of 310 statements. [2025-03-03 14:35:39,753 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-03 14:35:39,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 474 proven. 1000 refuted. 0 times theorem prover too weak. 4040 trivial. 0 not checked. [2025-03-03 14:35:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960548945] [2025-03-03 14:35:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960548945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753261178] [2025-03-03 14:35:39,876 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:39,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:39,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:39,878 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-03 14:35:39,880 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-03 14:35:39,964 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 310 statements into 38 equivalence classes. [2025-03-03 14:35:40,005 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 189 of 310 statements. [2025-03-03 14:35:40,006 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-03 14:35:40,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:40,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:35:40,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 2596 proven. 73 refuted. 0 times theorem prover too weak. 2845 trivial. 0 not checked. [2025-03-03 14:35:40,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5514 backedges. 468 proven. 1041 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2025-03-03 14:35:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753261178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:40,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 13] total 18 [2025-03-03 14:35:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006346551] [2025-03-03 14:35:40,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:40,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:35:40,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:40,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:35:40,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:35:40,975 INFO L87 Difference]: Start difference. First operand 73 states and 95 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (19), 2 states have call predecessors, (19), 8 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-03 14:35:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:41,056 INFO L93 Difference]: Finished difference Result 140 states and 186 transitions. [2025-03-03 14:35:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:35:41,057 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (19), 2 states have call predecessors, (19), 8 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) Word has length 310 [2025-03-03 14:35:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:41,058 INFO L225 Difference]: With dead ends: 140 [2025-03-03 14:35:41,058 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 14:35:41,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 610 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:35:41,059 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:41,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 82 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 14:35:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2025-03-03 14:35:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (21), 15 states have call predecessors, (21), 11 states have call successors, (21) [2025-03-03 14:35:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2025-03-03 14:35:41,065 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 310 [2025-03-03 14:35:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:41,065 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2025-03-03 14:35:41,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 12 states have call successors, (19), 2 states have call predecessors, (19), 8 states have return successors, (23), 10 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-03 14:35:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2025-03-03 14:35:41,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 14:35:41,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:41,067 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 38, 23, 23, 23, 23, 23, 23, 23, 15, 9, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:41,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 14:35:41,267 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-03 14:35:41,267 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:41,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash 875846458, now seen corresponding path program 12 times [2025-03-03 14:35:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222412854] [2025-03-03 14:35:41,268 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:41,274 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 324 statements into 41 equivalence classes. [2025-03-03 14:35:41,301 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 236 of 324 statements. [2025-03-03 14:35:41,301 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-03 14:35:41,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 452 proven. 984 refuted. 0 times theorem prover too weak. 4603 trivial. 0 not checked. [2025-03-03 14:35:41,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222412854] [2025-03-03 14:35:41,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222412854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:41,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139811999] [2025-03-03 14:35:41,510 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:41,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:41,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:41,513 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-03 14:35:41,514 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-03 14:35:41,603 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 324 statements into 41 equivalence classes. [2025-03-03 14:35:41,657 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 236 of 324 statements. [2025-03-03 14:35:41,658 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-03 14:35:41,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:41,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:35:41,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 486 proven. 1072 refuted. 0 times theorem prover too weak. 4481 trivial. 0 not checked. [2025-03-03 14:35:41,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6039 backedges. 492 proven. 1117 refuted. 0 times theorem prover too weak. 4430 trivial. 0 not checked. [2025-03-03 14:35:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139811999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:43,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:43,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 17] total 23 [2025-03-03 14:35:43,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107750168] [2025-03-03 14:35:43,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:43,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:35:43,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:43,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:35:43,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:35:43,128 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 23 states have internal predecessors, (66), 16 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (25), 12 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-03 14:35:43,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:43,253 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2025-03-03 14:35:43,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:35:43,254 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 23 states have internal predecessors, (66), 16 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (25), 12 states have call predecessors, (25), 16 states have call successors, (25) Word has length 324 [2025-03-03 14:35:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:43,255 INFO L225 Difference]: With dead ends: 81 [2025-03-03 14:35:43,255 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:35:43,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 635 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=272, Invalid=540, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:35:43,256 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:43,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 112 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:35:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:35:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:35:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:35:43,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 324 [2025-03-03 14:35:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:43,257 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:35:43,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.142857142857143) internal successors, (66), 23 states have internal predecessors, (66), 16 states have call successors, (20), 1 states have call predecessors, (20), 9 states have return successors, (25), 12 states have call predecessors, (25), 16 states have call successors, (25) [2025-03-03 14:35:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:35:43,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:35:43,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:35:43,267 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-03 14:35:43,460 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-03 14:35:43,462 INFO L422 BasicCegarLoop]: Path program histogram: [12, 1, 1, 1] [2025-03-03 14:35:43,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:35:44,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:35:44,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:35:44 BoogieIcfgContainer [2025-03-03 14:35:44,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:35:44,522 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:35:44,522 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:35:44,522 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:35:44,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:22" (3/4) ... [2025-03-03 14:35:44,524 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:35:44,528 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibo [2025-03-03 14:35:44,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 14:35:44,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 14:35:44,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:35:44,531 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:35:44,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:35:44,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:35:44,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:35:44,584 INFO L158 Benchmark]: Toolchain (without parser) took 22389.56ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 104.6MB in the beginning and 175.7MB in the end (delta: -71.1MB). Peak memory consumption was 257.3MB. Max. memory is 16.1GB. [2025-03-03 14:35:44,585 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:35:44,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 145.97ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 94.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:35:44,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.75ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:35:44,585 INFO L158 Benchmark]: Boogie Preprocessor took 19.38ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.5MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:35:44,585 INFO L158 Benchmark]: IcfgBuilder took 188.09ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 82.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:35:44,586 INFO L158 Benchmark]: TraceAbstraction took 21951.50ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 82.0MB in the beginning and 180.1MB in the end (delta: -98.0MB). Peak memory consumption was 252.0MB. Max. memory is 16.1GB. [2025-03-03 14:35:44,586 INFO L158 Benchmark]: Witness Printer took 61.79ms. Allocated memory is still 469.8MB. Free memory was 180.1MB in the beginning and 175.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:35:44,586 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.26ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 145.97ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 94.7MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.75ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.38ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.5MB in the end (delta: 1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 188.09ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 82.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 21951.50ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 82.0MB in the beginning and 180.1MB in the end (delta: -98.0MB). Peak memory consumption was 252.0MB. Max. memory is 16.1GB. * Witness Printer took 61.79ms. Allocated memory is still 469.8MB. Free memory was 180.1MB in the beginning and 175.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 29]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 15, TraceHistogramMax: 51, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 1908 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 349 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2018 IncrementalHoareTripleChecker+Invalid, 2367 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 349 mSolverCounterUnsat, 311 mSDtfsCounter, 2018 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4893 GetRequests, 4555 SyntacticMatches, 66 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=12, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 38 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 4623 NumberOfCodeBlocks, 3913 NumberOfCodeBlocksAsserted, 254 NumberOfCheckSat, 6883 ConstructedInterpolants, 0 QuantifiedInterpolants, 11230 SizeOfPredicates, 49 NumberOfNonLiveVariables, 4457 ConjunctsInSsa, 307 ConjunctsInUnsatCore, 41 InterpolantComputations, 2 PerfectInterpolantSequences, 86068/104379 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 14:35:44,602 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 Result: TRUE