./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_25-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_25-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 7ad88fb205242ec446a08384ae9c868bf7c17f001b4ed74a5de911f546d9b565 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:33:28,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:33:28,289 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:33:28,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:33:28,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:33:28,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:33:28,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:33:28,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:33:28,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:33:28,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:33:28,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:33:28,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:33:28,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:33:28,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:33:28,312 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:33:28,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:33:28,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:33:28,313 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:33:28,314 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:33:28,314 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:33:28,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:33:28,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:33:28,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:33:28,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:33:28,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:33:28,315 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:33:28,315 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 -> 7ad88fb205242ec446a08384ae9c868bf7c17f001b4ed74a5de911f546d9b565 [2025-03-03 14:33:28,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:33:28,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:33:28,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:33:28,537 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:33:28,538 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:33:28,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_25-1.c [2025-03-03 14:33:29,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3405fe1/3d6b6cf3c63f48ae9b85f802e1ac21b1/FLAG7f5582402 [2025-03-03 14:33:29,827 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:33:29,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_25-1.c [2025-03-03 14:33:29,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3405fe1/3d6b6cf3c63f48ae9b85f802e1ac21b1/FLAG7f5582402 [2025-03-03 14:33:30,197 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3405fe1/3d6b6cf3c63f48ae9b85f802e1ac21b1 [2025-03-03 14:33:30,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:33:30,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:33:30,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:33:30,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:33:30,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:33:30,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79496603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30, skipping insertion in model container [2025-03-03 14:33:30,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:33:30,315 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_25-1.c[746,759] [2025-03-03 14:33:30,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:33:30,323 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:33:30,333 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_25-1.c[746,759] [2025-03-03 14:33:30,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:33:30,342 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:33:30,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30 WrapperNode [2025-03-03 14:33:30,344 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:33:30,345 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:33:30,345 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:33:30,345 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:33:30,349 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:33:30" (1/1) ... [2025-03-03 14:33:30,353 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:33:30" (1/1) ... [2025-03-03 14:33:30,363 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2025-03-03 14:33:30,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:33:30,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:33:30,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:33:30,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:33:30,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,382 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:33:30,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,382 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:33:30,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:33:30,388 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:33:30,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:33:30,389 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (1/1) ... [2025-03-03 14:33:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:33:30,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:30,414 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:33:30,417 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:33:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:33:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:33:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:33:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:33:30,434 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2025-03-03 14:33:30,434 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2025-03-03 14:33:30,471 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:33:30,473 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:33:30,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L13: havoc #t~ret4;havoc #t~ret5; [2025-03-03 14:33:30,544 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:33:30,544 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:33:30,550 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:33:30,550 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:33:30,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:33:30 BoogieIcfgContainer [2025-03-03 14:33:30,551 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:33:30,552 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:33:30,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:33:30,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:33:30,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:33:30" (1/3) ... [2025-03-03 14:33:30,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41950edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:33:30, skipping insertion in model container [2025-03-03 14:33:30,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:33:30" (2/3) ... [2025-03-03 14:33:30,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41950edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:33:30, skipping insertion in model container [2025-03-03 14:33:30,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:33:30" (3/3) ... [2025-03-03 14:33:30,556 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_25-1.c [2025-03-03 14:33:30,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:33:30,566 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_25-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:33:30,601 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:33:30,612 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;@6b084c54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:33:30,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:33:30,615 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:33:30,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:33:30,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:30,621 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:30,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash 402921910, now seen corresponding path program 1 times [2025-03-03 14:33:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644082602] [2025-03-03 14:33:30,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:33:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:30,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:33:30,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:33:30,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:30,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:30,771 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:33:30,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:30,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644082602] [2025-03-03 14:33:30,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644082602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:33:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:33:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:33:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852320070] [2025-03-03 14:33:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:33:30,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:33:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:30,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:33:30,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:33:30,788 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:33:30,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:30,823 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2025-03-03 14:33:30,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:33:30,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-03 14:33:30,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:30,828 INFO L225 Difference]: With dead ends: 30 [2025-03-03 14:33:30,828 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 14:33:30,830 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:33:30,831 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:30,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:33:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 14:33:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 14:33:30,849 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:33:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:33:30,852 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-03 14:33:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:30,852 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:33:30,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:33:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:33:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:33:30,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:30,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:30,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:33:30,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2143228819, now seen corresponding path program 1 times [2025-03-03 14:33:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:30,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393557393] [2025-03-03 14:33:30,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:33:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:30,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:33:30,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:33:30,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:30,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:30,917 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:33:30,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:30,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393557393] [2025-03-03 14:33:30,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393557393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:33:30,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:33:30,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:33:30,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081865148] [2025-03-03 14:33:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:33:30,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:33:30,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:30,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:33:30,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:33:30,919 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:33:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:30,932 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-03 14:33:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:33:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-03 14:33:30,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:30,933 INFO L225 Difference]: With dead ends: 24 [2025-03-03 14:33:30,933 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:33:30,934 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:33:30,935 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:30,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:33:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:33:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 14:33:30,937 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:33:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 14:33:30,942 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-03 14:33:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:30,942 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 14:33:30,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 14:33:30,942 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 14:33:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:33:30,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:30,943 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:33:30,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:33:30,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:30,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1857137997, now seen corresponding path program 1 times [2025-03-03 14:33:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626672102] [2025-03-03 14:33:30,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:33:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:30,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:33:30,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:33:30,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:30,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:31,048 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:33:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626672102] [2025-03-03 14:33:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626672102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237903660] [2025-03-03 14:33:31,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:33:31,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:31,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:31,051 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:33:31,054 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:33:31,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:33:31,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:33:31,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:31,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:31,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:33:31,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:31,174 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:33:31,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:31,340 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:33:31,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237903660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:31,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:31,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2025-03-03 14:33:31,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864722878] [2025-03-03 14:33:31,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:31,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:33:31,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:31,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:33:31,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:33:31,344 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:33:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:31,421 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-03 14:33:31,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:33:31,422 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:33:31,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:31,422 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:33:31,422 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 14:33:31,423 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:33:31,424 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:31,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:31,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 14:33:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 14:33:31,430 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:33:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-03 14:33:31,432 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-03 14:33:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:31,432 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-03 14:33:31,432 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:33:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-03 14:33:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:33:31,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:31,433 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:33:31,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:31,633 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:33:31,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:31,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:31,634 INFO L85 PathProgramCache]: Analyzing trace with hash -318077138, now seen corresponding path program 1 times [2025-03-03 14:33:31,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:31,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966402710] [2025-03-03 14:33:31,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:33:31,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:31,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:33:31,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:33:31,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:31,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:31,710 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:33:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966402710] [2025-03-03 14:33:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966402710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809259873] [2025-03-03 14:33:31,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:33:31,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:31,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:31,713 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:33:31,713 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:33:31,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:33:31,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:33:31,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:31,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:31,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:33:31,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:31,769 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:33:31,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:31,898 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:33:31,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809259873] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:31,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:31,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-03 14:33:31,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033488291] [2025-03-03 14:33:31,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:31,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:33:31,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:31,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:33:31,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:33:31,899 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:33:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:31,953 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-03 14:33:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:33:31,953 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:33:31,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:31,954 INFO L225 Difference]: With dead ends: 29 [2025-03-03 14:33:31,954 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 14:33:31,954 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:33:31,955 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:31,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:33:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 14:33:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 14:33:31,962 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:33:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-03 14:33:31,962 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-03 14:33:31,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:31,963 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-03 14:33:31,963 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:33:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-03 14:33:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:33:31,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:31,963 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:33:31,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:33:32,167 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:33:32,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:32,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -896080901, now seen corresponding path program 2 times [2025-03-03 14:33:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:32,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94944600] [2025-03-03 14:33:32,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:32,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:33:32,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:33:32,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:32,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:33:32,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:32,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94944600] [2025-03-03 14:33:32,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94944600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:32,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341144675] [2025-03-03 14:33:32,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:32,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:32,350 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:33:32,353 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:33:32,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-03 14:33:32,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:33:32,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:32,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:32,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:33:32,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:32,475 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:33:32,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:32,763 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:33:32,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341144675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:32,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:32,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2025-03-03 14:33:32,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210997274] [2025-03-03 14:33:32,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:32,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:33:32,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:32,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:33:32,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:33:32,765 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:33:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:33,021 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2025-03-03 14:33:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:33:33,021 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2025-03-03 14:33:33,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:33,023 INFO L225 Difference]: With dead ends: 46 [2025-03-03 14:33:33,024 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 14:33:33,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:33:33,026 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:33,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:33,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 14:33:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-03 14:33:33,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2025-03-03 14:33:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2025-03-03 14:33:33,038 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2025-03-03 14:33:33,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:33,038 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2025-03-03 14:33:33,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2025-03-03 14:33:33,038 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2025-03-03 14:33:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:33:33,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:33,041 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 9, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:33,046 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:33:33,245 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:33:33,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:33,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:33,245 INFO L85 PathProgramCache]: Analyzing trace with hash 525573421, now seen corresponding path program 3 times [2025-03-03 14:33:33,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:33,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655816950] [2025-03-03 14:33:33,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:33,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-03 14:33:33,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-03 14:33:33,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:33:33,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 167 proven. 29 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 14:33:33,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655816950] [2025-03-03 14:33:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655816950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:33,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085604828] [2025-03-03 14:33:33,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:33,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:33,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:33,347 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:33:33,349 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:33:33,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 12 equivalence classes. [2025-03-03 14:33:33,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 54 of 91 statements. [2025-03-03 14:33:33,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 14:33:33,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:33,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:33:33,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 215 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-03 14:33:33,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:33,777 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-03 14:33:33,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085604828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:33,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-03 14:33:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316369832] [2025-03-03 14:33:33,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:33,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:33:33,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:33,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:33:33,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:33:33,779 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:33:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:33,881 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2025-03-03 14:33:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:33:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 91 [2025-03-03 14:33:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:33,883 INFO L225 Difference]: With dead ends: 62 [2025-03-03 14:33:33,883 INFO L226 Difference]: Without dead ends: 35 [2025-03-03 14:33:33,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:33:33,885 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:33,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-03 14:33:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-03 14:33:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-03 14:33:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2025-03-03 14:33:33,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 91 [2025-03-03 14:33:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:33,892 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2025-03-03 14:33:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:33:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2025-03-03 14:33:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:33:33,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:33,897 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:33:33,903 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:33:34,098 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:33:34,098 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:34,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:34,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1467785241, now seen corresponding path program 4 times [2025-03-03 14:33:34,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:34,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872559925] [2025-03-03 14:33:34,099 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:34,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:34,104 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 14:33:34,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 93 statements. [2025-03-03 14:33:34,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:34,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-03 14:33:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872559925] [2025-03-03 14:33:34,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872559925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:34,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840072731] [2025-03-03 14:33:34,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:34,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:34,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:34,269 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:33:34,272 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:33:34,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 93 statements into 2 equivalence classes. [2025-03-03 14:33:34,315 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 77 of 93 statements. [2025-03-03 14:33:34,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:34,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:34,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:33:34,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 170 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-03 14:33:34,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 106 proven. 182 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2025-03-03 14:33:35,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840072731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:35,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:35,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 15] total 20 [2025-03-03 14:33:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016583603] [2025-03-03 14:33:35,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:33:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:35,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:33:35,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:33:35,011 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2025-03-03 14:33:35,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:35,238 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2025-03-03 14:33:35,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:33:35,239 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) Word has length 93 [2025-03-03 14:33:35,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:35,240 INFO L225 Difference]: With dead ends: 75 [2025-03-03 14:33:35,240 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:33:35,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:33:35,241 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:35,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:35,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:33:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2025-03-03 14:33:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-03 14:33:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-03 14:33:35,246 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 93 [2025-03-03 14:33:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:35,247 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-03 14:33:35,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.1) internal successors, (62), 20 states have internal predecessors, (62), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (21), 9 states have call predecessors, (21), 14 states have call successors, (21) [2025-03-03 14:33:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-03 14:33:35,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:33:35,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:35,247 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:33:35,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:35,453 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:33:35,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:35,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 152396661, now seen corresponding path program 5 times [2025-03-03 14:33:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:35,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175253901] [2025-03-03 14:33:35,454 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:35,457 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 8 equivalence classes. [2025-03-03 14:33:35,464 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:33:35,464 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 14:33:35,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 39 proven. 57 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-03 14:33:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175253901] [2025-03-03 14:33:35,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175253901] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086191624] [2025-03-03 14:33:35,529 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:35,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:35,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:35,531 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:33:35,533 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:33:35,561 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 8 equivalence classes. [2025-03-03 14:33:35,576 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:33:35,576 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-03 14:33:35,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:35,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:33:35,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-03-03 14:33:35,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 36 proven. 62 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 14:33:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086191624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:35,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 12 [2025-03-03 14:33:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547460396] [2025-03-03 14:33:35,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:35,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:33:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:35,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:33:35,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:33:35,842 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-03 14:33:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:35,915 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2025-03-03 14:33:35,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:33:35,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Word has length 65 [2025-03-03 14:33:35,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:35,916 INFO L225 Difference]: With dead ends: 51 [2025-03-03 14:33:35,916 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 14:33:35,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:33:35,917 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:35,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 69 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 14:33:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 14:33:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2025-03-03 14:33:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2025-03-03 14:33:35,931 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 65 [2025-03-03 14:33:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:35,931 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2025-03-03 14:33:35,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 12 states have internal predecessors, (39), 8 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-03 14:33:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2025-03-03 14:33:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:33:35,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:35,932 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:35,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:33:36,133 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:33:36,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:36,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1346149011, now seen corresponding path program 6 times [2025-03-03 14:33:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:36,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926888833] [2025-03-03 14:33:36,133 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:36,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:36,138 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 21 equivalence classes. [2025-03-03 14:33:36,153 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 108 of 147 statements. [2025-03-03 14:33:36,154 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-03 14:33:36,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 111 proven. 250 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2025-03-03 14:33:36,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926888833] [2025-03-03 14:33:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926888833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:36,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444703386] [2025-03-03 14:33:36,261 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:36,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:36,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:36,266 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:33:36,277 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:33:36,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 147 statements into 21 equivalence classes. [2025-03-03 14:33:36,355 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) and asserted 108 of 147 statements. [2025-03-03 14:33:36,355 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2025-03-03 14:33:36,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:36,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:33:36,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 111 proven. 250 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2025-03-03 14:33:36,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 113 proven. 263 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-03 14:33:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444703386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:36,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:36,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2025-03-03 14:33:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132789490] [2025-03-03 14:33:36,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:36,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 14:33:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:36,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 14:33:36,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:33:36,908 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 13 states have internal predecessors, (41), 9 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:33:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:36,973 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2025-03-03 14:33:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:33:36,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 13 states have internal predecessors, (41), 9 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) Word has length 147 [2025-03-03 14:33:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:36,975 INFO L225 Difference]: With dead ends: 58 [2025-03-03 14:33:36,975 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 14:33:36,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 288 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:33:36,976 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:36,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 75 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:33:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 14:33:36,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-03 14:33:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2025-03-03 14:33:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2025-03-03 14:33:36,981 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 147 [2025-03-03 14:33:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2025-03-03 14:33:36,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.727272727272727) internal successors, (41), 13 states have internal predecessors, (41), 9 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14) [2025-03-03 14:33:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2025-03-03 14:33:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 14:33:36,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:36,983 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 37, 22, 22, 22, 22, 22, 22, 22, 15, 8, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:36,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:37,183 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:33:37,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:37,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash 636404269, now seen corresponding path program 7 times [2025-03-03 14:33:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452257625] [2025-03-03 14:33:37,184 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:37,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 14:33:37,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 14:33:37,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:37,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 534 proven. 907 refuted. 0 times theorem prover too weak. 4109 trivial. 0 not checked. [2025-03-03 14:33:37,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452257625] [2025-03-03 14:33:37,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452257625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:37,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609701182] [2025-03-03 14:33:37,622 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:37,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:37,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:37,626 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:33:37,627 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:33:37,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-03 14:33:37,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 14:33:37,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:37,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:37,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:33:37,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 164 proven. 1124 refuted. 0 times theorem prover too weak. 4262 trivial. 0 not checked. [2025-03-03 14:33:37,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 164 proven. 1164 refuted. 0 times theorem prover too weak. 4222 trivial. 0 not checked. [2025-03-03 14:33:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609701182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:39,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:39,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 15] total 26 [2025-03-03 14:33:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195393999] [2025-03-03 14:33:39,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:39,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:33:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:39,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:33:39,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:33:39,057 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 26 states, 24 states have (on average 3.125) internal successors, (75), 26 states have internal predecessors, (75), 20 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (32), 14 states have call predecessors, (32), 20 states have call successors, (32) [2025-03-03 14:33:39,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:39,383 INFO L93 Difference]: Finished difference Result 130 states and 243 transitions. [2025-03-03 14:33:39,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:33:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 26 states have internal predecessors, (75), 20 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (32), 14 states have call predecessors, (32), 20 states have call successors, (32) Word has length 311 [2025-03-03 14:33:39,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:39,384 INFO L225 Difference]: With dead ends: 130 [2025-03-03 14:33:39,384 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 14:33:39,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 654 GetRequests, 607 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=432, Invalid=1374, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:33:39,385 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 160 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:39,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 176 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:33:39,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 14:33:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2025-03-03 14:33:39,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 53 states have internal predecessors, (55), 14 states have call successors, (14), 10 states have call predecessors, (14), 8 states have return successors, (33), 13 states have call predecessors, (33), 14 states have call successors, (33) [2025-03-03 14:33:39,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2025-03-03 14:33:39,399 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 311 [2025-03-03 14:33:39,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:39,401 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2025-03-03 14:33:39,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.125) internal successors, (75), 26 states have internal predecessors, (75), 20 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (32), 14 states have call predecessors, (32), 20 states have call successors, (32) [2025-03-03 14:33:39,401 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2025-03-03 14:33:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 14:33:39,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:39,404 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:33:39,410 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:33:39,604 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:33:39,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:39,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1946424999, now seen corresponding path program 8 times [2025-03-03 14:33:39,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:39,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965292077] [2025-03-03 14:33:39,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:39,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:39,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-03-03 14:33:39,630 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:33:39,630 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:39,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2025-03-03 14:33:39,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965292077] [2025-03-03 14:33:39,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965292077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:39,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754465060] [2025-03-03 14:33:39,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:33:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:39,925 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:33:39,926 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:33:39,985 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 283 statements into 2 equivalence classes. [2025-03-03 14:33:40,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 14:33:40,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:33:40,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:40,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:33:40,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2025-03-03 14:33:40,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1187 refuted. 0 times theorem prover too weak. 3192 trivial. 0 not checked. [2025-03-03 14:33:41,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754465060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:41,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:41,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2025-03-03 14:33:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589967332] [2025-03-03 14:33:41,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:41,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 14:33:41,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:41,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 14:33:41,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:33:41,507 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-03 14:33:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:41,636 INFO L93 Difference]: Finished difference Result 86 states and 120 transitions. [2025-03-03 14:33:41,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:33:41,637 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 283 [2025-03-03 14:33:41,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:41,638 INFO L225 Difference]: With dead ends: 86 [2025-03-03 14:33:41,638 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 14:33:41,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 557 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:33:41,639 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 108 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:41,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 99 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 14:33:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 14:33:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 56 states have internal predecessors, (58), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (42), 15 states have call predecessors, (42), 15 states have call successors, (42) [2025-03-03 14:33:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2025-03-03 14:33:41,649 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 283 [2025-03-03 14:33:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:41,651 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2025-03-03 14:33:41,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2025-03-03 14:33:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2025-03-03 14:33:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-03 14:33:41,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:41,657 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:41,663 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:33:41,861 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:33:41,861 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:41,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1691816878, now seen corresponding path program 9 times [2025-03-03 14:33:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881125548] [2025-03-03 14:33:41,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:41,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 596 statements into 78 equivalence classes. [2025-03-03 14:33:41,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 273 of 596 statements. [2025-03-03 14:33:41,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-03-03 14:33:41,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2834 proven. 256 refuted. 0 times theorem prover too weak. 17901 trivial. 0 not checked. [2025-03-03 14:33:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881125548] [2025-03-03 14:33:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881125548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167113270] [2025-03-03 14:33:42,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:33:42,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:42,187 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:33:42,201 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:33:42,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 596 statements into 78 equivalence classes. [2025-03-03 14:33:42,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) and asserted 273 of 596 statements. [2025-03-03 14:33:42,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2025-03-03 14:33:42,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:42,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:33:42,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3146 proven. 296 refuted. 0 times theorem prover too weak. 17549 trivial. 0 not checked. [2025-03-03 14:33:42,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3148 proven. 315 refuted. 0 times theorem prover too weak. 17528 trivial. 0 not checked. [2025-03-03 14:33:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167113270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:44,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 17] total 24 [2025-03-03 14:33:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671628520] [2025-03-03 14:33:44,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:44,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:33:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:44,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:33:44,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:33:44,119 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-03 14:33:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:44,311 INFO L93 Difference]: Finished difference Result 177 states and 268 transitions. [2025-03-03 14:33:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 14:33:44,311 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) Word has length 596 [2025-03-03 14:33:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:44,315 INFO L225 Difference]: With dead ends: 177 [2025-03-03 14:33:44,315 INFO L226 Difference]: Without dead ends: 97 [2025-03-03 14:33:44,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1219 GetRequests, 1177 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:33:44,317 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:44,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 131 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-03 14:33:44,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2025-03-03 14:33:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 59 states have internal predecessors, (61), 16 states have call successors, (16), 11 states have call predecessors, (16), 9 states have return successors, (41), 15 states have call predecessors, (41), 16 states have call successors, (41) [2025-03-03 14:33:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 118 transitions. [2025-03-03 14:33:44,329 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 118 transitions. Word has length 596 [2025-03-03 14:33:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:44,332 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 118 transitions. [2025-03-03 14:33:44,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 12 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (26), 14 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-03 14:33:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 118 transitions. [2025-03-03 14:33:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-03 14:33:44,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:44,337 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:44,344 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:33:44,537 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:33:44,538 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:44,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash 281639384, now seen corresponding path program 10 times [2025-03-03 14:33:44,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:44,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551071975] [2025-03-03 14:33:44,538 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:44,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:44,563 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 528 statements into 2 equivalence classes. [2025-03-03 14:33:44,596 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 448 of 528 statements. [2025-03-03 14:33:44,596 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:44,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:44,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1087 proven. 3186 refuted. 0 times theorem prover too weak. 12134 trivial. 0 not checked. [2025-03-03 14:33:44,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551071975] [2025-03-03 14:33:44,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551071975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:44,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911177668] [2025-03-03 14:33:44,977 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:33:44,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:44,981 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:33:44,983 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:33:45,074 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 528 statements into 2 equivalence classes. [2025-03-03 14:33:45,153 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 448 of 528 statements. [2025-03-03 14:33:45,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:33:45,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:45,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:33:45,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 8332 proven. 1855 refuted. 0 times theorem prover too weak. 6220 trivial. 0 not checked. [2025-03-03 14:33:45,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1254 proven. 3660 refuted. 0 times theorem prover too weak. 11493 trivial. 0 not checked. [2025-03-03 14:33:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911177668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:48,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 27] total 32 [2025-03-03 14:33:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485836174] [2025-03-03 14:33:48,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:48,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:33:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:48,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:33:48,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=823, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:33:48,127 INFO L87 Difference]: Start difference. First operand 86 states and 118 transitions. Second operand has 32 states, 32 states have (on average 3.21875) internal successors, (103), 32 states have internal predecessors, (103), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-03 14:33:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:48,536 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2025-03-03 14:33:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 14:33:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.21875) internal successors, (103), 32 states have internal predecessors, (103), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) Word has length 528 [2025-03-03 14:33:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:48,538 INFO L225 Difference]: With dead ends: 187 [2025-03-03 14:33:48,538 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 14:33:48,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1105 GetRequests, 1036 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=824, Invalid=2482, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 14:33:48,540 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 176 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:48,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 189 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:33:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 14:33:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2025-03-03 14:33:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.0266666666666666) internal successors, (77), 73 states have internal predecessors, (77), 20 states have call successors, (20), 16 states have call predecessors, (20), 9 states have return successors, (45), 15 states have call predecessors, (45), 20 states have call successors, (45) [2025-03-03 14:33:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2025-03-03 14:33:48,555 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 528 [2025-03-03 14:33:48,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:48,555 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2025-03-03 14:33:48,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.21875) internal successors, (103), 32 states have internal predecessors, (103), 26 states have call successors, (32), 2 states have call predecessors, (32), 14 states have return successors, (43), 15 states have call predecessors, (43), 26 states have call successors, (43) [2025-03-03 14:33:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2025-03-03 14:33:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-03 14:33:48,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:48,559 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:48,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 14:33:48,760 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:33:48,760 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:48,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:48,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2121070825, now seen corresponding path program 11 times [2025-03-03 14:33:48,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:48,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504101144] [2025-03-03 14:33:48,761 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:48,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:48,773 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 569 statements into 78 equivalence classes. [2025-03-03 14:33:48,884 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) and asserted 529 of 569 statements. [2025-03-03 14:33:48,884 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2025-03-03 14:33:48,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2669 proven. 2765 refuted. 0 times theorem prover too weak. 13669 trivial. 0 not checked. [2025-03-03 14:33:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504101144] [2025-03-03 14:33:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504101144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102412557] [2025-03-03 14:33:49,518 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:33:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:49,519 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:33:49,521 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:33:49,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 569 statements into 78 equivalence classes. [2025-03-03 14:33:49,800 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) and asserted 529 of 569 statements. [2025-03-03 14:33:49,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 74 check-sat command(s) [2025-03-03 14:33:49,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:49,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:33:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2649 proven. 2769 refuted. 0 times theorem prover too weak. 13685 trivial. 0 not checked. [2025-03-03 14:33:49,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 2657 proven. 2852 refuted. 0 times theorem prover too weak. 13594 trivial. 0 not checked. [2025-03-03 14:33:52,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102412557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:52,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:52,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 29] total 33 [2025-03-03 14:33:52,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330910595] [2025-03-03 14:33:52,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 14:33:52,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:52,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 14:33:52,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:33:52,846 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (41), 17 states have call predecessors, (41), 27 states have call successors, (41) [2025-03-03 14:33:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:53,385 INFO L93 Difference]: Finished difference Result 258 states and 402 transitions. [2025-03-03 14:33:53,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 14:33:53,386 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (41), 17 states have call predecessors, (41), 27 states have call successors, (41) Word has length 569 [2025-03-03 14:33:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:53,388 INFO L225 Difference]: With dead ends: 258 [2025-03-03 14:33:53,388 INFO L226 Difference]: Without dead ends: 151 [2025-03-03 14:33:53,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1121 SyntacticMatches, 14 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1210, Invalid=3760, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 14:33:53,390 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 239 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:53,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 192 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:33:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-03 14:33:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 119. [2025-03-03 14:33:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.0235294117647058) internal successors, (87), 83 states have internal predecessors, (87), 24 states have call successors, (24), 19 states have call predecessors, (24), 9 states have return successors, (60), 16 states have call predecessors, (60), 24 states have call successors, (60) [2025-03-03 14:33:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-03 14:33:53,406 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 569 [2025-03-03 14:33:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:53,407 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-03 14:33:53,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.121212121212121) internal successors, (103), 33 states have internal predecessors, (103), 27 states have call successors, (31), 1 states have call predecessors, (31), 15 states have return successors, (41), 17 states have call predecessors, (41), 27 states have call successors, (41) [2025-03-03 14:33:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-03 14:33:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 14:33:53,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:53,409 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:53,416 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:33:53,609 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:33:53,609 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:53,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:53,610 INFO L85 PathProgramCache]: Analyzing trace with hash 277520530, now seen corresponding path program 12 times [2025-03-03 14:33:53,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:53,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515425776] [2025-03-03 14:33:53,610 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:53,631 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 460 statements into 54 equivalence classes. [2025-03-03 14:33:53,652 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 221 of 460 statements. [2025-03-03 14:33:53,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-03 14:33:53,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 525 proven. 1830 refuted. 0 times theorem prover too weak. 10032 trivial. 0 not checked. [2025-03-03 14:33:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515425776] [2025-03-03 14:33:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515425776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361511033] [2025-03-03 14:33:53,924 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:53,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:53,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:53,926 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:33:53,928 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:33:54,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 460 statements into 54 equivalence classes. [2025-03-03 14:33:54,120 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) and asserted 221 of 460 statements. [2025-03-03 14:33:54,120 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2025-03-03 14:33:54,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:54,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 14:33:54,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 508 proven. 1816 refuted. 0 times theorem prover too weak. 10063 trivial. 0 not checked. [2025-03-03 14:33:54,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 512 proven. 1869 refuted. 0 times theorem prover too weak. 10006 trivial. 0 not checked. [2025-03-03 14:33:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361511033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:55,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:55,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 17] total 27 [2025-03-03 14:33:55,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402463549] [2025-03-03 14:33:55,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:55,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:33:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:55,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:33:55,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:33:55,792 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 27 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-03 14:33:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:56,165 INFO L93 Difference]: Finished difference Result 146 states and 209 transitions. [2025-03-03 14:33:56,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 14:33:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) Word has length 460 [2025-03-03 14:33:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:56,167 INFO L225 Difference]: With dead ends: 146 [2025-03-03 14:33:56,168 INFO L226 Difference]: Without dead ends: 142 [2025-03-03 14:33:56,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 908 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=645, Invalid=1517, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 14:33:56,168 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 118 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:56,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 128 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-03 14:33:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 122. [2025-03-03 14:33:56,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 85 states have internal predecessors, (89), 24 states have call successors, (24), 19 states have call predecessors, (24), 10 states have return successors, (65), 17 states have call predecessors, (65), 24 states have call successors, (65) [2025-03-03 14:33:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 178 transitions. [2025-03-03 14:33:56,178 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 178 transitions. Word has length 460 [2025-03-03 14:33:56,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:56,178 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 178 transitions. [2025-03-03 14:33:56,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 3.0) internal successors, (69), 27 states have internal predecessors, (69), 19 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (27), 13 states have call predecessors, (27), 19 states have call successors, (27) [2025-03-03 14:33:56,179 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 178 transitions. [2025-03-03 14:33:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2025-03-03 14:33:56,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:56,182 INFO L218 NwaCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:56,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 14:33:56,385 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:33:56,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:56,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash -671802956, now seen corresponding path program 13 times [2025-03-03 14:33:56,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:56,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539688160] [2025-03-03 14:33:56,386 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:56,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:56,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-03 14:33:56,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-03 14:33:56,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:56,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:57,000 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2025-03-03 14:33:57,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:57,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539688160] [2025-03-03 14:33:57,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539688160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368978569] [2025-03-03 14:33:57,001 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:33:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:57,003 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:33:57,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:33:57,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 746 statements into 1 equivalence classes. [2025-03-03 14:33:57,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 746 of 746 statements. [2025-03-03 14:33:57,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:33:57,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:57,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1676 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 14:33:57,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2025-03-03 14:33:57,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:34:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4480 refuted. 0 times theorem prover too weak. 27957 trivial. 0 not checked. [2025-03-03 14:34:00,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368978569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:34:00,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:34:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2025-03-03 14:34:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177280261] [2025-03-03 14:34:00,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:34:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:34:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:34:00,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:34:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:34:00,459 INFO L87 Difference]: Start difference. First operand 122 states and 178 transitions. Second operand has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (28), 10 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-03 14:34:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:34:00,599 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2025-03-03 14:34:00,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 14:34:00,600 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (28), 10 states have call predecessors, (28), 20 states have call successors, (28) Word has length 746 [2025-03-03 14:34:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:34:00,602 INFO L225 Difference]: With dead ends: 131 [2025-03-03 14:34:00,602 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 14:34:00,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1519 GetRequests, 1481 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=636, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:34:00,603 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:34:00,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 100 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:34:00,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 14:34:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 14:34:00,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 88 states have internal predecessors, (92), 25 states have call successors, (25), 19 states have call predecessors, (25), 11 states have return successors, (76), 19 states have call predecessors, (76), 25 states have call successors, (76) [2025-03-03 14:34:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 193 transitions. [2025-03-03 14:34:00,614 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 193 transitions. Word has length 746 [2025-03-03 14:34:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:34:00,614 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 193 transitions. [2025-03-03 14:34:00,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 23 states have internal predecessors, (70), 20 states have call successors, (21), 1 states have call predecessors, (21), 10 states have return successors, (28), 10 states have call predecessors, (28), 20 states have call successors, (28) [2025-03-03 14:34:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 193 transitions. [2025-03-03 14:34:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1319 [2025-03-03 14:34:00,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:34:00,622 INFO L218 NwaCegarLoop]: trace histogram [193, 193, 156, 96, 96, 96, 96, 96, 96, 96, 60, 37, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:34:00,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 14:34:00,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:34:00,826 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:34:00,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:34:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1914745010, now seen corresponding path program 14 times [2025-03-03 14:34:00,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:34:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952110277] [2025-03-03 14:34:00,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:34:00,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:34:00,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1318 statements into 2 equivalence classes. [2025-03-03 14:34:00,950 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1318 of 1318 statements. [2025-03-03 14:34:00,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:34:00,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:34:02,197 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 1204 proven. 9076 refuted. 0 times theorem prover too weak. 94162 trivial. 0 not checked. [2025-03-03 14:34:02,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:34:02,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952110277] [2025-03-03 14:34:02,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952110277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:34:02,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320496181] [2025-03-03 14:34:02,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:34:02,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:34:02,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:34:02,200 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:34:02,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:34:02,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1318 statements into 2 equivalence classes. [2025-03-03 14:34:02,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1318 of 1318 statements. [2025-03-03 14:34:02,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:34:02,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:34:02,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 2946 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 14:34:02,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:34:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 1204 proven. 9076 refuted. 0 times theorem prover too weak. 94162 trivial. 0 not checked. [2025-03-03 14:34:02,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:34:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 104442 backedges. 1204 proven. 9202 refuted. 0 times theorem prover too weak. 94036 trivial. 0 not checked. [2025-03-03 14:34:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320496181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:34:07,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:34:07,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2025-03-03 14:34:07,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901691889] [2025-03-03 14:34:07,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:34:07,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 14:34:07,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:34:07,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 14:34:07,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:34:07,455 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) [2025-03-03 14:34:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:34:07,669 INFO L93 Difference]: Finished difference Result 136 states and 217 transitions. [2025-03-03 14:34:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:34:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) Word has length 1318 [2025-03-03 14:34:07,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:34:07,676 INFO L225 Difference]: With dead ends: 136 [2025-03-03 14:34:07,676 INFO L226 Difference]: Without dead ends: 132 [2025-03-03 14:34:07,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2666 GetRequests, 2624 SyntacticMatches, 10 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=356, Invalid=766, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 14:34:07,680 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 198 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:34:07,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 113 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:34:07,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-03 14:34:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-03 14:34:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.021505376344086) internal successors, (95), 91 states have internal predecessors, (95), 26 states have call successors, (26), 19 states have call predecessors, (26), 12 states have return successors, (89), 21 states have call predecessors, (89), 26 states have call successors, (89) [2025-03-03 14:34:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 210 transitions. [2025-03-03 14:34:07,695 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 210 transitions. Word has length 1318 [2025-03-03 14:34:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:34:07,695 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 210 transitions. [2025-03-03 14:34:07,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 25 states have internal predecessors, (76), 22 states have call successors, (23), 1 states have call predecessors, (23), 11 states have return successors, (31), 11 states have call predecessors, (31), 22 states have call successors, (31) [2025-03-03 14:34:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 210 transitions. [2025-03-03 14:34:07,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2504 [2025-03-03 14:34:07,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:34:07,739 INFO L218 NwaCegarLoop]: trace histogram [367, 367, 297, 183, 183, 183, 183, 183, 183, 183, 114, 70, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:34:07,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:34:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:34:07,940 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:34:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:34:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1811166535, now seen corresponding path program 15 times [2025-03-03 14:34:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:34:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600075269] [2025-03-03 14:34:07,941 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:34:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:34:07,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2503 statements into 332 equivalence classes. [2025-03-03 14:34:08,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 336 of 2503 statements. [2025-03-03 14:34:08,005 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-03 14:34:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:34:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 379212 backedges. 2375 proven. 19684 refuted. 0 times theorem prover too weak. 357153 trivial. 0 not checked. [2025-03-03 14:34:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:34:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600075269] [2025-03-03 14:34:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600075269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:34:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994992354] [2025-03-03 14:34:08,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:34:08,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:34:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:34:08,367 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:34:08,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:34:08,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2503 statements into 332 equivalence classes. [2025-03-03 14:34:08,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) and asserted 336 of 2503 statements. [2025-03-03 14:34:08,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2025-03-03 14:34:08,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:34:08,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 14:34:08,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:34:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 379212 backedges. 2375 proven. 19684 refuted. 0 times theorem prover too weak. 357153 trivial. 0 not checked. [2025-03-03 14:34:08,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:34:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 379212 backedges. 2375 proven. 19839 refuted. 0 times theorem prover too weak. 356998 trivial. 0 not checked. [2025-03-03 14:34:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994992354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:34:16,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:34:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2025-03-03 14:34:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063426937] [2025-03-03 14:34:16,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:34:16,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:34:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:34:16,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:34:16,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:34:16,947 INFO L87 Difference]: Start difference. First operand 132 states and 210 transitions. Second operand has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-03 14:34:17,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:34:17,142 INFO L93 Difference]: Finished difference Result 141 states and 236 transitions. [2025-03-03 14:34:17,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:34:17,143 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) Word has length 2503 [2025-03-03 14:34:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:34:17,146 INFO L225 Difference]: With dead ends: 141 [2025-03-03 14:34:17,146 INFO L226 Difference]: Without dead ends: 137 [2025-03-03 14:34:17,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5039 GetRequests, 4993 SyntacticMatches, 11 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=424, Invalid=908, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 14:34:17,147 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 144 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:34:17,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 136 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:34:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-03 14:34:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-03 14:34:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 96 states have (on average 1.0208333333333333) internal successors, (98), 94 states have internal predecessors, (98), 27 states have call successors, (27), 19 states have call predecessors, (27), 13 states have return successors, (104), 23 states have call predecessors, (104), 27 states have call successors, (104) [2025-03-03 14:34:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 229 transitions. [2025-03-03 14:34:17,157 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 229 transitions. Word has length 2503 [2025-03-03 14:34:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:34:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 229 transitions. [2025-03-03 14:34:17,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.28) internal successors, (82), 27 states have internal predecessors, (82), 24 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (34), 12 states have call predecessors, (34), 24 states have call successors, (34) [2025-03-03 14:34:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 229 transitions. [2025-03-03 14:34:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6290 [2025-03-03 14:34:17,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:34:17,372 INFO L218 NwaCegarLoop]: trace histogram [923, 923, 747, 461, 461, 461, 461, 461, 461, 461, 286, 176, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:34:17,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 14:34:17,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:34:17,573 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:34:17,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:34:17,574 INFO L85 PathProgramCache]: Analyzing trace with hash 554525801, now seen corresponding path program 16 times [2025-03-03 14:34:17,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:34:17,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401137103] [2025-03-03 14:34:17,574 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:34:17,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:34:17,651 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6289 statements into 2 equivalence classes. [2025-03-03 14:34:19,149 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 5363 of 6289 statements. [2025-03-03 14:34:19,149 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:34:19,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:34:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2404763 backedges. 9996 proven. 90469 refuted. 0 times theorem prover too weak. 2304298 trivial. 0 not checked. [2025-03-03 14:34:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:34:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401137103] [2025-03-03 14:34:47,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401137103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:34:47,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788359204] [2025-03-03 14:34:47,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:34:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:34:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:34:47,625 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:34:47,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 14:34:48,135 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6289 statements into 2 equivalence classes. [2025-03-03 14:34:48,895 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 5363 of 6289 statements. [2025-03-03 14:34:48,895 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:34:48,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:34:48,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 11190 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 14:34:48,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:34:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2404763 backedges. 721681 proven. 9994 refuted. 0 times theorem prover too weak. 1673088 trivial. 0 not checked. [2025-03-03 14:34:49,218 INFO L312 TraceCheckSpWp]: Computing backward predicates...