./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7f53cc5681a5a08e9c1e07ab3be30428c8fa3fd345275d441a7b8c6544c83a42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:07:43,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:07:43,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:07:43,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:07:43,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:07:43,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:07:43,802 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:07:43,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:07:43,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:07:43,803 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:07:43,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:07:43,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:07:43,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:07:43,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:07:43,805 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:07:43,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:07:43,805 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:07:43,806 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:07:43,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:43,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:07:43,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:07:43,807 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:07:43,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:07:43,807 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:07:43,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:07:43,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:07:43,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:07:43,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:07:43,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:07:43,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f53cc5681a5a08e9c1e07ab3be30428c8fa3fd345275d441a7b8c6544c83a42 [2025-03-16 21:07:44,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:07:44,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:07:44,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:07:44,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:07:44,054 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:07:44,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c [2025-03-16 21:07:45,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0b7182/3a1c93e8938f48e5a525edd568ad3dee/FLAG1c71f3cc6 [2025-03-16 21:07:45,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:07:45,581 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c [2025-03-16 21:07:45,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0b7182/3a1c93e8938f48e5a525edd568ad3dee/FLAG1c71f3cc6 [2025-03-16 21:07:45,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2a0b7182/3a1c93e8938f48e5a525edd568ad3dee [2025-03-16 21:07:45,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:07:45,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:07:45,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:45,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:07:45,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:07:45,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f28a534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:45, skipping insertion in model container [2025-03-16 21:07:45,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:45" (1/1) ... [2025-03-16 21:07:45,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:07:45,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c[1245,1258] [2025-03-16 21:07:46,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:46,029 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:07:46,035 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal10.c[1245,1258] [2025-03-16 21:07:46,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:46,178 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:07:46,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46 WrapperNode [2025-03-16 21:07:46,179 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:46,180 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:46,180 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:07:46,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:07:46,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,532 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3643 [2025-03-16 21:07:46,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:46,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:07:46,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:07:46,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:07:46,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,718 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:07:46,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:07:46,939 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:07:46,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:07:46,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:07:46,940 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (1/1) ... [2025-03-16 21:07:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:46,992 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 21:07:47,003 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 21:07:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:07:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:07:47,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 21:07:47,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:07:47,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:07:47,334 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:07:47,335 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:07:50,358 INFO L? ?]: Removed 2042 outVars from TransFormulas that were not future-live. [2025-03-16 21:07:50,358 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:07:50,549 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:07:50,553 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:07:50,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:50 BoogieIcfgContainer [2025-03-16 21:07:50,556 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:07:50,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:07:50,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:07:50,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:07:50,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:07:45" (1/3) ... [2025-03-16 21:07:50,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f334be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:50, skipping insertion in model container [2025-03-16 21:07:50,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:46" (2/3) ... [2025-03-16 21:07:50,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f334be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:50, skipping insertion in model container [2025-03-16 21:07:50,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:50" (3/3) ... [2025-03-16 21:07:50,586 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal10.c [2025-03-16 21:07:50,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:07:50,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal10.c that has 1 procedures, 1087 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:07:50,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:07:50,715 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;@7fa7907a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:07:50,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:07:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand has 1087 states, 1085 states have (on average 1.5013824884792626) internal successors, (1629), 1086 states have internal predecessors, (1629), 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 21:07:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 21:07:50,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:50,742 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:50,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:50,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:50,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1203387889, now seen corresponding path program 1 times [2025-03-16 21:07:50,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:50,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499925422] [2025-03-16 21:07:50,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:50,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:50,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 21:07:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 21:07:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:52,907 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 21:07:52,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:52,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499925422] [2025-03-16 21:07:52,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499925422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:52,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:52,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508583427] [2025-03-16 21:07:52,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:52,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:52,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:52,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:52,938 INFO L87 Difference]: Start difference. First operand has 1087 states, 1085 states have (on average 1.5013824884792626) internal successors, (1629), 1086 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 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 21:07:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:53,454 INFO L93 Difference]: Finished difference Result 2145 states and 3217 transitions. [2025-03-16 21:07:53,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 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 346 [2025-03-16 21:07:53,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:53,472 INFO L225 Difference]: With dead ends: 2145 [2025-03-16 21:07:53,474 INFO L226 Difference]: Without dead ends: 1087 [2025-03-16 21:07:53,480 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 21:07:53,483 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 0 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4060 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:53,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4060 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:07:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2025-03-16 21:07:53,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2025-03-16 21:07:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 1086 states have (on average 1.4990791896869244) internal successors, (1628), 1086 states have internal predecessors, (1628), 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 21:07:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1628 transitions. [2025-03-16 21:07:53,560 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1628 transitions. Word has length 346 [2025-03-16 21:07:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:53,561 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1628 transitions. [2025-03-16 21:07:53,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 4 states have internal predecessors, (346), 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 21:07:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1628 transitions. [2025-03-16 21:07:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-16 21:07:53,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:53,568 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:53,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:07:53,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:53,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1345001276, now seen corresponding path program 1 times [2025-03-16 21:07:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:53,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291317445] [2025-03-16 21:07:53,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:53,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:53,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 21:07:53,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 21:07:53,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:53,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:54,581 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 21:07:54,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:54,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291317445] [2025-03-16 21:07:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291317445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:54,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:54,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:54,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406764956] [2025-03-16 21:07:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:54,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:54,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:54,590 INFO L87 Difference]: Start difference. First operand 1087 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 21:07:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:55,079 INFO L93 Difference]: Finished difference Result 2147 states and 3216 transitions. [2025-03-16 21:07:55,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:55,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 347 [2025-03-16 21:07:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:55,085 INFO L225 Difference]: With dead ends: 2147 [2025-03-16 21:07:55,085 INFO L226 Difference]: Without dead ends: 1089 [2025-03-16 21:07:55,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:55,087 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 0 mSDsluCounter, 2702 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4057 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:55,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4057 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:07:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-16 21:07:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2025-03-16 21:07:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 1.4981617647058822) internal successors, (1630), 1088 states have internal predecessors, (1630), 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 21:07:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1630 transitions. [2025-03-16 21:07:55,106 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1630 transitions. Word has length 347 [2025-03-16 21:07:55,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:55,107 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1630 transitions. [2025-03-16 21:07:55,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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 21:07:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1630 transitions. [2025-03-16 21:07:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 21:07:55,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:55,110 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:55,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:07:55,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:55,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:55,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1108823988, now seen corresponding path program 1 times [2025-03-16 21:07:55,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565901268] [2025-03-16 21:07:55,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:55,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:07:56,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:07:56,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:57,169 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 21:07:57,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:57,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565901268] [2025-03-16 21:07:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565901268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:57,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994696779] [2025-03-16 21:07:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:57,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:57,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:57,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:57,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:57,172 INFO L87 Difference]: Start difference. First operand 1089 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 21:07:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:57,657 INFO L93 Difference]: Finished difference Result 2149 states and 3217 transitions. [2025-03-16 21:07:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:57,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 348 [2025-03-16 21:07:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:57,662 INFO L225 Difference]: With dead ends: 2149 [2025-03-16 21:07:57,663 INFO L226 Difference]: Without dead ends: 1089 [2025-03-16 21:07:57,664 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 21:07:57,665 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 6 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4049 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:57,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4049 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:07:57,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-03-16 21:07:57,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1089. [2025-03-16 21:07:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 1.4972426470588236) internal successors, (1629), 1088 states have internal predecessors, (1629), 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 21:07:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1629 transitions. [2025-03-16 21:07:57,685 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1629 transitions. Word has length 348 [2025-03-16 21:07:57,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:57,685 INFO L471 AbstractCegarLoop]: Abstraction has 1089 states and 1629 transitions. [2025-03-16 21:07:57,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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 21:07:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1629 transitions. [2025-03-16 21:07:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 21:07:57,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:57,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:07:57,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:07:57,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:57,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:57,690 INFO L85 PathProgramCache]: Analyzing trace with hash 202741740, now seen corresponding path program 1 times [2025-03-16 21:07:57,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:57,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448600801] [2025-03-16 21:07:57,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:57,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 21:07:59,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 21:07:59,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:59,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:00,618 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 21:08:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:00,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448600801] [2025-03-16 21:08:00,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448600801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:00,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:00,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928567563] [2025-03-16 21:08:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:00,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:08:00,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:00,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:08:00,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:08:00,623 INFO L87 Difference]: Start difference. First operand 1089 states and 1629 transitions. Second operand has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 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 21:08:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:01,457 INFO L93 Difference]: Finished difference Result 2817 states and 4213 transitions. [2025-03-16 21:08:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:08:01,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 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 349 [2025-03-16 21:08:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:01,464 INFO L225 Difference]: With dead ends: 2817 [2025-03-16 21:08:01,464 INFO L226 Difference]: Without dead ends: 1757 [2025-03-16 21:08:01,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:08:01,467 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 4198 mSDsluCounter, 4005 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4198 SdHoareTripleChecker+Valid, 5340 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:01,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4198 Valid, 5340 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:08:01,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-03-16 21:08:01,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1738. [2025-03-16 21:08:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.4979850316637882) internal successors, (2602), 1737 states have internal predecessors, (2602), 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 21:08:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2602 transitions. [2025-03-16 21:08:01,511 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2602 transitions. Word has length 349 [2025-03-16 21:08:01,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:01,511 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2602 transitions. [2025-03-16 21:08:01,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.166666666666664) internal successors, (349), 5 states have internal predecessors, (349), 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 21:08:01,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2602 transitions. [2025-03-16 21:08:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 21:08:01,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:01,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:08:01,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash -416577463, now seen corresponding path program 1 times [2025-03-16 21:08:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260051435] [2025-03-16 21:08:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:01,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:01,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 21:08:02,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 21:08:02,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:02,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:04,023 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 21:08:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260051435] [2025-03-16 21:08:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260051435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:08:04,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544518643] [2025-03-16 21:08:04,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:08:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:04,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:08:04,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:04,026 INFO L87 Difference]: Start difference. First operand 1738 states and 2602 transitions. Second operand has 7 states, 7 states have (on average 50.0) internal successors, (350), 6 states have internal predecessors, (350), 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 21:08:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:04,897 INFO L93 Difference]: Finished difference Result 4345 states and 6502 transitions. [2025-03-16 21:08:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:04,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 6 states have internal predecessors, (350), 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 350 [2025-03-16 21:08:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:04,907 INFO L225 Difference]: With dead ends: 4345 [2025-03-16 21:08:04,908 INFO L226 Difference]: Without dead ends: 3191 [2025-03-16 21:08:04,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:04,912 INFO L435 NwaCegarLoop]: 1707 mSDtfsCounter, 3283 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3283 SdHoareTripleChecker+Valid, 8150 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:04,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3283 Valid, 8150 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:08:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3191 states. [2025-03-16 21:08:04,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3191 to 2796. [2025-03-16 21:08:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2795 states have (on average 1.4991055456171736) internal successors, (4190), 2795 states have internal predecessors, (4190), 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 21:08:04,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 4190 transitions. [2025-03-16 21:08:04,976 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 4190 transitions. Word has length 350 [2025-03-16 21:08:04,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:04,977 INFO L471 AbstractCegarLoop]: Abstraction has 2796 states and 4190 transitions. [2025-03-16 21:08:04,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.0) internal successors, (350), 6 states have internal predecessors, (350), 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 21:08:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 4190 transitions. [2025-03-16 21:08:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 21:08:04,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:04,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:04,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:08:04,982 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:04,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:04,983 INFO L85 PathProgramCache]: Analyzing trace with hash 980012728, now seen corresponding path program 1 times [2025-03-16 21:08:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316288215] [2025-03-16 21:08:04,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:04,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:05,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 21:08:05,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 21:08:05,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:05,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:06,904 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 21:08:06,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316288215] [2025-03-16 21:08:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316288215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:06,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995218669] [2025-03-16 21:08:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:06,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:08:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:06,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:08:06,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:08:06,908 INFO L87 Difference]: Start difference. First operand 2796 states and 4190 transitions. Second operand has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 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 21:08:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:08,353 INFO L93 Difference]: Finished difference Result 8986 states and 13471 transitions. [2025-03-16 21:08:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:08:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 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 351 [2025-03-16 21:08:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:08,367 INFO L225 Difference]: With dead ends: 8986 [2025-03-16 21:08:08,367 INFO L226 Difference]: Without dead ends: 4668 [2025-03-16 21:08:08,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:08:08,375 INFO L435 NwaCegarLoop]: 1844 mSDtfsCounter, 5553 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5553 SdHoareTripleChecker+Valid, 10471 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:08,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5553 Valid, 10471 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2510 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 21:08:08,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2025-03-16 21:08:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4560. [2025-03-16 21:08:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4560 states, 4559 states have (on average 1.4998903268260584) internal successors, (6838), 4559 states have internal predecessors, (6838), 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 21:08:08,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4560 states to 4560 states and 6838 transitions. [2025-03-16 21:08:08,450 INFO L78 Accepts]: Start accepts. Automaton has 4560 states and 6838 transitions. Word has length 351 [2025-03-16 21:08:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:08,450 INFO L471 AbstractCegarLoop]: Abstraction has 4560 states and 6838 transitions. [2025-03-16 21:08:08,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 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 21:08:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 4560 states and 6838 transitions. [2025-03-16 21:08:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 21:08:08,455 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:08,455 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:08,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:08:08,456 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:08,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1554580319, now seen corresponding path program 1 times [2025-03-16 21:08:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071458921] [2025-03-16 21:08:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:08,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:08:09,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:08:09,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:09,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:10,402 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 21:08:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:10,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071458921] [2025-03-16 21:08:10,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071458921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:10,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:10,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970777527] [2025-03-16 21:08:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:10,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:08:10,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:10,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:08:10,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:08:10,406 INFO L87 Difference]: Start difference. First operand 4560 states and 6838 transitions. Second operand has 8 states, 8 states have (on average 44.0) internal successors, (352), 7 states have internal predecessors, (352), 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 21:08:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:11,421 INFO L93 Difference]: Finished difference Result 7052 states and 10569 transitions. [2025-03-16 21:08:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 7 states have internal predecessors, (352), 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 352 [2025-03-16 21:08:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:11,434 INFO L225 Difference]: With dead ends: 7052 [2025-03-16 21:08:11,434 INFO L226 Difference]: Without dead ends: 4581 [2025-03-16 21:08:11,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:08:11,439 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 4199 mSDsluCounter, 6665 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4199 SdHoareTripleChecker+Valid, 7999 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:11,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4199 Valid, 7999 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:08:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2025-03-16 21:08:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4563. [2025-03-16 21:08:11,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4563 states, 4562 states have (on average 1.4997807978956599) internal successors, (6842), 4562 states have internal predecessors, (6842), 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 21:08:11,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4563 states to 4563 states and 6842 transitions. [2025-03-16 21:08:11,532 INFO L78 Accepts]: Start accepts. Automaton has 4563 states and 6842 transitions. Word has length 352 [2025-03-16 21:08:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:11,533 INFO L471 AbstractCegarLoop]: Abstraction has 4563 states and 6842 transitions. [2025-03-16 21:08:11,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.0) internal successors, (352), 7 states have internal predecessors, (352), 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 21:08:11,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4563 states and 6842 transitions. [2025-03-16 21:08:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 21:08:11,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:11,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:11,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:08:11,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:11,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 351665155, now seen corresponding path program 1 times [2025-03-16 21:08:11,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:11,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116984998] [2025-03-16 21:08:11,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:11,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 21:08:12,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 21:08:12,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:12,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:13,499 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 21:08:13,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116984998] [2025-03-16 21:08:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116984998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472013480] [2025-03-16 21:08:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:13,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:08:13,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:13,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:08:13,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:08:13,501 INFO L87 Difference]: Start difference. First operand 4563 states and 6842 transitions. Second operand has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 5 states have internal predecessors, (353), 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 21:08:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:14,364 INFO L93 Difference]: Finished difference Result 9404 states and 14098 transitions. [2025-03-16 21:08:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:14,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 5 states have internal predecessors, (353), 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 353 [2025-03-16 21:08:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:14,375 INFO L225 Difference]: With dead ends: 9404 [2025-03-16 21:08:14,375 INFO L226 Difference]: Without dead ends: 4571 [2025-03-16 21:08:14,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:14,381 INFO L435 NwaCegarLoop]: 2033 mSDtfsCounter, 3334 mSDsluCounter, 5269 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3334 SdHoareTripleChecker+Valid, 7302 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:14,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3334 Valid, 7302 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:08:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4571 states. [2025-03-16 21:08:14,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4571 to 4567. [2025-03-16 21:08:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4567 states, 4566 states have (on average 1.4993429697766096) internal successors, (6846), 4566 states have internal predecessors, (6846), 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 21:08:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4567 states to 4567 states and 6846 transitions. [2025-03-16 21:08:14,434 INFO L78 Accepts]: Start accepts. Automaton has 4567 states and 6846 transitions. Word has length 353 [2025-03-16 21:08:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:14,435 INFO L471 AbstractCegarLoop]: Abstraction has 4567 states and 6846 transitions. [2025-03-16 21:08:14,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.833333333333336) internal successors, (353), 5 states have internal predecessors, (353), 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 21:08:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4567 states and 6846 transitions. [2025-03-16 21:08:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 21:08:14,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:14,440 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:14,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:08:14,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1340911626, now seen corresponding path program 1 times [2025-03-16 21:08:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691969150] [2025-03-16 21:08:14,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:14,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 21:08:14,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 21:08:14,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:15,173 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 21:08:15,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:15,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691969150] [2025-03-16 21:08:15,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691969150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:15,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365237072] [2025-03-16 21:08:15,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:15,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:15,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:15,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:15,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:15,176 INFO L87 Difference]: Start difference. First operand 4567 states and 6846 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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 21:08:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:15,737 INFO L93 Difference]: Finished difference Result 7077 states and 10604 transitions. [2025-03-16 21:08:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:15,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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 354 [2025-03-16 21:08:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:15,757 INFO L225 Difference]: With dead ends: 7077 [2025-03-16 21:08:15,757 INFO L226 Difference]: Without dead ends: 4575 [2025-03-16 21:08:15,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:15,761 INFO L435 NwaCegarLoop]: 1209 mSDtfsCounter, 1625 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:15,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 3623 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:08:15,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2025-03-16 21:08:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4573. [2025-03-16 21:08:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 4572 states have (on average 1.4986876640419948) internal successors, (6852), 4572 states have internal predecessors, (6852), 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 21:08:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6852 transitions. [2025-03-16 21:08:15,823 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6852 transitions. Word has length 354 [2025-03-16 21:08:15,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 4573 states and 6852 transitions. [2025-03-16 21:08:15,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 5 states have internal predecessors, (354), 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 21:08:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6852 transitions. [2025-03-16 21:08:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 21:08:15,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:15,828 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:15,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:08:15,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -99858683, now seen corresponding path program 1 times [2025-03-16 21:08:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735437071] [2025-03-16 21:08:15,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:15,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 21:08:16,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 21:08:16,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:16,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:17,282 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 21:08:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735437071] [2025-03-16 21:08:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735437071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:17,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347080696] [2025-03-16 21:08:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:17,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:08:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:17,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:08:17,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:17,284 INFO L87 Difference]: Start difference. First operand 4573 states and 6852 transitions. Second operand has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 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 21:08:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:18,302 INFO L93 Difference]: Finished difference Result 7082 states and 10609 transitions. [2025-03-16 21:08:18,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:18,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 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 354 [2025-03-16 21:08:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:18,310 INFO L225 Difference]: With dead ends: 7082 [2025-03-16 21:08:18,310 INFO L226 Difference]: Without dead ends: 4581 [2025-03-16 21:08:18,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:18,313 INFO L435 NwaCegarLoop]: 1103 mSDtfsCounter, 1328 mSDsluCounter, 4399 mSDsCounter, 0 mSdLazyCounter, 2613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 5502 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:18,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 5502 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2613 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:08:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2025-03-16 21:08:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4577. [2025-03-16 21:08:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 4576 states have (on average 1.4982517482517483) internal successors, (6856), 4576 states have internal predecessors, (6856), 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 21:08:18,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6856 transitions. [2025-03-16 21:08:18,367 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6856 transitions. Word has length 354 [2025-03-16 21:08:18,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:18,367 INFO L471 AbstractCegarLoop]: Abstraction has 4577 states and 6856 transitions. [2025-03-16 21:08:18,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 7 states have internal predecessors, (354), 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 21:08:18,368 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6856 transitions. [2025-03-16 21:08:18,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-16 21:08:18,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:18,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:18,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:08:18,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:18,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:18,374 INFO L85 PathProgramCache]: Analyzing trace with hash 719687722, now seen corresponding path program 1 times [2025-03-16 21:08:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:18,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410460990] [2025-03-16 21:08:18,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:18,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-16 21:08:19,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-16 21:08:19,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:19,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:20,395 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 21:08:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:20,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410460990] [2025-03-16 21:08:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410460990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:08:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798032318] [2025-03-16 21:08:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:20,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:08:20,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:20,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:08:20,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:08:20,396 INFO L87 Difference]: Start difference. First operand 4577 states and 6856 transitions. Second operand has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 8 states have internal predecessors, (355), 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 21:08:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:21,236 INFO L93 Difference]: Finished difference Result 7073 states and 10589 transitions. [2025-03-16 21:08:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:08:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 8 states have internal predecessors, (355), 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 355 [2025-03-16 21:08:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:21,243 INFO L225 Difference]: With dead ends: 7073 [2025-03-16 21:08:21,243 INFO L226 Difference]: Without dead ends: 4595 [2025-03-16 21:08:21,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:08:21,246 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 4192 mSDsluCounter, 6644 mSDsCounter, 0 mSdLazyCounter, 1777 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4192 SdHoareTripleChecker+Valid, 7973 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:21,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4192 Valid, 7973 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:08:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2025-03-16 21:08:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4581. [2025-03-16 21:08:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 4580 states have (on average 1.4980349344978166) internal successors, (6861), 4580 states have internal predecessors, (6861), 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 21:08:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6861 transitions. [2025-03-16 21:08:21,285 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6861 transitions. Word has length 355 [2025-03-16 21:08:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:21,285 INFO L471 AbstractCegarLoop]: Abstraction has 4581 states and 6861 transitions. [2025-03-16 21:08:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.44444444444444) internal successors, (355), 8 states have internal predecessors, (355), 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 21:08:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6861 transitions. [2025-03-16 21:08:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:08:21,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:21,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:21,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:08:21,290 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:21,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash -42990445, now seen corresponding path program 1 times [2025-03-16 21:08:21,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:21,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210016221] [2025-03-16 21:08:21,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:21,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:21,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:08:22,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:08:22,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:23,217 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 21:08:23,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:23,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210016221] [2025-03-16 21:08:23,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210016221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:23,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:23,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:23,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299151045] [2025-03-16 21:08:23,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:23,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:23,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:23,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:23,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:23,218 INFO L87 Difference]: Start difference. First operand 4581 states and 6861 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 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 21:08:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:23,730 INFO L93 Difference]: Finished difference Result 7100 states and 10629 transitions. [2025-03-16 21:08:23,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:23,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 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 356 [2025-03-16 21:08:23,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:23,738 INFO L225 Difference]: With dead ends: 7100 [2025-03-16 21:08:23,738 INFO L226 Difference]: Without dead ends: 4585 [2025-03-16 21:08:23,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:08:23,741 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 1307 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 3628 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:23,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 3628 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:08:23,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2025-03-16 21:08:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4583. [2025-03-16 21:08:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4583 states, 4582 states have (on average 1.4978175469227413) internal successors, (6863), 4582 states have internal predecessors, (6863), 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 21:08:23,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4583 states to 4583 states and 6863 transitions. [2025-03-16 21:08:23,778 INFO L78 Accepts]: Start accepts. Automaton has 4583 states and 6863 transitions. Word has length 356 [2025-03-16 21:08:23,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:23,778 INFO L471 AbstractCegarLoop]: Abstraction has 4583 states and 6863 transitions. [2025-03-16 21:08:23,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 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 21:08:23,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4583 states and 6863 transitions. [2025-03-16 21:08:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:08:23,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:23,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:23,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:08:23,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 725092629, now seen corresponding path program 1 times [2025-03-16 21:08:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:23,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611895370] [2025-03-16 21:08:23,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:23,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:23,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:08:24,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:08:24,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:24,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:25,210 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 21:08:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:25,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611895370] [2025-03-16 21:08:25,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611895370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:25,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:25,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:25,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700335823] [2025-03-16 21:08:25,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:25,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:25,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:25,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:25,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:25,212 INFO L87 Difference]: Start difference. First operand 4583 states and 6863 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 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 21:08:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:25,875 INFO L93 Difference]: Finished difference Result 7093 states and 10620 transitions. [2025-03-16 21:08:25,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:25,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 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 356 [2025-03-16 21:08:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:25,881 INFO L225 Difference]: With dead ends: 7093 [2025-03-16 21:08:25,882 INFO L226 Difference]: Without dead ends: 4585 [2025-03-16 21:08:25,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:25,885 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 1298 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1298 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:25,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1298 Valid, 3314 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:08:25,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2025-03-16 21:08:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 4585. [2025-03-16 21:08:25,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4585 states, 4584 states have (on average 1.4976003490401397) internal successors, (6865), 4584 states have internal predecessors, (6865), 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 21:08:25,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 6865 transitions. [2025-03-16 21:08:25,920 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 6865 transitions. Word has length 356 [2025-03-16 21:08:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 4585 states and 6865 transitions. [2025-03-16 21:08:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 4 states have internal predecessors, (356), 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 21:08:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 6865 transitions. [2025-03-16 21:08:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:08:25,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:25,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:25,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:08:25,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:25,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1643788082, now seen corresponding path program 1 times [2025-03-16 21:08:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144568970] [2025-03-16 21:08:25,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:25,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:08:26,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:08:26,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:26,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:27,140 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 21:08:27,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:27,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144568970] [2025-03-16 21:08:27,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144568970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:27,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:27,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:27,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971950863] [2025-03-16 21:08:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:27,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:08:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:27,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:08:27,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:08:27,142 INFO L87 Difference]: Start difference. First operand 4585 states and 6865 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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 21:08:27,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:27,443 INFO L93 Difference]: Finished difference Result 7105 states and 10634 transitions. [2025-03-16 21:08:27,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:08:27,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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 356 [2025-03-16 21:08:27,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:27,449 INFO L225 Difference]: With dead ends: 7105 [2025-03-16 21:08:27,449 INFO L226 Difference]: Without dead ends: 4591 [2025-03-16 21:08:27,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 21:08:27,452 INFO L435 NwaCegarLoop]: 1353 mSDtfsCounter, 0 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4053 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:27,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4053 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:08:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2025-03-16 21:08:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4591. [2025-03-16 21:08:27,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4590 states have (on average 1.496949891067538) internal successors, (6871), 4590 states have internal predecessors, (6871), 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 21:08:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 6871 transitions. [2025-03-16 21:08:27,485 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 6871 transitions. Word has length 356 [2025-03-16 21:08:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:27,485 INFO L471 AbstractCegarLoop]: Abstraction has 4591 states and 6871 transitions. [2025-03-16 21:08:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 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 21:08:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 6871 transitions. [2025-03-16 21:08:27,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-16 21:08:27,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:27,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:27,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:08:27,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -626860718, now seen corresponding path program 1 times [2025-03-16 21:08:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227159103] [2025-03-16 21:08:27,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:27,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 21:08:28,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 21:08:28,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:28,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:29,404 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 21:08:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:29,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227159103] [2025-03-16 21:08:29,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227159103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:29,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:29,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153654664] [2025-03-16 21:08:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:29,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:08:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:29,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:08:29,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:08:29,408 INFO L87 Difference]: Start difference. First operand 4591 states and 6871 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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 21:08:29,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:29,743 INFO L93 Difference]: Finished difference Result 7187 states and 10747 transitions. [2025-03-16 21:08:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:08:29,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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 357 [2025-03-16 21:08:29,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:29,749 INFO L225 Difference]: With dead ends: 7187 [2025-03-16 21:08:29,749 INFO L226 Difference]: Without dead ends: 4591 [2025-03-16 21:08:29,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:29,754 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 914 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:29,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 3084 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:08:29,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2025-03-16 21:08:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 2659. [2025-03-16 21:08:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2658 states have (on average 1.4932279909706547) internal successors, (3969), 2658 states have internal predecessors, (3969), 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 21:08:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 3969 transitions. [2025-03-16 21:08:29,782 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 3969 transitions. Word has length 357 [2025-03-16 21:08:29,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:29,783 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 3969 transitions. [2025-03-16 21:08:29,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 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 21:08:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3969 transitions. [2025-03-16 21:08:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-16 21:08:29,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:29,785 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:29,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:08:29,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:29,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -592196436, now seen corresponding path program 1 times [2025-03-16 21:08:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731966541] [2025-03-16 21:08:29,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:29,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 21:08:30,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 21:08:30,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:30,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:31,737 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 21:08:31,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:31,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731966541] [2025-03-16 21:08:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731966541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:31,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:31,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:31,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380881486] [2025-03-16 21:08:31,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:08:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:31,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:08:31,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:31,738 INFO L87 Difference]: Start difference. First operand 2659 states and 3969 transitions. Second operand has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 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 21:08:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:32,602 INFO L93 Difference]: Finished difference Result 4293 states and 6400 transitions. [2025-03-16 21:08:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:32,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 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 357 [2025-03-16 21:08:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:32,605 INFO L225 Difference]: With dead ends: 4293 [2025-03-16 21:08:32,605 INFO L226 Difference]: Without dead ends: 2667 [2025-03-16 21:08:32,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:32,607 INFO L435 NwaCegarLoop]: 1097 mSDtfsCounter, 1363 mSDsluCounter, 3593 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:32,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 4690 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:08:32,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-03-16 21:08:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2663. [2025-03-16 21:08:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.4924868519909842) internal successors, (3973), 2662 states have internal predecessors, (3973), 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 21:08:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3973 transitions. [2025-03-16 21:08:32,628 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3973 transitions. Word has length 357 [2025-03-16 21:08:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:32,628 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3973 transitions. [2025-03-16 21:08:32,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 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 21:08:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3973 transitions. [2025-03-16 21:08:32,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 21:08:32,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:32,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:32,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:08:32,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:32,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:32,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1801873204, now seen corresponding path program 1 times [2025-03-16 21:08:32,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951703005] [2025-03-16 21:08:32,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:32,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:32,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 21:08:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 21:08:33,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:33,850 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 21:08:33,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:33,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951703005] [2025-03-16 21:08:33,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951703005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:33,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:33,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:33,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399277118] [2025-03-16 21:08:33,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:33,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:33,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:33,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:33,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:33,852 INFO L87 Difference]: Start difference. First operand 2663 states and 3973 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 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 21:08:34,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:34,505 INFO L93 Difference]: Finished difference Result 4293 states and 6398 transitions. [2025-03-16 21:08:34,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:34,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 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 358 [2025-03-16 21:08:34,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:34,508 INFO L225 Difference]: With dead ends: 4293 [2025-03-16 21:08:34,508 INFO L226 Difference]: Without dead ends: 2665 [2025-03-16 21:08:34,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:34,510 INFO L435 NwaCegarLoop]: 1105 mSDtfsCounter, 1333 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 3311 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:34,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 3311 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:08:34,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2025-03-16 21:08:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2665. [2025-03-16 21:08:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2664 states have (on average 1.492117117117117) internal successors, (3975), 2664 states have internal predecessors, (3975), 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 21:08:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 3975 transitions. [2025-03-16 21:08:34,527 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 3975 transitions. Word has length 358 [2025-03-16 21:08:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:34,528 INFO L471 AbstractCegarLoop]: Abstraction has 2665 states and 3975 transitions. [2025-03-16 21:08:34,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 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 21:08:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 3975 transitions. [2025-03-16 21:08:34,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 21:08:34,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:34,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:34,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:08:34,530 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:34,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:34,530 INFO L85 PathProgramCache]: Analyzing trace with hash -423015578, now seen corresponding path program 1 times [2025-03-16 21:08:34,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:34,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950284651] [2025-03-16 21:08:34,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:34,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:34,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 21:08:35,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 21:08:35,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:35,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:37,584 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 21:08:37,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:37,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950284651] [2025-03-16 21:08:37,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950284651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:37,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:37,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 21:08:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251557328] [2025-03-16 21:08:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:37,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 21:08:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:37,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 21:08:37,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:08:37,586 INFO L87 Difference]: Start difference. First operand 2665 states and 3975 transitions. Second operand has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 11 states have internal predecessors, (358), 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 21:08:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:40,353 INFO L93 Difference]: Finished difference Result 8719 states and 12984 transitions. [2025-03-16 21:08:40,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 21:08:40,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 11 states have internal predecessors, (358), 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 358 [2025-03-16 21:08:40,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:40,358 INFO L225 Difference]: With dead ends: 8719 [2025-03-16 21:08:40,358 INFO L226 Difference]: Without dead ends: 7085 [2025-03-16 21:08:40,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-16 21:08:40,360 INFO L435 NwaCegarLoop]: 1719 mSDtfsCounter, 7513 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 7564 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7513 SdHoareTripleChecker+Valid, 14998 SdHoareTripleChecker+Invalid, 7567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:40,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7513 Valid, 14998 Invalid, 7567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7564 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 21:08:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2025-03-16 21:08:40,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 4603. [2025-03-16 21:08:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 4602 states have (on average 1.4960886571056062) internal successors, (6885), 4602 states have internal predecessors, (6885), 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 21:08:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 6885 transitions. [2025-03-16 21:08:40,407 INFO L78 Accepts]: Start accepts. Automaton has 4603 states and 6885 transitions. Word has length 358 [2025-03-16 21:08:40,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:40,408 INFO L471 AbstractCegarLoop]: Abstraction has 4603 states and 6885 transitions. [2025-03-16 21:08:40,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 29.833333333333332) internal successors, (358), 11 states have internal predecessors, (358), 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 21:08:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4603 states and 6885 transitions. [2025-03-16 21:08:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-16 21:08:40,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:40,410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:08:40,411 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:40,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1532784681, now seen corresponding path program 1 times [2025-03-16 21:08:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902264977] [2025-03-16 21:08:40,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:40,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-16 21:08:41,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-16 21:08:41,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:41,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:43,621 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 21:08:43,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:43,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902264977] [2025-03-16 21:08:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902264977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:43,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:43,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031776578] [2025-03-16 21:08:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:43,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:43,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:43,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:43,622 INFO L87 Difference]: Start difference. First operand 4603 states and 6885 transitions. Second operand has 10 states, 10 states have (on average 35.9) internal successors, (359), 9 states have internal predecessors, (359), 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 21:08:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:44,755 INFO L93 Difference]: Finished difference Result 13739 states and 20553 transitions. [2025-03-16 21:08:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 21:08:44,755 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 35.9) internal successors, (359), 9 states have internal predecessors, (359), 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 359 [2025-03-16 21:08:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:44,759 INFO L225 Difference]: With dead ends: 13739 [2025-03-16 21:08:44,759 INFO L226 Difference]: Without dead ends: 5411 [2025-03-16 21:08:44,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:08:44,765 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 4341 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4341 SdHoareTripleChecker+Valid, 9879 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:44,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4341 Valid, 9879 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:08:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2025-03-16 21:08:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 5299. [2025-03-16 21:08:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.4973574933937335) internal successors, (7933), 5298 states have internal predecessors, (7933), 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 21:08:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7933 transitions. [2025-03-16 21:08:44,805 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7933 transitions. Word has length 359 [2025-03-16 21:08:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:44,805 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7933 transitions. [2025-03-16 21:08:44,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.9) internal successors, (359), 9 states have internal predecessors, (359), 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 21:08:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7933 transitions. [2025-03-16 21:08:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-16 21:08:44,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:44,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:44,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:08:44,809 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:44,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:44,810 INFO L85 PathProgramCache]: Analyzing trace with hash 794241722, now seen corresponding path program 1 times [2025-03-16 21:08:44,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:44,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118869390] [2025-03-16 21:08:44,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:44,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:44,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-16 21:08:46,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-16 21:08:46,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:46,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:46,740 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 21:08:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:46,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118869390] [2025-03-16 21:08:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118869390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:46,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468161974] [2025-03-16 21:08:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:46,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:46,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:46,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:46,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:46,741 INFO L87 Difference]: Start difference. First operand 5299 states and 7933 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 21:08:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:47,104 INFO L93 Difference]: Finished difference Result 8217 states and 12292 transitions. [2025-03-16 21:08:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:08:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 360 [2025-03-16 21:08:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:47,108 INFO L225 Difference]: With dead ends: 8217 [2025-03-16 21:08:47,108 INFO L226 Difference]: Without dead ends: 5299 [2025-03-16 21:08:47,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:47,111 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 1405 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:47,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 3994 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:08:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-03-16 21:08:47,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 5299. [2025-03-16 21:08:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 5298 states have (on average 1.4969799924499811) internal successors, (7931), 5298 states have internal predecessors, (7931), 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 21:08:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7931 transitions. [2025-03-16 21:08:47,145 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7931 transitions. Word has length 360 [2025-03-16 21:08:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:47,145 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7931 transitions. [2025-03-16 21:08:47,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 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 21:08:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7931 transitions. [2025-03-16 21:08:47,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 21:08:47,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:47,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:47,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:08:47,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:47,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1894345655, now seen corresponding path program 1 times [2025-03-16 21:08:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220259046] [2025-03-16 21:08:47,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:47,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:47,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 21:08:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 21:08:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:49,078 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 21:08:49,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:49,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220259046] [2025-03-16 21:08:49,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220259046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:49,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:49,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:49,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281840607] [2025-03-16 21:08:49,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:49,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:49,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:49,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:49,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:49,079 INFO L87 Difference]: Start difference. First operand 5299 states and 7931 transitions. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 21:08:49,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:49,573 INFO L93 Difference]: Finished difference Result 8435 states and 12611 transitions. [2025-03-16 21:08:49,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:49,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 361 [2025-03-16 21:08:49,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:49,583 INFO L225 Difference]: With dead ends: 8435 [2025-03-16 21:08:49,583 INFO L226 Difference]: Without dead ends: 5299 [2025-03-16 21:08:49,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:08:49,586 INFO L435 NwaCegarLoop]: 1208 mSDtfsCounter, 1449 mSDsluCounter, 1994 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:49,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 3202 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:08:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2025-03-16 21:08:49,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 3185. [2025-03-16 21:08:49,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 3184 states have (on average 1.49214824120603) internal successors, (4751), 3184 states have internal predecessors, (4751), 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 21:08:49,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 4751 transitions. [2025-03-16 21:08:49,614 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 4751 transitions. Word has length 361 [2025-03-16 21:08:49,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:49,614 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 4751 transitions. [2025-03-16 21:08:49,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 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 21:08:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 4751 transitions. [2025-03-16 21:08:49,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 21:08:49,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:49,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:49,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:08:49,617 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:49,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:49,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1133587488, now seen corresponding path program 1 times [2025-03-16 21:08:49,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:49,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030736256] [2025-03-16 21:08:49,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:49,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 21:08:50,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 21:08:50,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:50,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:51,868 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 21:08:51,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030736256] [2025-03-16 21:08:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030736256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:51,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:51,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:51,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096649982] [2025-03-16 21:08:51,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:51,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:08:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:51,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:08:51,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:08:51,870 INFO L87 Difference]: Start difference. First operand 3185 states and 4751 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 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 21:08:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:53,515 INFO L93 Difference]: Finished difference Result 7232 states and 10768 transitions. [2025-03-16 21:08:53,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:53,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 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 361 [2025-03-16 21:08:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:53,522 INFO L225 Difference]: With dead ends: 7232 [2025-03-16 21:08:53,522 INFO L226 Difference]: Without dead ends: 4899 [2025-03-16 21:08:53,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:08:53,525 INFO L435 NwaCegarLoop]: 2013 mSDtfsCounter, 2650 mSDsluCounter, 9127 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 11140 SdHoareTripleChecker+Invalid, 5194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:53,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 11140 Invalid, 5194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 21:08:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2025-03-16 21:08:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 3543. [2025-03-16 21:08:53,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3542 states have (on average 1.4937888198757765) internal successors, (5291), 3542 states have internal predecessors, (5291), 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 21:08:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 5291 transitions. [2025-03-16 21:08:53,559 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 5291 transitions. Word has length 361 [2025-03-16 21:08:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:53,559 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 5291 transitions. [2025-03-16 21:08:53,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 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 21:08:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 5291 transitions. [2025-03-16 21:08:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 21:08:53,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:53,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:53,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:08:53,562 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:53,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:53,563 INFO L85 PathProgramCache]: Analyzing trace with hash 489059702, now seen corresponding path program 1 times [2025-03-16 21:08:53,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:53,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482772889] [2025-03-16 21:08:53,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:53,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 21:08:54,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 21:08:54,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:55,842 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 21:08:55,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:55,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482772889] [2025-03-16 21:08:55,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482772889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:55,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:55,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:55,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208007377] [2025-03-16 21:08:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:55,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:08:55,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:55,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:08:55,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:08:55,843 INFO L87 Difference]: Start difference. First operand 3543 states and 5291 transitions. Second operand has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 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 21:08:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:56,425 INFO L93 Difference]: Finished difference Result 8277 states and 12330 transitions. [2025-03-16 21:08:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:56,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 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 361 [2025-03-16 21:08:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:56,430 INFO L225 Difference]: With dead ends: 8277 [2025-03-16 21:08:56,431 INFO L226 Difference]: Without dead ends: 5765 [2025-03-16 21:08:56,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:08:56,434 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 3834 mSDsluCounter, 6327 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3834 SdHoareTripleChecker+Valid, 7667 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:56,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3834 Valid, 7667 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:08:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5765 states. [2025-03-16 21:08:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5765 to 3181. [2025-03-16 21:08:56,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 3180 states have (on average 1.491509433962264) internal successors, (4743), 3180 states have internal predecessors, (4743), 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 21:08:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4743 transitions. [2025-03-16 21:08:56,462 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4743 transitions. Word has length 361 [2025-03-16 21:08:56,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:56,462 INFO L471 AbstractCegarLoop]: Abstraction has 3181 states and 4743 transitions. [2025-03-16 21:08:56,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 45.125) internal successors, (361), 7 states have internal predecessors, (361), 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 21:08:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4743 transitions. [2025-03-16 21:08:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 21:08:56,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:56,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:56,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:08:56,465 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash -188574112, now seen corresponding path program 1 times [2025-03-16 21:08:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223530014] [2025-03-16 21:08:56,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 21:08:57,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 21:08:57,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:57,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:58,412 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 21:08:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223530014] [2025-03-16 21:08:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223530014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:58,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:58,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:08:58,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463186622] [2025-03-16 21:08:58,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:58,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:08:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:58,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:08:58,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:08:58,413 INFO L87 Difference]: Start difference. First operand 3181 states and 4743 transitions. Second operand has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 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 21:08:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:59,309 INFO L93 Difference]: Finished difference Result 5044 states and 7513 transitions. [2025-03-16 21:08:59,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:08:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 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 361 [2025-03-16 21:08:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:59,312 INFO L225 Difference]: With dead ends: 5044 [2025-03-16 21:08:59,312 INFO L226 Difference]: Without dead ends: 3189 [2025-03-16 21:08:59,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:08:59,314 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 2723 mSDsluCounter, 6085 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2723 SdHoareTripleChecker+Valid, 7303 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:59,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2723 Valid, 7303 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:08:59,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2025-03-16 21:08:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3187. [2025-03-16 21:08:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 3186 states have (on average 1.490583804143126) internal successors, (4749), 3186 states have internal predecessors, (4749), 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 21:08:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 4749 transitions. [2025-03-16 21:08:59,342 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 4749 transitions. Word has length 361 [2025-03-16 21:08:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:59,343 INFO L471 AbstractCegarLoop]: Abstraction has 3187 states and 4749 transitions. [2025-03-16 21:08:59,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 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 21:08:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 4749 transitions. [2025-03-16 21:08:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-16 21:08:59,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:59,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:08:59,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:08:59,345 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1540623857, now seen corresponding path program 1 times [2025-03-16 21:08:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110075112] [2025-03-16 21:08:59,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:59,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:59,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-16 21:08:59,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-16 21:08:59,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:59,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:09:00,093 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 21:09:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:09:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110075112] [2025-03-16 21:09:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110075112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:09:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:09:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:09:00,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424068927] [2025-03-16 21:09:00,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:09:00,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:09:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:09:00,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:09:00,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:09:00,094 INFO L87 Difference]: Start difference. First operand 3187 states and 4749 transitions. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 21:09:00,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:09:00,400 INFO L93 Difference]: Finished difference Result 5056 states and 7525 transitions. [2025-03-16 21:09:00,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:09:00,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 362 [2025-03-16 21:09:00,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:09:00,403 INFO L225 Difference]: With dead ends: 5056 [2025-03-16 21:09:00,403 INFO L226 Difference]: Without dead ends: 3193 [2025-03-16 21:09:00,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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 21:09:00,405 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 0 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4044 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:09:00,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4044 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:09:00,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2025-03-16 21:09:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3193. [2025-03-16 21:09:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3192 states have (on average 1.4896616541353382) internal successors, (4755), 3192 states have internal predecessors, (4755), 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 21:09:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4755 transitions. [2025-03-16 21:09:00,429 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4755 transitions. Word has length 362 [2025-03-16 21:09:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:09:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4755 transitions. [2025-03-16 21:09:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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 21:09:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4755 transitions. [2025-03-16 21:09:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-16 21:09:00,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:09:00,431 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:09:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:09:00,431 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:09:00,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:09:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -762061637, now seen corresponding path program 1 times [2025-03-16 21:09:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:09:00,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386594965] [2025-03-16 21:09:00,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:09:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:09:00,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-16 21:09:01,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-16 21:09:01,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:09:01,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:09:02,407 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 21:09:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:09:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386594965] [2025-03-16 21:09:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386594965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:09:02,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:09:02,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:09:02,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851253387] [2025-03-16 21:09:02,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:09:02,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:09:02,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:09:02,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:09:02,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:09:02,409 INFO L87 Difference]: Start difference. First operand 3193 states and 4755 transitions. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 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)