./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardware-verification-bv/btor2c-lazyMod.twocount32.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 22:43:17,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 22:43:17,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 22:43:17,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 22:43:17,865 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 22:43:17,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 22:43:17,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 22:43:17,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 22:43:17,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 22:43:17,889 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 22:43:17,889 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 22:43:17,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 22:43:17,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 22:43:17,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 22:43:17,890 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 22:43:17,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 22:43:17,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 22:43:17,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 22:43:17,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 22:43:17,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 22:43:17,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 22:43:17,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:43:17,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 22:43:17,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 22:43:17,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 22:43:17,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 22:43:17,893 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f88bd3867028d60c5c1c8fa67c55aaa517a9782eae2d2c8498cbbc5893e8cf0 [2025-03-16 22:43:18,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 22:43:18,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 22:43:18,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 22:43:18,155 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 22:43:18,156 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 22:43:18,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2025-03-16 22:43:19,303 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45fead80f/6768dc1669504b7da84a97f32bfc6d86/FLAG7828ac42a [2025-03-16 22:43:19,498 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 22:43:19,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount32.c [2025-03-16 22:43:19,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45fead80f/6768dc1669504b7da84a97f32bfc6d86/FLAG7828ac42a [2025-03-16 22:43:19,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45fead80f/6768dc1669504b7da84a97f32bfc6d86 [2025-03-16 22:43:19,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 22:43:19,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 22:43:19,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 22:43:19,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 22:43:19,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 22:43:19,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@368dfe1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19, skipping insertion in model container [2025-03-16 22:43:19,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 22:43:19,633 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/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2025-03-16 22:43:19,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:43:19,678 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 22:43:19,687 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/hardware-verification-bv/btor2c-lazyMod.twocount32.c[1260,1273] [2025-03-16 22:43:19,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 22:43:19,718 INFO L204 MainTranslator]: Completed translation [2025-03-16 22:43:19,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19 WrapperNode [2025-03-16 22:43:19,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 22:43:19,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 22:43:19,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 22:43:19,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 22:43:19,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,754 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 137 [2025-03-16 22:43:19,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 22:43:19,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 22:43:19,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 22:43:19,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 22:43:19,761 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,782 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-16 22:43:19,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 22:43:19,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 22:43:19,801 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 22:43:19,801 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 22:43:19,802 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (1/1) ... [2025-03-16 22:43:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 22:43:19,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:19,828 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-16 22:43:19,830 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-16 22:43:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 22:43:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 22:43:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 22:43:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 22:43:19,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 22:43:19,909 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 22:43:20,188 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-16 22:43:20,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 22:43:20,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 22:43:20,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 22:43:20,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:43:20 BoogieIcfgContainer [2025-03-16 22:43:20,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 22:43:20,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 22:43:20,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 22:43:20,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 22:43:20,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 10:43:19" (1/3) ... [2025-03-16 22:43:20,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731433d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:43:20, skipping insertion in model container [2025-03-16 22:43:20,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 10:43:19" (2/3) ... [2025-03-16 22:43:20,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731433d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 10:43:20, skipping insertion in model container [2025-03-16 22:43:20,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 10:43:20" (3/3) ... [2025-03-16 22:43:20,222 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount32.c [2025-03-16 22:43:20,232 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 22:43:20,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.twocount32.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 22:43:20,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 22:43:20,294 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;@41215327, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 22:43:20,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 22:43:20,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 22:43:20,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:20,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:20,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:20,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:20,309 INFO L85 PathProgramCache]: Analyzing trace with hash 511558256, now seen corresponding path program 1 times [2025-03-16 22:43:20,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018839017] [2025-03-16 22:43:20,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:20,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 22:43:20,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 22:43:20,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:20,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:20,713 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-16 22:43:20,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:20,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018839017] [2025-03-16 22:43:20,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018839017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:20,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:43:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398784342] [2025-03-16 22:43:20,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:20,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:43:20,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:20,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:43:20,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:43:20,734 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:20,787 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2025-03-16 22:43:20,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:43:20,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 22:43:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:20,797 INFO L225 Difference]: With dead ends: 71 [2025-03-16 22:43:20,797 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 22:43:20,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:43:20,801 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:20,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:43:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 22:43:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-16 22:43:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-03-16 22:43:20,826 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 14 [2025-03-16 22:43:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:20,826 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-03-16 22:43:20,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-03-16 22:43:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-16 22:43:20,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:20,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:20,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 22:43:20,830 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:20,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:20,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1316884084, now seen corresponding path program 1 times [2025-03-16 22:43:20,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:20,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130521810] [2025-03-16 22:43:20,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:20,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:20,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-16 22:43:20,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-16 22:43:20,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:20,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:20,962 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-16 22:43:20,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130521810] [2025-03-16 22:43:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130521810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:20,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:20,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 22:43:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298819135] [2025-03-16 22:43:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:20,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 22:43:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:20,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 22:43:20,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:43:20,966 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:21,004 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2025-03-16 22:43:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 22:43:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-16 22:43:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:21,006 INFO L225 Difference]: With dead ends: 73 [2025-03-16 22:43:21,006 INFO L226 Difference]: Without dead ends: 42 [2025-03-16 22:43:21,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 22:43:21,007 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:21,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 22:43:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-16 22:43:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-16 22:43:21,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-03-16 22:43:21,010 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 15 [2025-03-16 22:43:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:21,011 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-03-16 22:43:21,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-03-16 22:43:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-16 22:43:21,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:21,011 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:21,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 22:43:21,012 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash -237191701, now seen corresponding path program 1 times [2025-03-16 22:43:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323411071] [2025-03-16 22:43:21,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:21,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-16 22:43:21,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-16 22:43:21,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:21,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:21,298 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-16 22:43:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323411071] [2025-03-16 22:43:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323411071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:43:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526408616] [2025-03-16 22:43:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:21,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:43:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:21,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:43:21,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:21,299 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:21,406 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2025-03-16 22:43:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:43:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-16 22:43:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:21,408 INFO L225 Difference]: With dead ends: 86 [2025-03-16 22:43:21,408 INFO L226 Difference]: Without dead ends: 53 [2025-03-16 22:43:21,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:21,408 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 18 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:21,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 189 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:21,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-16 22:43:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2025-03-16 22:43:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 66 transitions. [2025-03-16 22:43:21,415 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 66 transitions. Word has length 16 [2025-03-16 22:43:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:21,415 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 66 transitions. [2025-03-16 22:43:21,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 66 transitions. [2025-03-16 22:43:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 22:43:21,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:21,417 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:21,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 22:43:21,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:21,418 INFO L85 PathProgramCache]: Analyzing trace with hash -524993731, now seen corresponding path program 1 times [2025-03-16 22:43:21,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:21,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432778638] [2025-03-16 22:43:21,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:21,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:21,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-16 22:43:21,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 22:43:21,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:21,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:21,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:21,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432778638] [2025-03-16 22:43:21,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432778638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:21,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:21,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:43:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76389602] [2025-03-16 22:43:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:43:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:21,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:43:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:21,823 INFO L87 Difference]: Start difference. First operand 48 states and 66 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:21,985 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2025-03-16 22:43:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:43:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-16 22:43:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:21,987 INFO L225 Difference]: With dead ends: 98 [2025-03-16 22:43:21,987 INFO L226 Difference]: Without dead ends: 65 [2025-03-16 22:43:21,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 22:43:21,988 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:21,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 139 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-16 22:43:21,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2025-03-16 22:43:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-03-16 22:43:21,994 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 31 [2025-03-16 22:43:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:21,994 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-03-16 22:43:21,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2025-03-16 22:43:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 22:43:21,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:21,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:21,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 22:43:21,995 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:21,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash 601435853, now seen corresponding path program 1 times [2025-03-16 22:43:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:21,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548090382] [2025-03-16 22:43:21,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:22,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 22:43:22,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 22:43:22,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:22,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:22,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548090382] [2025-03-16 22:43:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548090382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:43:22,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550909676] [2025-03-16 22:43:22,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:22,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:43:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:22,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:43:22,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:22,294 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:22,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:22,403 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2025-03-16 22:43:22,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:43:22,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 22:43:22,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:22,405 INFO L225 Difference]: With dead ends: 136 [2025-03-16 22:43:22,406 INFO L226 Difference]: Without dead ends: 101 [2025-03-16 22:43:22,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:22,407 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:22,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 242 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-16 22:43:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-16 22:43:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-16 22:43:22,417 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 32 [2025-03-16 22:43:22,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:22,417 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-16 22:43:22,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:22,417 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-03-16 22:43:22,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 22:43:22,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:22,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:22,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 22:43:22,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:22,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash 851712968, now seen corresponding path program 1 times [2025-03-16 22:43:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618780013] [2025-03-16 22:43:22,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:22,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 22:43:22,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 22:43:22,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:22,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618780013] [2025-03-16 22:43:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618780013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:22,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:22,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:43:22,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136186611] [2025-03-16 22:43:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:22,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:43:22,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:22,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:43:22,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:22,769 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:22,867 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2025-03-16 22:43:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:43:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-16 22:43:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:22,868 INFO L225 Difference]: With dead ends: 101 [2025-03-16 22:43:22,868 INFO L226 Difference]: Without dead ends: 70 [2025-03-16 22:43:22,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:22,869 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 20 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:22,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 132 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:22,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-16 22:43:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-03-16 22:43:22,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-03-16 22:43:22,873 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 32 [2025-03-16 22:43:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:22,873 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-03-16 22:43:22,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:22,874 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2025-03-16 22:43:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 22:43:22,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:22,874 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:22,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 22:43:22,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 271977671, now seen corresponding path program 1 times [2025-03-16 22:43:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366877520] [2025-03-16 22:43:22,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:22,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:43:22,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:43:22,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:22,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:23,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:23,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366877520] [2025-03-16 22:43:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366877520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:43:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123021245] [2025-03-16 22:43:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:23,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:43:23,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:23,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:43:23,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:23,246 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:23,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:23,348 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2025-03-16 22:43:23,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:43:23,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 22:43:23,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:23,349 INFO L225 Difference]: With dead ends: 107 [2025-03-16 22:43:23,349 INFO L226 Difference]: Without dead ends: 70 [2025-03-16 22:43:23,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:23,350 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:23,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 143 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-16 22:43:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-03-16 22:43:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-16 22:43:23,357 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 33 [2025-03-16 22:43:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:23,357 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-16 22:43:23,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-16 22:43:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 22:43:23,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:23,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:23,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 22:43:23,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:23,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1065976947, now seen corresponding path program 1 times [2025-03-16 22:43:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830458390] [2025-03-16 22:43:23,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:23,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:23,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:43:23,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:43:23,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:23,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:23,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:23,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830458390] [2025-03-16 22:43:23,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830458390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:23,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:23,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 22:43:23,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874725922] [2025-03-16 22:43:23,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:23,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:43:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:23,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:43:23,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:23,656 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:23,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:23,805 INFO L93 Difference]: Finished difference Result 107 states and 142 transitions. [2025-03-16 22:43:23,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:43:23,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 22:43:23,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:23,806 INFO L225 Difference]: With dead ends: 107 [2025-03-16 22:43:23,806 INFO L226 Difference]: Without dead ends: 74 [2025-03-16 22:43:23,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:43:23,807 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:23,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 140 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-16 22:43:23,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-03-16 22:43:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.318840579710145) internal successors, (91), 69 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2025-03-16 22:43:23,810 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 33 [2025-03-16 22:43:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:23,810 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2025-03-16 22:43:23,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2025-03-16 22:43:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 22:43:23,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:23,811 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:23,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 22:43:23,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:23,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1316254062, now seen corresponding path program 1 times [2025-03-16 22:43:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610327774] [2025-03-16 22:43:23,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:23,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:43:23,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:43:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:23,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610327774] [2025-03-16 22:43:23,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610327774] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:23,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698373857] [2025-03-16 22:43:23,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:23,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:23,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:23,998 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-16 22:43:24,000 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-16 22:43:24,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 22:43:24,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 22:43:24,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:24,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:24,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 22:43:24,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:24,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:43:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698373857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:43:24,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2025-03-16 22:43:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634635313] [2025-03-16 22:43:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:24,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 22:43:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:24,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 22:43:24,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:43:24,195 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:24,275 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2025-03-16 22:43:24,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 22:43:24,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-16 22:43:24,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:24,277 INFO L225 Difference]: With dead ends: 142 [2025-03-16 22:43:24,277 INFO L226 Difference]: Without dead ends: 106 [2025-03-16 22:43:24,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 22:43:24,277 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 65 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:24,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 176 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-16 22:43:24,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 93. [2025-03-16 22:43:24,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:24,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2025-03-16 22:43:24,281 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 33 [2025-03-16 22:43:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:24,282 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2025-03-16 22:43:24,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:24,282 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2025-03-16 22:43:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 22:43:24,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:24,283 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:24,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 22:43:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:24,483 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1714370032, now seen corresponding path program 1 times [2025-03-16 22:43:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:24,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966911915] [2025-03-16 22:43:24,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:24,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:43:24,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:43:24,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:24,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:24,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:24,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:24,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966911915] [2025-03-16 22:43:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966911915] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879089670] [2025-03-16 22:43:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:24,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:24,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:24,633 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-16 22:43:24,635 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-16 22:43:24,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:43:24,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:43:24,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:24,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:24,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 22:43:24,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:24,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 22:43:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879089670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:24,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 22:43:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-16 22:43:24,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769426414] [2025-03-16 22:43:24,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:24,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:43:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:24,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:43:24,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:43:24,780 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:24,855 INFO L93 Difference]: Finished difference Result 177 states and 233 transitions. [2025-03-16 22:43:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:43:24,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 22:43:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:24,856 INFO L225 Difference]: With dead ends: 177 [2025-03-16 22:43:24,856 INFO L226 Difference]: Without dead ends: 120 [2025-03-16 22:43:24,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 22:43:24,856 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:24,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 127 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-16 22:43:24,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2025-03-16 22:43:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2025-03-16 22:43:24,863 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 34 [2025-03-16 22:43:24,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:24,863 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2025-03-16 22:43:24,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:24,864 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2025-03-16 22:43:24,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 22:43:24,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:24,864 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:24,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 22:43:25,064 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,SelfDestructingSolverStorable9 [2025-03-16 22:43:25,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:25,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -919283915, now seen corresponding path program 1 times [2025-03-16 22:43:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:25,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995745729] [2025-03-16 22:43:25,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:43:25,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:43:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:25,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:25,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995745729] [2025-03-16 22:43:25,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995745729] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:25,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69304309] [2025-03-16 22:43:25,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:25,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:25,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:25,251 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-16 22:43:25,253 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-16 22:43:25,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 22:43:25,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 22:43:25,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:25,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:25,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-16 22:43:25,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:25,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:25,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69304309] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:25,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2025-03-16 22:43:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983990713] [2025-03-16 22:43:25,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:25,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 22:43:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:25,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 22:43:25,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:43:25,726 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:25,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:25,991 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2025-03-16 22:43:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 22:43:25,992 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-03-16 22:43:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:25,992 INFO L225 Difference]: With dead ends: 182 [2025-03-16 22:43:25,992 INFO L226 Difference]: Without dead ends: 128 [2025-03-16 22:43:25,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-03-16 22:43:25,994 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 161 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:25,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 287 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 22:43:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-16 22:43:25,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2025-03-16 22:43:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 115 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:25,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2025-03-16 22:43:25,998 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 34 [2025-03-16 22:43:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:25,998 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2025-03-16 22:43:25,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 17 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2025-03-16 22:43:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 22:43:25,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:25,999 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:26,006 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-16 22:43:26,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:26,204 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:26,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash -379350317, now seen corresponding path program 1 times [2025-03-16 22:43:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:26,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288609694] [2025-03-16 22:43:26,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:26,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 22:43:26,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 22:43:26,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:26,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:26,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288609694] [2025-03-16 22:43:26,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288609694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:26,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468649754] [2025-03-16 22:43:26,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:26,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:26,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:26,349 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-16 22:43:26,350 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-16 22:43:26,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 22:43:26,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 22:43:26,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:26,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:26,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 22:43:26,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:26,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:26,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:26,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468649754] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:26,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:26,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2025-03-16 22:43:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818457262] [2025-03-16 22:43:26,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:26,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 22:43:26,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:26,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 22:43:26,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-16 22:43:26,716 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:26,879 INFO L93 Difference]: Finished difference Result 240 states and 314 transitions. [2025-03-16 22:43:26,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 22:43:26,879 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-16 22:43:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:26,880 INFO L225 Difference]: With dead ends: 240 [2025-03-16 22:43:26,880 INFO L226 Difference]: Without dead ends: 166 [2025-03-16 22:43:26,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-03-16 22:43:26,882 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 152 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:26,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 227 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-16 22:43:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2025-03-16 22:43:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 115 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2025-03-16 22:43:26,892 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 35 [2025-03-16 22:43:26,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:26,892 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2025-03-16 22:43:26,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2025-03-16 22:43:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 22:43:26,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:26,893 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:26,899 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-16 22:43:27,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:27,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:27,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 821414391, now seen corresponding path program 1 times [2025-03-16 22:43:27,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-03-16 22:43:27,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:27,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:43:27,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:43:27,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:27,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:27,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894943284] [2025-03-16 22:43:27,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894943284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:27,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:27,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 22:43:27,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620842161] [2025-03-16 22:43:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:27,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 22:43:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:27,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 22:43:27,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 22:43:27,334 INFO L87 Difference]: Start difference. First operand 116 states and 151 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:27,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:27,447 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2025-03-16 22:43:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 22:43:27,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 22:43:27,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:27,448 INFO L225 Difference]: With dead ends: 218 [2025-03-16 22:43:27,448 INFO L226 Difference]: Without dead ends: 144 [2025-03-16 22:43:27,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 22:43:27,449 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 34 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:27,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 118 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-16 22:43:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-03-16 22:43:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2025-03-16 22:43:27,453 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 36 [2025-03-16 22:43:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:27,453 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2025-03-16 22:43:27,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2025-03-16 22:43:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 22:43:27,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:27,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:27,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 22:43:27,454 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:27,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:27,454 INFO L85 PathProgramCache]: Analyzing trace with hash -255386262, now seen corresponding path program 1 times [2025-03-16 22:43:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819513853] [2025-03-16 22:43:27,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:27,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:27,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 22:43:27,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 22:43:27,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:27,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:27,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:27,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819513853] [2025-03-16 22:43:27,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819513853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 22:43:27,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 22:43:27,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 22:43:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497677144] [2025-03-16 22:43:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 22:43:27,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 22:43:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:27,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 22:43:27,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:27,691 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:27,762 INFO L93 Difference]: Finished difference Result 226 states and 295 transitions. [2025-03-16 22:43:27,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 22:43:27,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-16 22:43:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:27,763 INFO L225 Difference]: With dead ends: 226 [2025-03-16 22:43:27,763 INFO L226 Difference]: Without dead ends: 140 [2025-03-16 22:43:27,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 22:43:27,764 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:27,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 105 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 22:43:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-16 22:43:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-16 22:43:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.289855072463768) internal successors, (178), 138 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 178 transitions. [2025-03-16 22:43:27,769 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 178 transitions. Word has length 36 [2025-03-16 22:43:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:27,770 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 178 transitions. [2025-03-16 22:43:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 178 transitions. [2025-03-16 22:43:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 22:43:27,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:27,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:27,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 22:43:27,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:27,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1489794346, now seen corresponding path program 1 times [2025-03-16 22:43:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:27,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368441768] [2025-03-16 22:43:27,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:27,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:43:27,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:43:27,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:27,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:28,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368441768] [2025-03-16 22:43:28,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368441768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:28,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33031389] [2025-03-16 22:43:28,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:28,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:28,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:28,166 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-16 22:43:28,168 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-16 22:43:28,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 22:43:28,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 22:43:28,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:28,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:28,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-16 22:43:28,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:28,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:30,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33031389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:30,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:30,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 30 [2025-03-16 22:43:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088286307] [2025-03-16 22:43:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:30,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 22:43:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:30,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 22:43:30,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2025-03-16 22:43:30,516 INFO L87 Difference]: Start difference. First operand 139 states and 178 transitions. Second operand has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:30,962 INFO L93 Difference]: Finished difference Result 265 states and 343 transitions. [2025-03-16 22:43:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 22:43:30,962 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-16 22:43:30,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:30,963 INFO L225 Difference]: With dead ends: 265 [2025-03-16 22:43:30,963 INFO L226 Difference]: Without dead ends: 191 [2025-03-16 22:43:30,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 22:43:30,964 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 98 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:30,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 193 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:43:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-16 22:43:30,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 127. [2025-03-16 22:43:30,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.2936507936507937) internal successors, (163), 126 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2025-03-16 22:43:30,967 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 37 [2025-03-16 22:43:30,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:30,968 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2025-03-16 22:43:30,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.064516129032258) internal successors, (95), 30 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:30,968 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2025-03-16 22:43:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 22:43:30,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:30,968 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:30,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 22:43:31,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 22:43:31,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:31,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:31,169 INFO L85 PathProgramCache]: Analyzing trace with hash -547875937, now seen corresponding path program 1 times [2025-03-16 22:43:31,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:31,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642665368] [2025-03-16 22:43:31,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:31,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:31,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:43:31,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:43:31,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:31,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:31,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642665368] [2025-03-16 22:43:31,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642665368] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:31,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732369098] [2025-03-16 22:43:31,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:31,439 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-16 22:43:31,440 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-16 22:43:31,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 22:43:31,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 22:43:31,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:31,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:31,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 22:43:31,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:43:31,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 22:43:31,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732369098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:31,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:31,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-16 22:43:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043247911] [2025-03-16 22:43:31,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:31,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 22:43:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:31,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 22:43:31,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-16 22:43:31,947 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 20 states, 20 states have (on average 6.25) internal successors, (125), 19 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:32,630 INFO L93 Difference]: Finished difference Result 348 states and 451 transitions. [2025-03-16 22:43:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 22:43:32,631 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.25) internal successors, (125), 19 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 22:43:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:32,633 INFO L225 Difference]: With dead ends: 348 [2025-03-16 22:43:32,633 INFO L226 Difference]: Without dead ends: 274 [2025-03-16 22:43:32,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 22:43:32,634 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 245 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:32,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 183 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 22:43:32,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-16 22:43:32,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 153. [2025-03-16 22:43:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 152 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 196 transitions. [2025-03-16 22:43:32,639 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 196 transitions. Word has length 53 [2025-03-16 22:43:32,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:32,639 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 196 transitions. [2025-03-16 22:43:32,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.25) internal successors, (125), 19 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:32,639 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 196 transitions. [2025-03-16 22:43:32,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 22:43:32,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:32,642 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:32,652 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-16 22:43:32,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 22:43:32,843 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:32,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:32,844 INFO L85 PathProgramCache]: Analyzing trace with hash 204312149, now seen corresponding path program 1 times [2025-03-16 22:43:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:32,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432712256] [2025-03-16 22:43:32,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:32,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:43:32,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:43:32,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:32,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:33,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:33,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432712256] [2025-03-16 22:43:33,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432712256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:33,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323816510] [2025-03-16 22:43:33,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:33,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:33,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:33,162 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-16 22:43:33,164 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-16 22:43:33,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 22:43:33,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 22:43:33,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:33,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:33,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 22:43:33,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 22:43:33,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 22:43:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323816510] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:33,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:33,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 23 [2025-03-16 22:43:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541549886] [2025-03-16 22:43:33,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:33,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 22:43:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:33,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 22:43:33,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2025-03-16 22:43:33,715 INFO L87 Difference]: Start difference. First operand 153 states and 196 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:34,563 INFO L93 Difference]: Finished difference Result 479 states and 602 transitions. [2025-03-16 22:43:34,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 22:43:34,563 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 22:43:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:34,564 INFO L225 Difference]: With dead ends: 479 [2025-03-16 22:43:34,564 INFO L226 Difference]: Without dead ends: 370 [2025-03-16 22:43:34,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=2115, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 22:43:34,566 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 246 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:34,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 252 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 22:43:34,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-16 22:43:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 217. [2025-03-16 22:43:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 1.2731481481481481) internal successors, (275), 216 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 275 transitions. [2025-03-16 22:43:34,573 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 275 transitions. Word has length 55 [2025-03-16 22:43:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:34,576 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 275 transitions. [2025-03-16 22:43:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 23 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 275 transitions. [2025-03-16 22:43:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 22:43:34,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:34,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:34,583 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-16 22:43:34,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:34,777 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:34,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:34,777 INFO L85 PathProgramCache]: Analyzing trace with hash -787050805, now seen corresponding path program 2 times [2025-03-16 22:43:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:34,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533875780] [2025-03-16 22:43:34,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:43:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:34,786 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-16 22:43:34,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 22:43:34,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:43:34,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:35,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533875780] [2025-03-16 22:43:35,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533875780] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:35,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313818907] [2025-03-16 22:43:35,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 22:43:35,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:35,653 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-16 22:43:35,653 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-16 22:43:35,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-03-16 22:43:35,805 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 22:43:35,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 22:43:35,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:35,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-16 22:43:35,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:36,439 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:36,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:40,007 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:40,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313818907] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:40,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:40,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 48 [2025-03-16 22:43:40,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713954840] [2025-03-16 22:43:40,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:40,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-16 22:43:40,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:40,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-16 22:43:40,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2157, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 22:43:40,009 INFO L87 Difference]: Start difference. First operand 217 states and 275 transitions. Second operand has 49 states, 49 states have (on average 3.326530612244898) internal successors, (163), 48 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 22:43:44,075 INFO L93 Difference]: Finished difference Result 954 states and 1177 transitions. [2025-03-16 22:43:44,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-16 22:43:44,075 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.326530612244898) internal successors, (163), 48 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-03-16 22:43:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 22:43:44,077 INFO L225 Difference]: With dead ends: 954 [2025-03-16 22:43:44,077 INFO L226 Difference]: Without dead ends: 725 [2025-03-16 22:43:44,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=852, Invalid=8654, Unknown=0, NotChecked=0, Total=9506 [2025-03-16 22:43:44,080 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 336 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 22:43:44,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 408 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 22:43:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-16 22:43:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 254. [2025-03-16 22:43:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.2490118577075098) internal successors, (316), 253 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 316 transitions. [2025-03-16 22:43:44,091 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 316 transitions. Word has length 58 [2025-03-16 22:43:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 22:43:44,091 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 316 transitions. [2025-03-16 22:43:44,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.326530612244898) internal successors, (163), 48 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:43:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 316 transitions. [2025-03-16 22:43:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 22:43:44,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 22:43:44,091 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 22:43:44,100 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-16 22:43:44,292 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,SelfDestructingSolverStorable17 [2025-03-16 22:43:44,292 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 22:43:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 22:43:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1557566571, now seen corresponding path program 1 times [2025-03-16 22:43:44,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 22:43:44,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973793570] [2025-03-16 22:43:44,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:44,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 22:43:44,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 22:43:44,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 22:43:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:45,058 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 27 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 22:43:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973793570] [2025-03-16 22:43:45,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973793570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 22:43:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996776305] [2025-03-16 22:43:45,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 22:43:45,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 22:43:45,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 22:43:45,060 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-16 22:43:45,062 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-16 22:43:45,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 22:43:45,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 22:43:45,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 22:43:45,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 22:43:45,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-16 22:43:45,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 22:43:46,044 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:46,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 22:43:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 12 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 22:43:52,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996776305] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 22:43:52,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 22:43:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27, 29] total 67 [2025-03-16 22:43:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931274336] [2025-03-16 22:43:52,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 22:43:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-16 22:43:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 22:43:52,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-16 22:43:52,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=4109, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 22:43:52,206 INFO L87 Difference]: Start difference. First operand 254 states and 316 transitions. Second operand has 68 states, 68 states have (on average 3.088235294117647) internal successors, (210), 67 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 22:44:07,016 WARN L286 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 105 DAG size of output: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:44:19,200 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 89 DAG size of output: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:44:27,694 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 111 DAG size of output: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:44:36,828 WARN L286 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 97 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-16 22:44:55,251 WARN L286 SmtUtils]: Spent 13.20s on a formula simplification. DAG size of input: 89 DAG size of output: 40 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)