./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:09:42,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:09:42,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:09:42,194 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:09:42,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:09:42,216 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:09:42,217 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:09:42,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:09:42,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:09:42,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:09:42,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:09:42,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:09:42,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:09:42,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:09:42,219 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:09:42,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:09:42,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:09:42,221 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:09:42,221 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:09:42,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:09:42,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:09:42,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:09:42,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:09:42,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:42,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:09:42,222 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cf9a91c8f1111f4616406dfb4a7fdeef392d21e591ff8d6357140f3015668db [2025-03-16 19:09:42,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:09:42,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:09:42,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:09:42,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:09:42,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:09:42,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:43,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dbf1ffe2/589893438fdc4112ab47153d102d770f/FLAG6cd72fe74 [2025-03-16 19:09:43,871 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:09:43,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:43,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dbf1ffe2/589893438fdc4112ab47153d102d770f/FLAG6cd72fe74 [2025-03-16 19:09:43,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dbf1ffe2/589893438fdc4112ab47153d102d770f [2025-03-16 19:09:43,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:09:43,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:09:43,893 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:43,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:09:43,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:09:43,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:43" (1/1) ... [2025-03-16 19:09:43,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a050653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:43, skipping insertion in model container [2025-03-16 19:09:43,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:09:43" (1/1) ... [2025-03-16 19:09:43,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:09:44,045 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/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2025-03-16 19:09:44,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:44,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:09:44,084 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/seq-mthreaded/pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c[8379,8392] [2025-03-16 19:09:44,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:09:44,096 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:09:44,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44 WrapperNode [2025-03-16 19:09:44,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:09:44,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:44,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:09:44,098 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:09:44,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,136 INFO L138 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 273 [2025-03-16 19:09:44,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:09:44,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:09:44,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:09:44,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:09:44,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,158 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 19:09:44,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:09:44,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:09:44,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:09:44,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:09:44,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (1/1) ... [2025-03-16 19:09:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:09:44,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:44,195 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 19:09:44,198 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 19:09:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:09:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:09:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:09:44,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:09:44,283 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:09:44,285 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:09:44,539 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-16 19:09:44,539 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:09:44,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:09:44,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:09:44,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:44 BoogieIcfgContainer [2025-03-16 19:09:44,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:09:44,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:09:44,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:09:44,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:09:44,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:09:43" (1/3) ... [2025-03-16 19:09:44,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c61262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:44, skipping insertion in model container [2025-03-16 19:09:44,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:09:44" (2/3) ... [2025-03-16 19:09:44,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c61262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:09:44, skipping insertion in model container [2025-03-16 19:09:44,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:09:44" (3/3) ... [2025-03-16 19:09:44,556 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c [2025-03-16 19:09:44,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:09:44,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4_overflow.ufo.UNBOUNDED.pals.c that has 1 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 19:09:44,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:09:44,629 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;@798d9595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:09:44,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:09:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 63 states have internal predecessors, (110), 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 19:09:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 19:09:44,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:44,636 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:44,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:44,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2017095885, now seen corresponding path program 1 times [2025-03-16 19:09:44,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:44,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89430837] [2025-03-16 19:09:44,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:44,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:44,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 19:09:44,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 19:09:44,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:44,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:44,824 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 19:09:44,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89430837] [2025-03-16 19:09:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89430837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:44,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 19:09:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302847331] [2025-03-16 19:09:44,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:44,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 19:09:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:44,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 19:09:44,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:09:44,845 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.7741935483870968) internal successors, (110), 63 states have internal predecessors, (110), 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 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19:09:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:44,856 INFO L93 Difference]: Finished difference Result 100 states and 169 transitions. [2025-03-16 19:09:44,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 19:09:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 18 [2025-03-16 19:09:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:44,861 INFO L225 Difference]: With dead ends: 100 [2025-03-16 19:09:44,861 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 19:09:44,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 19:09:44,868 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:44,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 19:09:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-16 19:09:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.7377049180327868) internal successors, (106), 61 states have internal predecessors, (106), 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 19:09:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 106 transitions. [2025-03-16 19:09:44,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 106 transitions. Word has length 18 [2025-03-16 19:09:44,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:44,895 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 106 transitions. [2025-03-16 19:09:44,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 19:09:44,896 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 106 transitions. [2025-03-16 19:09:44,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-16 19:09:44,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:44,896 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:44,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:09:44,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:44,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:44,897 INFO L85 PathProgramCache]: Analyzing trace with hash -770319602, now seen corresponding path program 1 times [2025-03-16 19:09:44,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:44,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142221469] [2025-03-16 19:09:44,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:44,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-16 19:09:44,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-16 19:09:44,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:44,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:45,137 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 19:09:45,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:45,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142221469] [2025-03-16 19:09:45,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142221469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:45,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:45,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:09:45,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719051196] [2025-03-16 19:09:45,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:45,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:09:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:45,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:09:45,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:45,140 INFO L87 Difference]: Start difference. First operand 62 states and 106 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 19:09:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:45,191 INFO L93 Difference]: Finished difference Result 100 states and 165 transitions. [2025-03-16 19:09:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:09:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2025-03-16 19:09:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:45,194 INFO L225 Difference]: With dead ends: 100 [2025-03-16 19:09:45,194 INFO L226 Difference]: Without dead ends: 62 [2025-03-16 19:09:45,194 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 19:09:45,195 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:45,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 288 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-16 19:09:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-16 19:09:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 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 19:09:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-03-16 19:09:45,202 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 18 [2025-03-16 19:09:45,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:45,203 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-03-16 19:09:45,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 19:09:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2025-03-16 19:09:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 19:09:45,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:45,204 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:45,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:09:45,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:45,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:45,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1237210952, now seen corresponding path program 1 times [2025-03-16 19:09:45,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:45,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211216967] [2025-03-16 19:09:45,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:45,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:45,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 19:09:45,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 19:09:45,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:45,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:45,351 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 19:09:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:45,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211216967] [2025-03-16 19:09:45,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211216967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:45,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:45,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236885482] [2025-03-16 19:09:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:45,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:45,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:45,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:45,353 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 19:09:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:45,505 INFO L93 Difference]: Finished difference Result 342 states and 531 transitions. [2025-03-16 19:09:45,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:09:45,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 40 [2025-03-16 19:09:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:45,511 INFO L225 Difference]: With dead ends: 342 [2025-03-16 19:09:45,511 INFO L226 Difference]: Without dead ends: 307 [2025-03-16 19:09:45,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:09:45,512 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 450 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:45,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 851 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:45,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-16 19:09:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 95. [2025-03-16 19:09:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.446808510638298) internal successors, (136), 94 states have internal predecessors, (136), 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 19:09:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 136 transitions. [2025-03-16 19:09:45,531 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 136 transitions. Word has length 40 [2025-03-16 19:09:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:45,531 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 136 transitions. [2025-03-16 19:09:45,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 19:09:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 136 transitions. [2025-03-16 19:09:45,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:09:45,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:45,536 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:45,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:09:45,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:45,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 782355613, now seen corresponding path program 1 times [2025-03-16 19:09:45,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:45,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875023284] [2025-03-16 19:09:45,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:45,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:45,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:09:45,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:09:45,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:45,652 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 19:09:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:45,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875023284] [2025-03-16 19:09:45,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875023284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:45,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:45,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:45,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739230214] [2025-03-16 19:09:45,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:45,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:45,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:45,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:45,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:45,654 INFO L87 Difference]: Start difference. First operand 95 states and 136 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 19:09:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:45,670 INFO L93 Difference]: Finished difference Result 220 states and 335 transitions. [2025-03-16 19:09:45,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2025-03-16 19:09:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:45,672 INFO L225 Difference]: With dead ends: 220 [2025-03-16 19:09:45,672 INFO L226 Difference]: Without dead ends: 152 [2025-03-16 19:09:45,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:45,673 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:45,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 132 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-16 19:09:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2025-03-16 19:09:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 149 states have internal predecessors, (222), 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 19:09:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2025-03-16 19:09:45,684 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 42 [2025-03-16 19:09:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:45,685 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2025-03-16 19:09:45,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 19:09:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2025-03-16 19:09:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 19:09:45,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:45,685 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:45,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:09:45,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:45,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:45,686 INFO L85 PathProgramCache]: Analyzing trace with hash 783398298, now seen corresponding path program 1 times [2025-03-16 19:09:45,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:45,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198743688] [2025-03-16 19:09:45,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:45,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:45,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-16 19:09:45,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 19:09:45,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:45,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:45,902 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 19:09:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:45,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198743688] [2025-03-16 19:09:45,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198743688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:45,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:45,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031265349] [2025-03-16 19:09:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:45,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:45,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:45,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:45,904 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 19:09:46,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,015 INFO L93 Difference]: Finished difference Result 275 states and 418 transitions. [2025-03-16 19:09:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:46,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 42 [2025-03-16 19:09:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,017 INFO L225 Difference]: With dead ends: 275 [2025-03-16 19:09:46,017 INFO L226 Difference]: Without dead ends: 152 [2025-03-16 19:09:46,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:09:46,017 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 287 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-16 19:09:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2025-03-16 19:09:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.476510067114094) internal successors, (220), 149 states have internal predecessors, (220), 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 19:09:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2025-03-16 19:09:46,030 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 42 [2025-03-16 19:09:46,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:46,031 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2025-03-16 19:09:46,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 19:09:46,031 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2025-03-16 19:09:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 19:09:46,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:46,032 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:46,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:09:46,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:46,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:46,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1483471479, now seen corresponding path program 1 times [2025-03-16 19:09:46,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:46,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124372411] [2025-03-16 19:09:46,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:46,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:46,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 19:09:46,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 19:09:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:46,187 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 19:09:46,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:46,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124372411] [2025-03-16 19:09:46,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124372411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:46,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:46,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:09:46,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623343916] [2025-03-16 19:09:46,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:46,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:09:46,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:46,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:09:46,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:09:46,190 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 19:09:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,205 INFO L93 Difference]: Finished difference Result 156 states and 227 transitions. [2025-03-16 19:09:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:09:46,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2025-03-16 19:09:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,206 INFO L225 Difference]: With dead ends: 156 [2025-03-16 19:09:46,207 INFO L226 Difference]: Without dead ends: 154 [2025-03-16 19:09:46,207 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 19:09:46,207 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-16 19:09:46,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-16 19:09:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.457516339869281) internal successors, (223), 153 states have internal predecessors, (223), 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 19:09:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 223 transitions. [2025-03-16 19:09:46,216 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 223 transitions. Word has length 43 [2025-03-16 19:09:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:46,216 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 223 transitions. [2025-03-16 19:09:46,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 19:09:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 223 transitions. [2025-03-16 19:09:46,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:46,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:46,220 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:46,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:09:46,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2069786204, now seen corresponding path program 1 times [2025-03-16 19:09:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170566277] [2025-03-16 19:09:46,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:46,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:46,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:46,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:46,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:46,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:46,260 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 19:09:46,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:46,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170566277] [2025-03-16 19:09:46,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170566277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:46,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:46,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865515502] [2025-03-16 19:09:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:46,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:46,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:46,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,261 INFO L87 Difference]: Start difference. First operand 154 states and 223 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,274 INFO L93 Difference]: Finished difference Result 292 states and 436 transitions. [2025-03-16 19:09:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2025-03-16 19:09:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,277 INFO L225 Difference]: With dead ends: 292 [2025-03-16 19:09:46,277 INFO L226 Difference]: Without dead ends: 220 [2025-03-16 19:09:46,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,278 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 181 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-16 19:09:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-03-16 19:09:46,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.4746543778801844) internal successors, (320), 217 states have internal predecessors, (320), 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 19:09:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 320 transitions. [2025-03-16 19:09:46,303 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 320 transitions. Word has length 44 [2025-03-16 19:09:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:46,303 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 320 transitions. [2025-03-16 19:09:46,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 320 transitions. [2025-03-16 19:09:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:46,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:46,303 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:46,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:09:46,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1401958052, now seen corresponding path program 1 times [2025-03-16 19:09:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444833453] [2025-03-16 19:09:46,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:46,363 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 19:09:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:46,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444833453] [2025-03-16 19:09:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444833453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:46,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:46,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17929153] [2025-03-16 19:09:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:46,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:46,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:46,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,364 INFO L87 Difference]: Start difference. First operand 218 states and 320 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,383 INFO L93 Difference]: Finished difference Result 572 states and 860 transitions. [2025-03-16 19:09:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:46,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2025-03-16 19:09:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,386 INFO L225 Difference]: With dead ends: 572 [2025-03-16 19:09:46,386 INFO L226 Difference]: Without dead ends: 383 [2025-03-16 19:09:46,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,387 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 44 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-16 19:09:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2025-03-16 19:09:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4789473684210526) internal successors, (562), 380 states have internal predecessors, (562), 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 19:09:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 562 transitions. [2025-03-16 19:09:46,402 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 562 transitions. Word has length 44 [2025-03-16 19:09:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:46,402 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 562 transitions. [2025-03-16 19:09:46,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 562 transitions. [2025-03-16 19:09:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:46,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:46,406 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:46,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:09:46,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:46,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1468140452, now seen corresponding path program 1 times [2025-03-16 19:09:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240874411] [2025-03-16 19:09:46,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:46,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:46,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:46,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:46,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:46,450 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 19:09:46,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:46,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240874411] [2025-03-16 19:09:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240874411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:46,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975079569] [2025-03-16 19:09:46,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:46,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,452 INFO L87 Difference]: Start difference. First operand 381 states and 562 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,479 INFO L93 Difference]: Finished difference Result 1037 states and 1544 transitions. [2025-03-16 19:09:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2025-03-16 19:09:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,483 INFO L225 Difference]: With dead ends: 1037 [2025-03-16 19:09:46,483 INFO L226 Difference]: Without dead ends: 685 [2025-03-16 19:09:46,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,484 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 42 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 189 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:46,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-16 19:09:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2025-03-16 19:09:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 682 states have (on average 1.4633431085043989) internal successors, (998), 682 states have internal predecessors, (998), 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 19:09:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 998 transitions. [2025-03-16 19:09:46,513 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 998 transitions. Word has length 44 [2025-03-16 19:09:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:46,513 INFO L471 AbstractCegarLoop]: Abstraction has 683 states and 998 transitions. [2025-03-16 19:09:46,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 998 transitions. [2025-03-16 19:09:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 19:09:46,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:46,515 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:46,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:09:46,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:46,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2017929380, now seen corresponding path program 1 times [2025-03-16 19:09:46,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:46,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999619674] [2025-03-16 19:09:46,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:46,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:46,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 19:09:46,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 19:09:46,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:46,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:46,564 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 19:09:46,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:46,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999619674] [2025-03-16 19:09:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999619674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:46,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:46,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:46,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118632719] [2025-03-16 19:09:46,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:46,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:46,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:46,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:46,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,565 INFO L87 Difference]: Start difference. First operand 683 states and 998 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,591 INFO L93 Difference]: Finished difference Result 1895 states and 2768 transitions. [2025-03-16 19:09:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2025-03-16 19:09:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,596 INFO L225 Difference]: With dead ends: 1895 [2025-03-16 19:09:46,597 INFO L226 Difference]: Without dead ends: 1241 [2025-03-16 19:09:46,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:46,598 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-16 19:09:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-03-16 19:09:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.432956381260097) internal successors, (1774), 1238 states have internal predecessors, (1774), 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 19:09:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1774 transitions. [2025-03-16 19:09:46,648 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1774 transitions. Word has length 44 [2025-03-16 19:09:46,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:46,649 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1774 transitions. [2025-03-16 19:09:46,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 19:09:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1774 transitions. [2025-03-16 19:09:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:46,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:46,650 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:46,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:09:46,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1475985865, now seen corresponding path program 1 times [2025-03-16 19:09:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:46,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252490354] [2025-03-16 19:09:46,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:46,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:46,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:46,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:46,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:46,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252490354] [2025-03-16 19:09:46,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252490354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:46,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:46,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145239534] [2025-03-16 19:09:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:46,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:46,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:46,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:46,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:46,777 INFO L87 Difference]: Start difference. First operand 1239 states and 1774 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 19:09:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:46,943 INFO L93 Difference]: Finished difference Result 6001 states and 8635 transitions. [2025-03-16 19:09:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:46,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 60 [2025-03-16 19:09:46,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:46,959 INFO L225 Difference]: With dead ends: 6001 [2025-03-16 19:09:46,959 INFO L226 Difference]: Without dead ends: 5135 [2025-03-16 19:09:46,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:46,962 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 323 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:46,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 482 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2025-03-16 19:09:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 2279. [2025-03-16 19:09:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2279 states, 2278 states have (on average 1.4284460052677788) internal successors, (3254), 2278 states have internal predecessors, (3254), 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 19:09:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3254 transitions. [2025-03-16 19:09:47,063 INFO L78 Accepts]: Start accepts. Automaton has 2279 states and 3254 transitions. Word has length 60 [2025-03-16 19:09:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:47,064 INFO L471 AbstractCegarLoop]: Abstraction has 2279 states and 3254 transitions. [2025-03-16 19:09:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 19:09:47,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3254 transitions. [2025-03-16 19:09:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:47,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:47,065 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:47,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:09:47,065 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:47,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:47,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1995758391, now seen corresponding path program 1 times [2025-03-16 19:09:47,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:47,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764338383] [2025-03-16 19:09:47,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:47,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:47,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:47,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:47,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:09:47,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764338383] [2025-03-16 19:09:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764338383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:47,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:47,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614229992] [2025-03-16 19:09:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:47,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:47,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:47,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:47,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:47,168 INFO L87 Difference]: Start difference. First operand 2279 states and 3254 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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 19:09:47,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:47,359 INFO L93 Difference]: Finished difference Result 7209 states and 10363 transitions. [2025-03-16 19:09:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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) Word has length 60 [2025-03-16 19:09:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:47,377 INFO L225 Difference]: With dead ends: 7209 [2025-03-16 19:09:47,378 INFO L226 Difference]: Without dead ends: 5999 [2025-03-16 19:09:47,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:47,381 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 323 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:47,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 478 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5999 states. [2025-03-16 19:09:47,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5999 to 3919. [2025-03-16 19:09:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.4247064828994385) internal successors, (5582), 3918 states have internal predecessors, (5582), 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 19:09:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 5582 transitions. [2025-03-16 19:09:47,502 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 5582 transitions. Word has length 60 [2025-03-16 19:09:47,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:47,502 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 5582 transitions. [2025-03-16 19:09:47,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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 19:09:47,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 5582 transitions. [2025-03-16 19:09:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:47,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:47,503 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:09:47,504 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2061940791, now seen corresponding path program 1 times [2025-03-16 19:09:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230795410] [2025-03-16 19:09:47,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:47,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:47,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:47,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:47,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:09:47,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:47,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230795410] [2025-03-16 19:09:47,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230795410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:47,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:47,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:47,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528526095] [2025-03-16 19:09:47,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:47,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:47,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:47,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:47,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:47,596 INFO L87 Difference]: Start difference. First operand 3919 states and 5582 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 19:09:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:47,778 INFO L93 Difference]: Finished difference Result 8417 states and 12083 transitions. [2025-03-16 19:09:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 60 [2025-03-16 19:09:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:47,798 INFO L225 Difference]: With dead ends: 8417 [2025-03-16 19:09:47,798 INFO L226 Difference]: Without dead ends: 7207 [2025-03-16 19:09:47,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:47,802 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 346 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:47,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 448 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:47,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7207 states. [2025-03-16 19:09:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7207 to 5127. [2025-03-16 19:09:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 5126 states have (on average 1.424502536090519) internal successors, (7302), 5126 states have internal predecessors, (7302), 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 19:09:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7302 transitions. [2025-03-16 19:09:47,946 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7302 transitions. Word has length 60 [2025-03-16 19:09:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:47,946 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 7302 transitions. [2025-03-16 19:09:47,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 19:09:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7302 transitions. [2025-03-16 19:09:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 19:09:47,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:47,947 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:47,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:09:47,948 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:47,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:47,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1683237577, now seen corresponding path program 1 times [2025-03-16 19:09:47,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:47,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669520866] [2025-03-16 19:09:47,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:47,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:47,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 19:09:47,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 19:09:47,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:47,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,032 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:09:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669520866] [2025-03-16 19:09:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669520866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:48,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:09:48,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414156022] [2025-03-16 19:09:48,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:48,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:09:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:48,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:09:48,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:09:48,033 INFO L87 Difference]: Start difference. First operand 5127 states and 7302 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 19:09:48,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:48,233 INFO L93 Difference]: Finished difference Result 9625 states and 13803 transitions. [2025-03-16 19:09:48,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:09:48,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 60 [2025-03-16 19:09:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:48,255 INFO L225 Difference]: With dead ends: 9625 [2025-03-16 19:09:48,255 INFO L226 Difference]: Without dead ends: 8415 [2025-03-16 19:09:48,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:09:48,258 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 335 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:48,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 477 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:09:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8415 states. [2025-03-16 19:09:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8415 to 6335. [2025-03-16 19:09:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 6334 states have (on average 1.4243763814335333) internal successors, (9022), 6334 states have internal predecessors, (9022), 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 19:09:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 9022 transitions. [2025-03-16 19:09:48,409 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 9022 transitions. Word has length 60 [2025-03-16 19:09:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:48,410 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 9022 transitions. [2025-03-16 19:09:48,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 19:09:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 9022 transitions. [2025-03-16 19:09:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-16 19:09:48,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:48,411 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:09:48,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:48,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash 74907570, now seen corresponding path program 1 times [2025-03-16 19:09:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483383388] [2025-03-16 19:09:48,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-16 19:09:48,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-16 19:09:48,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:48,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:48,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:48,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483383388] [2025-03-16 19:09:48,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483383388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:48,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:48,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:48,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120543257] [2025-03-16 19:09:48,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:48,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:48,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:48,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:48,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:48,474 INFO L87 Difference]: Start difference. First operand 6335 states and 9022 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 19:09:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:48,595 INFO L93 Difference]: Finished difference Result 12643 states and 18016 transitions. [2025-03-16 19:09:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2025-03-16 19:09:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:48,606 INFO L225 Difference]: With dead ends: 12643 [2025-03-16 19:09:48,606 INFO L226 Difference]: Without dead ends: 6337 [2025-03-16 19:09:48,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:48,615 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:48,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 181 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2025-03-16 19:09:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 6335. [2025-03-16 19:09:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6335 states, 6334 states have (on average 1.4047994947900222) internal successors, (8898), 6334 states have internal predecessors, (8898), 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 19:09:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6335 states to 6335 states and 8898 transitions. [2025-03-16 19:09:48,799 INFO L78 Accepts]: Start accepts. Automaton has 6335 states and 8898 transitions. Word has length 61 [2025-03-16 19:09:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 6335 states and 8898 transitions. [2025-03-16 19:09:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 19:09:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6335 states and 8898 transitions. [2025-03-16 19:09:48,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 19:09:48,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:48,801 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:48,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:09:48,801 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:48,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:48,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1963749739, now seen corresponding path program 1 times [2025-03-16 19:09:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:48,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271547600] [2025-03-16 19:09:48,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:48,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:48,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 19:09:48,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 19:09:48,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:48,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:48,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:48,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271547600] [2025-03-16 19:09:48,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271547600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:48,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:48,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:48,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058115248] [2025-03-16 19:09:48,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:48,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:48,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:48,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:48,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:48,862 INFO L87 Difference]: Start difference. First operand 6335 states and 8898 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:09:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:48,900 INFO L93 Difference]: Finished difference Result 8731 states and 12305 transitions. [2025-03-16 19:09:48,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:48,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-03-16 19:09:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:48,904 INFO L225 Difference]: With dead ends: 8731 [2025-03-16 19:09:48,904 INFO L226 Difference]: Without dead ends: 2425 [2025-03-16 19:09:48,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:48,909 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:48,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:48,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2025-03-16 19:09:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2418. [2025-03-16 19:09:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2417 states have (on average 1.4004964832436906) internal successors, (3385), 2417 states have internal predecessors, (3385), 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 19:09:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3385 transitions. [2025-03-16 19:09:48,974 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3385 transitions. Word has length 62 [2025-03-16 19:09:48,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:48,974 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3385 transitions. [2025-03-16 19:09:48,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 19:09:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3385 transitions. [2025-03-16 19:09:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-16 19:09:48,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:48,975 INFO L218 NwaCegarLoop]: trace histogram [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, 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 19:09:48,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:09:48,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:48,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -899553077, now seen corresponding path program 1 times [2025-03-16 19:09:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:48,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868864367] [2025-03-16 19:09:48,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:48,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-16 19:09:48,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-16 19:09:48,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:48,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868864367] [2025-03-16 19:09:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868864367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368791796] [2025-03-16 19:09:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:49,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:49,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:49,031 INFO L87 Difference]: Start difference. First operand 2418 states and 3385 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 19:09:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:49,051 INFO L93 Difference]: Finished difference Result 3610 states and 5059 transitions. [2025-03-16 19:09:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2025-03-16 19:09:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:49,054 INFO L225 Difference]: With dead ends: 3610 [2025-03-16 19:09:49,054 INFO L226 Difference]: Without dead ends: 1232 [2025-03-16 19:09:49,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:49,056 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:49,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-03-16 19:09:49,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1230. [2025-03-16 19:09:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1229 states have (on average 1.3759153783563873) internal successors, (1691), 1229 states have internal predecessors, (1691), 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 19:09:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1691 transitions. [2025-03-16 19:09:49,077 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1691 transitions. Word has length 63 [2025-03-16 19:09:49,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:49,077 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1691 transitions. [2025-03-16 19:09:49,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 19:09:49,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1691 transitions. [2025-03-16 19:09:49,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 19:09:49,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:49,078 INFO L218 NwaCegarLoop]: trace histogram [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, 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 19:09:49,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:09:49,079 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:49,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1681800420, now seen corresponding path program 1 times [2025-03-16 19:09:49,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:49,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107992629] [2025-03-16 19:09:49,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:49,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:49,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 19:09:49,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 19:09:49,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:49,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:49,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107992629] [2025-03-16 19:09:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107992629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:09:49,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:09:49,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:09:49,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153401492] [2025-03-16 19:09:49,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:09:49,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:09:49,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:49,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:09:49,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:49,148 INFO L87 Difference]: Start difference. First operand 1230 states and 1691 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 19:09:49,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:49,165 INFO L93 Difference]: Finished difference Result 1828 states and 2518 transitions. [2025-03-16 19:09:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:09:49,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 65 [2025-03-16 19:09:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:49,166 INFO L225 Difference]: With dead ends: 1828 [2025-03-16 19:09:49,166 INFO L226 Difference]: Without dead ends: 638 [2025-03-16 19:09:49,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:09:49,168 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 30 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:49,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:09:49,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-16 19:09:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2025-03-16 19:09:49,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.3464566929133859) internal successors, (855), 635 states have internal predecessors, (855), 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 19:09:49,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 855 transitions. [2025-03-16 19:09:49,179 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 855 transitions. Word has length 65 [2025-03-16 19:09:49,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:49,179 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 855 transitions. [2025-03-16 19:09:49,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 19:09:49,179 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 855 transitions. [2025-03-16 19:09:49,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-16 19:09:49,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:49,180 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1] [2025-03-16 19:09:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:09:49,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:49,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:49,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1934593021, now seen corresponding path program 1 times [2025-03-16 19:09:49,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:49,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812981158] [2025-03-16 19:09:49,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:49,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:09:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:09:49,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:49,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812981158] [2025-03-16 19:09:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812981158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982339016] [2025-03-16 19:09:49,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:49,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:49,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:49,496 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 19:09:49,498 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 19:09:49,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-16 19:09:49,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-16 19:09:49,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:49,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:49,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:49,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:49,764 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:09:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982339016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:49,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 14 [2025-03-16 19:09:49,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405316704] [2025-03-16 19:09:49,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:49,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 19:09:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:49,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 19:09:49,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:09:49,938 INFO L87 Difference]: Start difference. First operand 636 states and 855 transitions. Second operand has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 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 19:09:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:50,929 INFO L93 Difference]: Finished difference Result 4377 states and 5861 transitions. [2025-03-16 19:09:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 19:09:50,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 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 67 [2025-03-16 19:09:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:50,934 INFO L225 Difference]: With dead ends: 4377 [2025-03-16 19:09:50,934 INFO L226 Difference]: Without dead ends: 3781 [2025-03-16 19:09:50,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=344, Invalid=1296, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 19:09:50,936 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 1187 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:50,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 651 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:09:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2025-03-16 19:09:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3653. [2025-03-16 19:09:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3653 states, 3652 states have (on average 1.2858707557502738) internal successors, (4696), 3652 states have internal predecessors, (4696), 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 19:09:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3653 states to 3653 states and 4696 transitions. [2025-03-16 19:09:51,019 INFO L78 Accepts]: Start accepts. Automaton has 3653 states and 4696 transitions. Word has length 67 [2025-03-16 19:09:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 3653 states and 4696 transitions. [2025-03-16 19:09:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.428571428571429) internal successors, (188), 14 states have internal predecessors, (188), 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 19:09:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3653 states and 4696 transitions. [2025-03-16 19:09:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 19:09:51,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:51,019 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:51,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:09:51,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:51,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 678315771, now seen corresponding path program 1 times [2025-03-16 19:09:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780590115] [2025-03-16 19:09:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:51,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:09:51,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:09:51,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:51,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780590115] [2025-03-16 19:09:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780590115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468445558] [2025-03-16 19:09:51,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:51,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:51,455 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 19:09:51,456 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 19:09:51,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 19:09:51,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 19:09:51,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:51,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:51,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:51,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:51,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468445558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:52,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:09:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59382988] [2025-03-16 19:09:52,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:52,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:09:52,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:52,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:09:52,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:09:52,566 INFO L87 Difference]: Start difference. First operand 3653 states and 4696 transitions. Second operand has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 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 19:09:53,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:53,992 INFO L93 Difference]: Finished difference Result 18421 states and 23848 transitions. [2025-03-16 19:09:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 19:09:53,993 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 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 68 [2025-03-16 19:09:53,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:54,014 INFO L225 Difference]: With dead ends: 18421 [2025-03-16 19:09:54,014 INFO L226 Difference]: Without dead ends: 14935 [2025-03-16 19:09:54,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=515, Invalid=2241, Unknown=0, NotChecked=0, Total=2756 [2025-03-16 19:09:54,019 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 1079 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:54,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 772 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:09:54,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14935 states. [2025-03-16 19:09:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14935 to 14675. [2025-03-16 19:09:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14675 states, 14674 states have (on average 1.249625187406297) internal successors, (18337), 14674 states have internal predecessors, (18337), 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 19:09:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14675 states to 14675 states and 18337 transitions. [2025-03-16 19:09:54,333 INFO L78 Accepts]: Start accepts. Automaton has 14675 states and 18337 transitions. Word has length 68 [2025-03-16 19:09:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 14675 states and 18337 transitions. [2025-03-16 19:09:54,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.347826086956522) internal successors, (192), 22 states have internal predecessors, (192), 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 19:09:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14675 states and 18337 transitions. [2025-03-16 19:09:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 19:09:54,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:54,334 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:54,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 19:09:54,538 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,SelfDestructingSolverStorable19 [2025-03-16 19:09:54,538 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:54,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1924627976, now seen corresponding path program 1 times [2025-03-16 19:09:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:54,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789068545] [2025-03-16 19:09:54,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:54,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:09:54,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:09:54,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:54,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789068545] [2025-03-16 19:09:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789068545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037903351] [2025-03-16 19:09:54,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:54,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:54,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:54,758 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 19:09:54,760 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 19:09:54,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 19:09:54,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 19:09:54,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:54,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:54,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:09:54,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:55,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:09:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037903351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:09:55,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:09:55,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-16 19:09:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339667860] [2025-03-16 19:09:55,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:09:55,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 19:09:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:09:55,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 19:09:55,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:09:55,533 INFO L87 Difference]: Start difference. First operand 14675 states and 18337 transitions. Second operand has 20 states, 20 states have (on average 7.45) internal successors, (149), 19 states have internal predecessors, (149), 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 19:09:56,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:09:56,357 INFO L93 Difference]: Finished difference Result 42948 states and 54077 transitions. [2025-03-16 19:09:56,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:09:56,357 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 7.45) internal successors, (149), 19 states have internal predecessors, (149), 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 69 [2025-03-16 19:09:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:09:56,405 INFO L225 Difference]: With dead ends: 42948 [2025-03-16 19:09:56,405 INFO L226 Difference]: Without dead ends: 30023 [2025-03-16 19:09:56,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=674, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:09:56,421 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 698 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:09:56,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 545 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:09:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30023 states. [2025-03-16 19:09:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30023 to 29565. [2025-03-16 19:09:56,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29565 states, 29564 states have (on average 1.2349140846976052) internal successors, (36509), 29564 states have internal predecessors, (36509), 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 19:09:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29565 states to 29565 states and 36509 transitions. [2025-03-16 19:09:57,093 INFO L78 Accepts]: Start accepts. Automaton has 29565 states and 36509 transitions. Word has length 69 [2025-03-16 19:09:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:09:57,093 INFO L471 AbstractCegarLoop]: Abstraction has 29565 states and 36509 transitions. [2025-03-16 19:09:57,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.45) internal successors, (149), 19 states have internal predecessors, (149), 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 19:09:57,093 INFO L276 IsEmpty]: Start isEmpty. Operand 29565 states and 36509 transitions. [2025-03-16 19:09:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:09:57,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:09:57,094 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:09:57,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:09:57,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:57,295 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:09:57,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:09:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -677512683, now seen corresponding path program 1 times [2025-03-16 19:09:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:09:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787080341] [2025-03-16 19:09:57,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:09:57,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:57,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:57,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:57,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:57,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:09:57,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787080341] [2025-03-16 19:09:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787080341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:09:57,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842829695] [2025-03-16 19:09:57,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:09:57,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:09:57,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:09:57,939 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 19:09:57,940 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 19:09:57,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:09:58,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:09:58,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:09:58,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:09:58,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 19:09:58,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:09:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:09:59,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842829695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:00,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:00,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 36 [2025-03-16 19:10:00,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220556542] [2025-03-16 19:10:00,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:00,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 19:10:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:00,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 19:10:00,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 19:10:00,083 INFO L87 Difference]: Start difference. First operand 29565 states and 36509 transitions. Second operand has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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 19:10:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:10:05,981 INFO L93 Difference]: Finished difference Result 92299 states and 115653 transitions. [2025-03-16 19:10:05,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-03-16 19:10:05,982 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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 70 [2025-03-16 19:10:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:10:06,076 INFO L225 Difference]: With dead ends: 92299 [2025-03-16 19:10:06,076 INFO L226 Difference]: Without dead ends: 82056 [2025-03-16 19:10:06,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2944 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1691, Invalid=7815, Unknown=0, NotChecked=0, Total=9506 [2025-03-16 19:10:06,095 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 2847 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2847 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:10:06,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2847 Valid, 1954 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:10:06,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82056 states. [2025-03-16 19:10:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82056 to 26646. [2025-03-16 19:10:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26646 states, 26645 states have (on average 1.2318258585100395) internal successors, (32822), 26645 states have internal predecessors, (32822), 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 19:10:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26646 states to 26646 states and 32822 transitions. [2025-03-16 19:10:07,092 INFO L78 Accepts]: Start accepts. Automaton has 26646 states and 32822 transitions. Word has length 70 [2025-03-16 19:10:07,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:10:07,092 INFO L471 AbstractCegarLoop]: Abstraction has 26646 states and 32822 transitions. [2025-03-16 19:10:07,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.0) internal successors, (180), 36 states have internal predecessors, (180), 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 19:10:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 26646 states and 32822 transitions. [2025-03-16 19:10:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:10:07,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:10:07,093 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:10:07,101 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 19:10:07,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:07,294 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:10:07,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:10:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2069883659, now seen corresponding path program 1 times [2025-03-16 19:10:07,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:10:07,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620966656] [2025-03-16 19:10:07,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:10:07,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:10:07,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:10:07,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:07,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:08,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:08,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:10:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620966656] [2025-03-16 19:10:08,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620966656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:10:08,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920725059] [2025-03-16 19:10:08,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:10:08,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:10:08,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:10:08,957 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 19:10:08,959 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 19:10:09,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:10:09,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:10:09,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:10:09,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:10:09,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-16 19:10:09,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:10:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:11,915 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:10:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:10:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920725059] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:10:15,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:10:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26, 27] total 74 [2025-03-16 19:10:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228128451] [2025-03-16 19:10:15,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:10:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-16 19:10:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:10:15,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-16 19:10:15,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=4767, Unknown=0, NotChecked=0, Total=5402 [2025-03-16 19:10:15,655 INFO L87 Difference]: Start difference. First operand 26646 states and 32822 transitions. Second operand has 74 states, 74 states have (on average 2.675675675675676) internal successors, (198), 74 states have internal predecessors, (198), 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)