./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.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.cache_coherence_three.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 c55a8c69ce0e8314bfd7e0816f3c45b7211b264f59ab428d293ddf52e857d73b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:07:32,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:07:32,801 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:32,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:07:32,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:07:32,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:07:32,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:07:32,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:07:32,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:07:32,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:07:32,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:07:32,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:07:32,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:07:32,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:07:32,834 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:07:32,835 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:07:32,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:07:32,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:32,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:07:32,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:07:32,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:07:32,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:07:32,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:07:32,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:07:32,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:07:32,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:07:32,837 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 -> c55a8c69ce0e8314bfd7e0816f3c45b7211b264f59ab428d293ddf52e857d73b [2025-03-16 21:07:33,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:07:33,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:07:33,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:07:33,084 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:07:33,084 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:07:33,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c [2025-03-16 21:07:34,235 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07d697f95/cdc201dcf0ee40acb3d15b1d290294d1/FLAG964f8e3ff [2025-03-16 21:07:34,552 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:07:34,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cache_coherence_three.c [2025-03-16 21:07:34,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07d697f95/cdc201dcf0ee40acb3d15b1d290294d1/FLAG964f8e3ff [2025-03-16 21:07:34,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07d697f95/cdc201dcf0ee40acb3d15b1d290294d1 [2025-03-16 21:07:34,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:07:34,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:07:34,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:34,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:07:34,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:07:34,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:34" (1/1) ... [2025-03-16 21:07:34,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a47042a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:34, skipping insertion in model container [2025-03-16 21:07:34,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:07:34" (1/1) ... [2025-03-16 21:07:34,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:07:34,783 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.cache_coherence_three.c[1261,1274] [2025-03-16 21:07:35,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:35,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:07:35,083 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.cache_coherence_three.c[1261,1274] [2025-03-16 21:07:35,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:07:35,284 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:07:35,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:35 WrapperNode [2025-03-16 21:07:35,285 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:07:35,286 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:35,286 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:07:35,286 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:07:35,291 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:35" (1/1) ... [2025-03-16 21:07:35,344 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:35" (1/1) ... [2025-03-16 21:07:35,806 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5772 [2025-03-16 21:07:35,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:07:35,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:07:35,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:07:35,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:07:35,831 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:35" (1/1) ... [2025-03-16 21:07:35,833 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:35" (1/1) ... [2025-03-16 21:07:35,984 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:35" (1/1) ... [2025-03-16 21:07:36,132 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 21:07:36,133 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:35" (1/1) ... [2025-03-16 21:07:36,133 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:35" (1/1) ... [2025-03-16 21:07:36,274 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:35" (1/1) ... [2025-03-16 21:07:36,288 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:35" (1/1) ... [2025-03-16 21:07:36,307 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:35" (1/1) ... [2025-03-16 21:07:36,330 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:35" (1/1) ... [2025-03-16 21:07:36,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:07:36,385 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:07:36,386 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:07:36,386 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:07:36,387 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:35" (1/1) ... [2025-03-16 21:07:36,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:07:36,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:07:36,412 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:36,414 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:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:07:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:07:36,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:07:36,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:07:36,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:07:36,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:07:40,928 INFO L? ?]: Removed 3800 outVars from TransFormulas that were not future-live. [2025-03-16 21:07:40,928 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:07:41,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:07:41,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:07:41,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:41 BoogieIcfgContainer [2025-03-16 21:07:41,093 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:07:41,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:07:41,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:07:41,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:07:41,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:07:34" (1/3) ... [2025-03-16 21:07:41,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8f51ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:41, skipping insertion in model container [2025-03-16 21:07:41,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:07:35" (2/3) ... [2025-03-16 21:07:41,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8f51ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:07:41, skipping insertion in model container [2025-03-16 21:07:41,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:07:41" (3/3) ... [2025-03-16 21:07:41,100 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cache_coherence_three.c [2025-03-16 21:07:41,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:07:41,113 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cache_coherence_three.c that has 1 procedures, 1392 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:07:41,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:07:41,197 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;@2bb607bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:07:41,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:07:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 1392 states, 1390 states have (on average 1.5) internal successors, (2085), 1391 states have internal predecessors, (2085), 0 states have call successors, (0), 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:41,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 21:07:41,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:41,216 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] [2025-03-16 21:07:41,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:41,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash 687907376, now seen corresponding path program 1 times [2025-03-16 21:07:41,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:41,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740635487] [2025-03-16 21:07:41,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:41,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 21:07:41,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 21:07:41,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:41,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:42,308 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:42,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740635487] [2025-03-16 21:07:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740635487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:42,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:42,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:42,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249302207] [2025-03-16 21:07:42,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:42,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:42,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:42,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:42,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:42,341 INFO L87 Difference]: Start difference. First operand has 1392 states, 1390 states have (on average 1.5) internal successors, (2085), 1391 states have internal predecessors, (2085), 0 states have call successors, (0), 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 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:43,107 INFO L93 Difference]: Finished difference Result 2615 states and 3919 transitions. [2025-03-16 21:07:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:43,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2025-03-16 21:07:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:43,127 INFO L225 Difference]: With dead ends: 2615 [2025-03-16 21:07:43,128 INFO L226 Difference]: Without dead ends: 1392 [2025-03-16 21:07:43,134 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:43,136 INFO L435 NwaCegarLoop]: 1734 mSDtfsCounter, 0 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5197 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:43,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5197 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:07:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2025-03-16 21:07:43,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2025-03-16 21:07:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1391 states have (on average 1.4982027318475917) internal successors, (2084), 1391 states have internal predecessors, (2084), 0 states have call successors, (0), 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:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2084 transitions. [2025-03-16 21:07:43,234 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2084 transitions. Word has length 126 [2025-03-16 21:07:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:43,235 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2084 transitions. [2025-03-16 21:07:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 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:43,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2084 transitions. [2025-03-16 21:07:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 21:07:43,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:43,239 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] [2025-03-16 21:07:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:07:43,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:43,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash -145026686, now seen corresponding path program 1 times [2025-03-16 21:07:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309242788] [2025-03-16 21:07:43,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:43,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 21:07:43,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 21:07:43,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:43,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:43,666 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:43,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309242788] [2025-03-16 21:07:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309242788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:43,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247566595] [2025-03-16 21:07:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:43,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:43,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:43,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:43,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:43,669 INFO L87 Difference]: Start difference. First operand 1392 states and 2084 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:44,256 INFO L93 Difference]: Finished difference Result 2617 states and 3918 transitions. [2025-03-16 21:07:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-16 21:07:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:44,262 INFO L225 Difference]: With dead ends: 2617 [2025-03-16 21:07:44,262 INFO L226 Difference]: Without dead ends: 1394 [2025-03-16 21:07:44,263 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:44,264 INFO L435 NwaCegarLoop]: 1734 mSDtfsCounter, 0 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5194 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:44,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5194 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:07:44,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-16 21:07:44,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-16 21:07:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.4974874371859297) internal successors, (2086), 1393 states have internal predecessors, (2086), 0 states have call successors, (0), 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:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2086 transitions. [2025-03-16 21:07:44,292 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2086 transitions. Word has length 127 [2025-03-16 21:07:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:44,293 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2086 transitions. [2025-03-16 21:07:44,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 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:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2086 transitions. [2025-03-16 21:07:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 21:07:44,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:44,298 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] [2025-03-16 21:07:44,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:07:44,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:44,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1730651243, now seen corresponding path program 1 times [2025-03-16 21:07:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033336972] [2025-03-16 21:07:44,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:44,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:44,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 21:07:44,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 21:07:44,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:44,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:44,922 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:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:44,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033336972] [2025-03-16 21:07:44,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033336972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:44,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:44,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725846943] [2025-03-16 21:07:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:44,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:44,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:44,924 INFO L87 Difference]: Start difference. First operand 1394 states and 2086 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:07:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:45,521 INFO L93 Difference]: Finished difference Result 2619 states and 3919 transitions. [2025-03-16 21:07:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-16 21:07:45,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:45,526 INFO L225 Difference]: With dead ends: 2619 [2025-03-16 21:07:45,526 INFO L226 Difference]: Without dead ends: 1394 [2025-03-16 21:07:45,528 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:45,528 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 6 mSDsluCounter, 3453 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5184 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:45,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5184 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:07:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2025-03-16 21:07:45,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2025-03-16 21:07:45,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.4967695620961952) internal successors, (2085), 1393 states have internal predecessors, (2085), 0 states have call successors, (0), 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:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2085 transitions. [2025-03-16 21:07:45,555 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2085 transitions. Word has length 128 [2025-03-16 21:07:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:45,555 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2085 transitions. [2025-03-16 21:07:45,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:07:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2085 transitions. [2025-03-16 21:07:45,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-16 21:07:45,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:45,557 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] [2025-03-16 21:07:45,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:07:45,557 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:45,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:45,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1899985011, now seen corresponding path program 1 times [2025-03-16 21:07:45,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:45,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230499833] [2025-03-16 21:07:45,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:45,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:45,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-16 21:07:45,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-16 21:07:45,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:45,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:46,128 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:46,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:46,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230499833] [2025-03-16 21:07:46,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230499833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:46,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:46,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:46,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117838883] [2025-03-16 21:07:46,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:46,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:07:46,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:46,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:07:46,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:07:46,132 INFO L87 Difference]: Start difference. First operand 1394 states and 2085 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:46,960 INFO L93 Difference]: Finished difference Result 2623 states and 3923 transitions. [2025-03-16 21:07:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:07:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2025-03-16 21:07:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:46,966 INFO L225 Difference]: With dead ends: 2623 [2025-03-16 21:07:46,966 INFO L226 Difference]: Without dead ends: 1398 [2025-03-16 21:07:46,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:07:46,969 INFO L435 NwaCegarLoop]: 1710 mSDtfsCounter, 1966 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 5124 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:46,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 5124 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:07:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-03-16 21:07:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1397. [2025-03-16 21:07:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 1.495702005730659) internal successors, (2088), 1396 states have internal predecessors, (2088), 0 states have call successors, (0), 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:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2088 transitions. [2025-03-16 21:07:46,993 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2088 transitions. Word has length 129 [2025-03-16 21:07:46,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2088 transitions. [2025-03-16 21:07:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 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:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2088 transitions. [2025-03-16 21:07:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-16 21:07:46,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:46,997 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] [2025-03-16 21:07:46,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:07:46,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:46,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:46,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1000240221, now seen corresponding path program 1 times [2025-03-16 21:07:46,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:46,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135736962] [2025-03-16 21:07:46,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:46,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:47,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-16 21:07:47,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-16 21:07:47,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:47,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:47,507 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:47,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:47,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135736962] [2025-03-16 21:07:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135736962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:47,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938972520] [2025-03-16 21:07:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:47,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:47,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:47,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:47,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:47,509 INFO L87 Difference]: Start difference. First operand 1397 states and 2088 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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:48,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:48,128 INFO L93 Difference]: Finished difference Result 2625 states and 3923 transitions. [2025-03-16 21:07:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:48,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-03-16 21:07:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:48,133 INFO L225 Difference]: With dead ends: 2625 [2025-03-16 21:07:48,134 INFO L226 Difference]: Without dead ends: 1397 [2025-03-16 21:07:48,135 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:48,135 INFO L435 NwaCegarLoop]: 1730 mSDtfsCounter, 6 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5181 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:48,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5181 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:07:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2025-03-16 21:07:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1397. [2025-03-16 21:07:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1396 states have (on average 1.4949856733524356) internal successors, (2087), 1396 states have internal predecessors, (2087), 0 states have call successors, (0), 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:48,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 2087 transitions. [2025-03-16 21:07:48,158 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 2087 transitions. Word has length 130 [2025-03-16 21:07:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:48,158 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 2087 transitions. [2025-03-16 21:07:48,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 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:48,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 2087 transitions. [2025-03-16 21:07:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-16 21:07:48,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:48,159 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] [2025-03-16 21:07:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:07:48,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:48,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1647470882, now seen corresponding path program 1 times [2025-03-16 21:07:48,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:48,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545289783] [2025-03-16 21:07:48,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:48,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:48,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-16 21:07:48,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-16 21:07:48,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:48,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:49,338 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:49,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:49,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545289783] [2025-03-16 21:07:49,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545289783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:49,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 21:07:49,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807177230] [2025-03-16 21:07:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:49,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 21:07:49,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:49,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 21:07:49,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:07:49,342 INFO L87 Difference]: Start difference. First operand 1397 states and 2087 transitions. Second operand has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 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:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:51,001 INFO L93 Difference]: Finished difference Result 2664 states and 3978 transitions. [2025-03-16 21:07:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 21:07:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-03-16 21:07:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:51,006 INFO L225 Difference]: With dead ends: 2664 [2025-03-16 21:07:51,006 INFO L226 Difference]: Without dead ends: 1436 [2025-03-16 21:07:51,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-16 21:07:51,008 INFO L435 NwaCegarLoop]: 1713 mSDtfsCounter, 53 mSDsluCounter, 15485 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 17198 SdHoareTripleChecker+Invalid, 3756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:51,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 17198 Invalid, 3756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 21:07:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-03-16 21:07:51,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1424. [2025-03-16 21:07:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 1.494729444834856) internal successors, (2127), 1423 states have internal predecessors, (2127), 0 states have call successors, (0), 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:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2127 transitions. [2025-03-16 21:07:51,031 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2127 transitions. Word has length 131 [2025-03-16 21:07:51,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:51,032 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2127 transitions. [2025-03-16 21:07:51,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.277777777777778) internal successors, (131), 18 states have internal predecessors, (131), 0 states have call successors, (0), 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:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2127 transitions. [2025-03-16 21:07:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 21:07:51,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:51,033 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] [2025-03-16 21:07:51,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:07:51,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:51,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2090098066, now seen corresponding path program 1 times [2025-03-16 21:07:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771281329] [2025-03-16 21:07:51,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:51,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 21:07:51,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 21:07:51,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:51,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:51,624 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:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771281329] [2025-03-16 21:07:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771281329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:07:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666450544] [2025-03-16 21:07:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:51,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:07:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:51,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:07:51,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:07:51,627 INFO L87 Difference]: Start difference. First operand 1424 states and 2127 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:52,735 INFO L93 Difference]: Finished difference Result 2680 states and 4002 transitions. [2025-03-16 21:07:52,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:07:52,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-16 21:07:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:52,740 INFO L225 Difference]: With dead ends: 2680 [2025-03-16 21:07:52,740 INFO L226 Difference]: Without dead ends: 1425 [2025-03-16 21:07:52,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:07:52,743 INFO L435 NwaCegarLoop]: 1726 mSDtfsCounter, 11 mSDsluCounter, 8614 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10340 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:52,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10340 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 21:07:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2025-03-16 21:07:52,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1424. [2025-03-16 21:07:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 1.4940267041461701) internal successors, (2126), 1423 states have internal predecessors, (2126), 0 states have call successors, (0), 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:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2126 transitions. [2025-03-16 21:07:52,766 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2126 transitions. Word has length 132 [2025-03-16 21:07:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:52,766 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2126 transitions. [2025-03-16 21:07:52,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 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:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2126 transitions. [2025-03-16 21:07:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 21:07:52,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:52,768 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] [2025-03-16 21:07:52,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:07:52,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:52,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:52,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1355118416, now seen corresponding path program 1 times [2025-03-16 21:07:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:52,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46710322] [2025-03-16 21:07:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 21:07:52,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 21:07:52,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:52,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:53,151 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:53,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:53,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46710322] [2025-03-16 21:07:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46710322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:53,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003240642] [2025-03-16 21:07:53,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:53,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:07:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:53,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:07:53,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:07:53,153 INFO L87 Difference]: Start difference. First operand 1424 states and 2126 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:53,728 INFO L93 Difference]: Finished difference Result 2679 states and 3999 transitions. [2025-03-16 21:07:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:07:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-16 21:07:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:53,732 INFO L225 Difference]: With dead ends: 2679 [2025-03-16 21:07:53,732 INFO L226 Difference]: Without dead ends: 1424 [2025-03-16 21:07:53,734 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,734 INFO L435 NwaCegarLoop]: 1729 mSDtfsCounter, 6 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5178 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:53,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5178 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:07:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2025-03-16 21:07:53,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1424. [2025-03-16 21:07:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 1423 states have (on average 1.4933239634574842) internal successors, (2125), 1423 states have internal predecessors, (2125), 0 states have call successors, (0), 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,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 2125 transitions. [2025-03-16 21:07:53,753 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 2125 transitions. Word has length 132 [2025-03-16 21:07:53,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:53,753 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 2125 transitions. [2025-03-16 21:07:53,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 2125 transitions. [2025-03-16 21:07:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 21:07:53,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:53,754 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] [2025-03-16 21:07:53,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:07:53,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:53,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:53,755 INFO L85 PathProgramCache]: Analyzing trace with hash 893511631, now seen corresponding path program 1 times [2025-03-16 21:07:53,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:53,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602110258] [2025-03-16 21:07:53,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:53,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:53,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 21:07:53,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 21:07:53,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:53,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:54,230 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,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602110258] [2025-03-16 21:07:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602110258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739664848] [2025-03-16 21:07:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:54,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:07:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:54,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:07:54,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:07:54,233 INFO L87 Difference]: Start difference. First operand 1424 states and 2125 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:54,839 INFO L93 Difference]: Finished difference Result 2682 states and 4001 transitions. [2025-03-16 21:07:54,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:07:54,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-03-16 21:07:54,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:54,844 INFO L225 Difference]: With dead ends: 2682 [2025-03-16 21:07:54,844 INFO L226 Difference]: Without dead ends: 1427 [2025-03-16 21:07:54,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:07:54,846 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 1993 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1993 SdHoareTripleChecker+Valid, 5067 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:54,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1993 Valid, 5067 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:07:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-16 21:07:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2025-03-16 21:07:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.4922861150070126) internal successors, (2128), 1426 states have internal predecessors, (2128), 0 states have call successors, (0), 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:54,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 2128 transitions. [2025-03-16 21:07:54,863 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 2128 transitions. Word has length 133 [2025-03-16 21:07:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:54,864 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 2128 transitions. [2025-03-16 21:07:54,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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:54,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 2128 transitions. [2025-03-16 21:07:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 21:07:54,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:54,865 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] [2025-03-16 21:07:54,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:07:54,865 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash -318402623, now seen corresponding path program 1 times [2025-03-16 21:07:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:54,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816422245] [2025-03-16 21:07:54,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:54,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:54,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 21:07:54,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 21:07:54,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:54,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:55,451 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:55,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:55,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816422245] [2025-03-16 21:07:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816422245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 21:07:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134256472] [2025-03-16 21:07:55,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:55,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 21:07:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:55,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 21:07:55,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:07:55,452 INFO L87 Difference]: Start difference. First operand 1427 states and 2128 transitions. Second operand has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 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:56,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:56,811 INFO L93 Difference]: Finished difference Result 2718 states and 4051 transitions. [2025-03-16 21:07:56,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 21:07:56,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-16 21:07:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:56,816 INFO L225 Difference]: With dead ends: 2718 [2025-03-16 21:07:56,816 INFO L226 Difference]: Without dead ends: 1460 [2025-03-16 21:07:56,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:07:56,818 INFO L435 NwaCegarLoop]: 1718 mSDtfsCounter, 36 mSDsluCounter, 15463 mSDsCounter, 0 mSdLazyCounter, 3641 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 17181 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:56,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 17181 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3641 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 21:07:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2025-03-16 21:07:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1447. [2025-03-16 21:07:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 1446 states have (on average 1.491701244813278) internal successors, (2157), 1446 states have internal predecessors, (2157), 0 states have call successors, (0), 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:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 2157 transitions. [2025-03-16 21:07:56,837 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 2157 transitions. Word has length 134 [2025-03-16 21:07:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 2157 transitions. [2025-03-16 21:07:56,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 0 states have call successors, (0), 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:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 2157 transitions. [2025-03-16 21:07:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 21:07:56,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:56,839 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] [2025-03-16 21:07:56,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:07:56,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:56,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash -494758397, now seen corresponding path program 1 times [2025-03-16 21:07:56,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:56,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811382000] [2025-03-16 21:07:56,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:56,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 21:07:56,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 21:07:56,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:56,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:57,406 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,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:57,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811382000] [2025-03-16 21:07:57,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811382000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:57,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:57,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:07:57,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143201098] [2025-03-16 21:07:57,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:57,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:07:57,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:57,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:07:57,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:07:57,409 INFO L87 Difference]: Start difference. First operand 1447 states and 2157 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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:58,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:58,490 INFO L93 Difference]: Finished difference Result 2736 states and 4078 transitions. [2025-03-16 21:07:58,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:07:58,490 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-16 21:07:58,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:58,495 INFO L225 Difference]: With dead ends: 2736 [2025-03-16 21:07:58,495 INFO L226 Difference]: Without dead ends: 1458 [2025-03-16 21:07:58,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:07:58,497 INFO L435 NwaCegarLoop]: 1689 mSDtfsCounter, 1989 mSDsluCounter, 8430 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 10119 SdHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:58,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 10119 Invalid, 2353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 21:07:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2025-03-16 21:07:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1455. [2025-03-16 21:07:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1455 states, 1454 states have (on average 1.4896836313617607) internal successors, (2166), 1454 states have internal predecessors, (2166), 0 states have call successors, (0), 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:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 2166 transitions. [2025-03-16 21:07:58,522 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 2166 transitions. Word has length 134 [2025-03-16 21:07:58,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:58,522 INFO L471 AbstractCegarLoop]: Abstraction has 1455 states and 2166 transitions. [2025-03-16 21:07:58,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 7 states have internal predecessors, (134), 0 states have call successors, (0), 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:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 2166 transitions. [2025-03-16 21:07:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 21:07:58,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:58,525 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] [2025-03-16 21:07:58,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:07:58,525 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:58,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash 386772612, now seen corresponding path program 1 times [2025-03-16 21:07:58,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:58,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000803895] [2025-03-16 21:07:58,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:58,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:58,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 21:07:58,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 21:07:58,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:58,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:07:58,894 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:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:07:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000803895] [2025-03-16 21:07:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000803895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:07:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:07:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:07:58,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405805150] [2025-03-16 21:07:58,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:07:58,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:07:58,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:07:58,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:07:58,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:07:58,896 INFO L87 Difference]: Start difference. First operand 1455 states and 2166 transitions. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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:59,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:07:59,490 INFO L93 Difference]: Finished difference Result 2747 states and 4087 transitions. [2025-03-16 21:07:59,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:07:59,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-03-16 21:07:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:07:59,494 INFO L225 Difference]: With dead ends: 2747 [2025-03-16 21:07:59,494 INFO L226 Difference]: Without dead ends: 1461 [2025-03-16 21:07:59,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:07:59,495 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 1981 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1981 SdHoareTripleChecker+Valid, 5067 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:07:59,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1981 Valid, 5067 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:07:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2025-03-16 21:07:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2025-03-16 21:07:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.4876712328767123) internal successors, (2172), 1460 states have internal predecessors, (2172), 0 states have call successors, (0), 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:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2172 transitions. [2025-03-16 21:07:59,544 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2172 transitions. Word has length 134 [2025-03-16 21:07:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:07:59,544 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2172 transitions. [2025-03-16 21:07:59,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2172 transitions. [2025-03-16 21:07:59,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 21:07:59,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:07:59,546 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] [2025-03-16 21:07:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:07:59,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:07:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:07:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1470700938, now seen corresponding path program 1 times [2025-03-16 21:07:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:07:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775026417] [2025-03-16 21:07:59,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:07:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:07:59,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 21:07:59,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 21:07:59,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:07:59,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:00,005 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,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:00,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775026417] [2025-03-16 21:08:00,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775026417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:00,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:00,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054612564] [2025-03-16 21:08:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:00,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:08:00,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:00,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:08:00,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:08:00,008 INFO L87 Difference]: Start difference. First operand 1461 states and 2172 transitions. Second operand has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:01,110 INFO L93 Difference]: Finished difference Result 2763 states and 4105 transitions. [2025-03-16 21:08:01,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:01,110 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 21:08:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:01,113 INFO L225 Difference]: With dead ends: 2763 [2025-03-16 21:08:01,113 INFO L226 Difference]: Without dead ends: 1471 [2025-03-16 21:08:01,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:08:01,115 INFO L435 NwaCegarLoop]: 1699 mSDtfsCounter, 1961 mSDsluCounter, 8487 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 10186 SdHoareTripleChecker+Invalid, 2287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:01,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1961 Valid, 10186 Invalid, 2287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 21:08:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2025-03-16 21:08:01,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1467. [2025-03-16 21:08:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 1466 states have (on average 1.4870395634379263) internal successors, (2180), 1466 states have internal predecessors, (2180), 0 states have call successors, (0), 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,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 2180 transitions. [2025-03-16 21:08:01,130 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 2180 transitions. Word has length 135 [2025-03-16 21:08:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:01,130 INFO L471 AbstractCegarLoop]: Abstraction has 1467 states and 2180 transitions. [2025-03-16 21:08:01,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.875) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 2180 transitions. [2025-03-16 21:08:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 21:08:01,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:01,131 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] [2025-03-16 21:08:01,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:08:01,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:01,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1242191386, now seen corresponding path program 1 times [2025-03-16 21:08:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:01,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365459963] [2025-03-16 21:08:01,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:01,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 21:08:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 21:08:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:01,886 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:01,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:01,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365459963] [2025-03-16 21:08:01,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365459963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:01,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:01,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:01,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428074031] [2025-03-16 21:08:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:01,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:01,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:01,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:01,888 INFO L87 Difference]: Start difference. First operand 1467 states and 2180 transitions. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 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:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:05,097 INFO L93 Difference]: Finished difference Result 3876 states and 5756 transitions. [2025-03-16 21:08:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 21:08:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:05,104 INFO L225 Difference]: With dead ends: 3876 [2025-03-16 21:08:05,104 INFO L226 Difference]: Without dead ends: 2578 [2025-03-16 21:08:05,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:08:05,106 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 8727 mSDsluCounter, 5329 mSDsCounter, 0 mSdLazyCounter, 6080 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8727 SdHoareTripleChecker+Valid, 6397 SdHoareTripleChecker+Invalid, 6080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:05,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8727 Valid, 6397 Invalid, 6080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6080 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 21:08:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2025-03-16 21:08:05,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1488. [2025-03-16 21:08:05,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1487 states have (on average 1.4862138533960996) internal successors, (2210), 1487 states have internal predecessors, (2210), 0 states have call successors, (0), 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:05,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2210 transitions. [2025-03-16 21:08:05,127 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2210 transitions. Word has length 135 [2025-03-16 21:08:05,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:05,127 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 2210 transitions. [2025-03-16 21:08:05,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 9 states have internal predecessors, (135), 0 states have call successors, (0), 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:05,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2210 transitions. [2025-03-16 21:08:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-16 21:08:05,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:05,128 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] [2025-03-16 21:08:05,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:08:05,129 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash -312339647, now seen corresponding path program 1 times [2025-03-16 21:08:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006750916] [2025-03-16 21:08:05,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:05,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:05,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-16 21:08:05,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-16 21:08:05,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:05,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:05,570 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:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006750916] [2025-03-16 21:08:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006750916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096591523] [2025-03-16 21:08:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:08:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:05,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:08:05,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:05,571 INFO L87 Difference]: Start difference. First operand 1488 states and 2210 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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:06,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:06,530 INFO L93 Difference]: Finished difference Result 2813 states and 4177 transitions. [2025-03-16 21:08:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:06,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-03-16 21:08:06,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:06,534 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 21:08:06,534 INFO L226 Difference]: Without dead ends: 1494 [2025-03-16 21:08:06,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:08:06,536 INFO L435 NwaCegarLoop]: 1725 mSDtfsCounter, 11 mSDsluCounter, 8609 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10334 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:06,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10334 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:08:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2025-03-16 21:08:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1492. [2025-03-16 21:08:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 1491 states have (on average 1.4855801475519785) internal successors, (2215), 1491 states have internal predecessors, (2215), 0 states have call successors, (0), 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:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2215 transitions. [2025-03-16 21:08:06,550 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2215 transitions. Word has length 135 [2025-03-16 21:08:06,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:06,551 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 2215 transitions. [2025-03-16 21:08:06,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 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:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2215 transitions. [2025-03-16 21:08:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 21:08:06,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:06,552 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] [2025-03-16 21:08:06,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:08:06,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash -953111741, now seen corresponding path program 1 times [2025-03-16 21:08:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136986153] [2025-03-16 21:08:06,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:06,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 21:08:06,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 21:08:06,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:06,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:07,189 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:07,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136986153] [2025-03-16 21:08:07,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136986153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:07,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-16 21:08:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123152507] [2025-03-16 21:08:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 21:08:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:07,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 21:08:07,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:08:07,192 INFO L87 Difference]: Start difference. First operand 1492 states and 2215 transitions. Second operand has 17 states, 17 states have (on average 8.0) internal successors, (136), 16 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:09,494 INFO L93 Difference]: Finished difference Result 2925 states and 4329 transitions. [2025-03-16 21:08:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 21:08:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.0) internal successors, (136), 16 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-16 21:08:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:09,498 INFO L225 Difference]: With dead ends: 2925 [2025-03-16 21:08:09,499 INFO L226 Difference]: Without dead ends: 1600 [2025-03-16 21:08:09,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-03-16 21:08:09,500 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 2130 mSDsluCounter, 23444 mSDsCounter, 0 mSdLazyCounter, 6092 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 25121 SdHoareTripleChecker+Invalid, 6092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:09,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 25121 Invalid, 6092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6092 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 21:08:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-03-16 21:08:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1594. [2025-03-16 21:08:09,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 1.4795982423101066) internal successors, (2357), 1593 states have internal predecessors, (2357), 0 states have call successors, (0), 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:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 2357 transitions. [2025-03-16 21:08:09,514 INFO L78 Accepts]: Start accepts. Automaton has 1594 states and 2357 transitions. Word has length 136 [2025-03-16 21:08:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 1594 states and 2357 transitions. [2025-03-16 21:08:09,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.0) internal successors, (136), 16 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1594 states and 2357 transitions. [2025-03-16 21:08:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 21:08:09,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:09,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:08:09,515 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:09,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:09,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1225367566, now seen corresponding path program 1 times [2025-03-16 21:08:09,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:09,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570973865] [2025-03-16 21:08:09,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:09,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:09,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 21:08:09,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 21:08:09,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:09,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:09,854 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:09,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:09,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570973865] [2025-03-16 21:08:09,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570973865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:09,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:09,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:09,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006854534] [2025-03-16 21:08:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:09,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:09,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:09,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:09,858 INFO L87 Difference]: Start difference. First operand 1594 states and 2357 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:10,378 INFO L93 Difference]: Finished difference Result 3028 states and 4473 transitions. [2025-03-16 21:08:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:10,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-16 21:08:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:10,382 INFO L225 Difference]: With dead ends: 3028 [2025-03-16 21:08:10,382 INFO L226 Difference]: Without dead ends: 1603 [2025-03-16 21:08:10,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:10,384 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 1966 mSDsluCounter, 3376 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 5067 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:10,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 5067 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:08:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2025-03-16 21:08:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2025-03-16 21:08:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1602 states have (on average 1.4769038701622972) internal successors, (2366), 1602 states have internal predecessors, (2366), 0 states have call successors, (0), 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:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2366 transitions. [2025-03-16 21:08:10,398 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2366 transitions. Word has length 136 [2025-03-16 21:08:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:10,398 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2366 transitions. [2025-03-16 21:08:10,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2366 transitions. [2025-03-16 21:08:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 21:08:10,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:10,399 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] [2025-03-16 21:08:10,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:08:10,399 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1388500952, now seen corresponding path program 1 times [2025-03-16 21:08:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437224055] [2025-03-16 21:08:10,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:10,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:10,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 21:08:10,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 21:08:10,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:10,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:10,724 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,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:10,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437224055] [2025-03-16 21:08:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437224055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:10,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:10,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136812669] [2025-03-16 21:08:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:10,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:10,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:10,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:10,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:10,726 INFO L87 Difference]: Start difference. First operand 1603 states and 2366 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:11,335 INFO L93 Difference]: Finished difference Result 3036 states and 4478 transitions. [2025-03-16 21:08:11,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:11,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-16 21:08:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:11,338 INFO L225 Difference]: With dead ends: 3036 [2025-03-16 21:08:11,338 INFO L226 Difference]: Without dead ends: 1602 [2025-03-16 21:08:11,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:11,340 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 1989 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 5064 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:11,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 5064 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:08:11,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2025-03-16 21:08:11,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1602. [2025-03-16 21:08:11,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1601 states have (on average 1.4753279200499687) internal successors, (2362), 1601 states have internal predecessors, (2362), 0 states have call successors, (0), 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,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2362 transitions. [2025-03-16 21:08:11,353 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2362 transitions. Word has length 136 [2025-03-16 21:08:11,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:11,354 INFO L471 AbstractCegarLoop]: Abstraction has 1602 states and 2362 transitions. [2025-03-16 21:08:11,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:11,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2362 transitions. [2025-03-16 21:08:11,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 21:08:11,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:11,355 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] [2025-03-16 21:08:11,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:08:11,355 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:11,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:11,355 INFO L85 PathProgramCache]: Analyzing trace with hash -137679170, now seen corresponding path program 1 times [2025-03-16 21:08:11,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:11,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282748728] [2025-03-16 21:08:11,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:11,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:11,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 21:08:11,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 21:08:11,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:11,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:12,019 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:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282748728] [2025-03-16 21:08:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282748728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:12,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:12,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:12,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504203746] [2025-03-16 21:08:12,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:12,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:12,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:12,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:12,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:12,022 INFO L87 Difference]: Start difference. First operand 1602 states and 2362 transitions. Second operand has 10 states, 10 states have (on average 13.6) internal successors, (136), 9 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:15,660 INFO L93 Difference]: Finished difference Result 4066 states and 5982 transitions. [2025-03-16 21:08:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 9 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2025-03-16 21:08:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:15,664 INFO L225 Difference]: With dead ends: 4066 [2025-03-16 21:08:15,664 INFO L226 Difference]: Without dead ends: 2633 [2025-03-16 21:08:15,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:08:15,666 INFO L435 NwaCegarLoop]: 1743 mSDtfsCounter, 6604 mSDsluCounter, 7338 mSDsCounter, 0 mSdLazyCounter, 8453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6604 SdHoareTripleChecker+Valid, 9081 SdHoareTripleChecker+Invalid, 8455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:15,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6604 Valid, 9081 Invalid, 8455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8453 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 21:08:15,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-03-16 21:08:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 1633. [2025-03-16 21:08:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1632 states have (on average 1.4693627450980393) internal successors, (2398), 1632 states have internal predecessors, (2398), 0 states have call successors, (0), 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,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2398 transitions. [2025-03-16 21:08:15,683 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2398 transitions. Word has length 136 [2025-03-16 21:08:15,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:15,683 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2398 transitions. [2025-03-16 21:08:15,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.6) internal successors, (136), 9 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:08:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2398 transitions. [2025-03-16 21:08:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:15,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:15,684 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] [2025-03-16 21:08:15,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:08:15,684 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:15,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:15,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1275673718, now seen corresponding path program 1 times [2025-03-16 21:08:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619009159] [2025-03-16 21:08:15,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:15,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:15,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:15,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:15,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:16,320 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:16,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:16,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619009159] [2025-03-16 21:08:16,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619009159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:16,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:16,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:16,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616952132] [2025-03-16 21:08:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:16,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:16,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:16,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:16,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:16,321 INFO L87 Difference]: Start difference. First operand 1633 states and 2398 transitions. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:20,067 INFO L93 Difference]: Finished difference Result 4312 states and 6330 transitions. [2025-03-16 21:08:20,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:08:20,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:20,072 INFO L225 Difference]: With dead ends: 4312 [2025-03-16 21:08:20,072 INFO L226 Difference]: Without dead ends: 2848 [2025-03-16 21:08:20,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:08:20,075 INFO L435 NwaCegarLoop]: 1900 mSDtfsCounter, 5619 mSDsluCounter, 6755 mSDsCounter, 0 mSdLazyCounter, 7932 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5619 SdHoareTripleChecker+Valid, 8655 SdHoareTripleChecker+Invalid, 7932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:20,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5619 Valid, 8655 Invalid, 7932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7932 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-16 21:08:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2025-03-16 21:08:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1758. [2025-03-16 21:08:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1757 states have (on average 1.4598747865680137) internal successors, (2565), 1757 states have internal predecessors, (2565), 0 states have call successors, (0), 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:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2565 transitions. [2025-03-16 21:08:20,094 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2565 transitions. Word has length 137 [2025-03-16 21:08:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:20,094 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2565 transitions. [2025-03-16 21:08:20,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2565 transitions. [2025-03-16 21:08:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:20,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:20,095 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] [2025-03-16 21:08:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:08:20,095 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:20,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1765551546, now seen corresponding path program 1 times [2025-03-16 21:08:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879632921] [2025-03-16 21:08:20,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:20,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:20,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:20,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:20,793 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,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879632921] [2025-03-16 21:08:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879632921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901932357] [2025-03-16 21:08:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:20,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:20,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:20,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:20,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:20,797 INFO L87 Difference]: Start difference. First operand 1758 states and 2565 transitions. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:23,555 INFO L93 Difference]: Finished difference Result 4108 states and 5990 transitions. [2025-03-16 21:08:23,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:23,555 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:23,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:23,559 INFO L225 Difference]: With dead ends: 4108 [2025-03-16 21:08:23,559 INFO L226 Difference]: Without dead ends: 2519 [2025-03-16 21:08:23,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:08:23,561 INFO L435 NwaCegarLoop]: 1067 mSDtfsCounter, 8932 mSDsluCounter, 4260 mSDsCounter, 0 mSdLazyCounter, 5064 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8932 SdHoareTripleChecker+Valid, 5327 SdHoareTripleChecker+Invalid, 5064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:23,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8932 Valid, 5327 Invalid, 5064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5064 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 21:08:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2025-03-16 21:08:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1869. [2025-03-16 21:08:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1868 states have (on average 1.4528907922912206) internal successors, (2714), 1868 states have internal predecessors, (2714), 0 states have call successors, (0), 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,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2714 transitions. [2025-03-16 21:08:23,582 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2714 transitions. Word has length 137 [2025-03-16 21:08:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:23,582 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2714 transitions. [2025-03-16 21:08:23,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2714 transitions. [2025-03-16 21:08:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:23,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:23,583 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] [2025-03-16 21:08:23,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:08:23,583 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:23,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1923269568, now seen corresponding path program 1 times [2025-03-16 21:08:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:23,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151008934] [2025-03-16 21:08:23,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:23,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:23,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:23,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:23,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:24,643 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:24,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:24,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151008934] [2025-03-16 21:08:24,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151008934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:24,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:24,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-03-16 21:08:24,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924934714] [2025-03-16 21:08:24,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:24,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 21:08:24,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:24,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 21:08:24,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2025-03-16 21:08:24,644 INFO L87 Difference]: Start difference. First operand 1869 states and 2714 transitions. Second operand has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 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,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:27,409 INFO L93 Difference]: Finished difference Result 3595 states and 5207 transitions. [2025-03-16 21:08:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 21:08:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:27,413 INFO L225 Difference]: With dead ends: 3595 [2025-03-16 21:08:27,413 INFO L226 Difference]: Without dead ends: 1895 [2025-03-16 21:08:27,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2025-03-16 21:08:27,416 INFO L435 NwaCegarLoop]: 1674 mSDtfsCounter, 2084 mSDsluCounter, 30110 mSDsCounter, 0 mSdLazyCounter, 7744 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 31784 SdHoareTripleChecker+Invalid, 7744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:27,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 31784 Invalid, 7744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7744 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 21:08:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2025-03-16 21:08:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1889. [2025-03-16 21:08:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1888 states have (on average 1.4507415254237288) internal successors, (2739), 1888 states have internal predecessors, (2739), 0 states have call successors, (0), 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,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2739 transitions. [2025-03-16 21:08:27,469 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2739 transitions. Word has length 137 [2025-03-16 21:08:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:27,469 INFO L471 AbstractCegarLoop]: Abstraction has 1889 states and 2739 transitions. [2025-03-16 21:08:27,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2272727272727275) internal successors, (137), 21 states have internal predecessors, (137), 0 states have call successors, (0), 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,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2739 transitions. [2025-03-16 21:08:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:27,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:27,471 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] [2025-03-16 21:08:27,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:08:27,471 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:27,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash 909172074, now seen corresponding path program 1 times [2025-03-16 21:08:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:27,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070107930] [2025-03-16 21:08:27,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:27,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:27,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:27,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:27,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:27,783 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,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070107930] [2025-03-16 21:08:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070107930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:08:27,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326749382] [2025-03-16 21:08:27,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:27,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:08:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:27,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:08:27,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:08:27,786 INFO L87 Difference]: Start difference. First operand 1889 states and 2739 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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:28,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:28,329 INFO L93 Difference]: Finished difference Result 3626 states and 5249 transitions. [2025-03-16 21:08:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:08:28,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:28,333 INFO L225 Difference]: With dead ends: 3626 [2025-03-16 21:08:28,333 INFO L226 Difference]: Without dead ends: 1906 [2025-03-16 21:08:28,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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:28,334 INFO L435 NwaCegarLoop]: 1690 mSDtfsCounter, 1962 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 5064 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:28,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 5064 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:08:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1906 states. [2025-03-16 21:08:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1906. [2025-03-16 21:08:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1905 states have (on average 1.4477690288713911) internal successors, (2758), 1905 states have internal predecessors, (2758), 0 states have call successors, (0), 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:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2758 transitions. [2025-03-16 21:08:28,349 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2758 transitions. Word has length 137 [2025-03-16 21:08:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 1906 states and 2758 transitions. [2025-03-16 21:08:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 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:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2758 transitions. [2025-03-16 21:08:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:28,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:28,350 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] [2025-03-16 21:08:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:08:28,350 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:28,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash -382155650, now seen corresponding path program 1 times [2025-03-16 21:08:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665873828] [2025-03-16 21:08:28,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:28,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:28,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:28,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:28,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:29,204 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,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665873828] [2025-03-16 21:08:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665873828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-16 21:08:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391582805] [2025-03-16 21:08:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:29,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 21:08:29,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:29,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 21:08:29,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-03-16 21:08:29,206 INFO L87 Difference]: Start difference. First operand 1906 states and 2758 transitions. Second operand has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 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:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:31,525 INFO L93 Difference]: Finished difference Result 3698 states and 5335 transitions. [2025-03-16 21:08:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-16 21:08:31,525 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:31,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:31,529 INFO L225 Difference]: With dead ends: 3698 [2025-03-16 21:08:31,529 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 21:08:31,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-03-16 21:08:31,530 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 2128 mSDsluCounter, 25170 mSDsCounter, 0 mSdLazyCounter, 6442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2128 SdHoareTripleChecker+Valid, 26849 SdHoareTripleChecker+Invalid, 6443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:31,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2128 Valid, 26849 Invalid, 6443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6442 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 21:08:31,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 21:08:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1955. [2025-03-16 21:08:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.4442169907881268) internal successors, (2822), 1954 states have internal predecessors, (2822), 0 states have call successors, (0), 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:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2822 transitions. [2025-03-16 21:08:31,545 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2822 transitions. Word has length 137 [2025-03-16 21:08:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:31,546 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2822 transitions. [2025-03-16 21:08:31,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 18 states have internal predecessors, (137), 0 states have call successors, (0), 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:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2822 transitions. [2025-03-16 21:08:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:31,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:31,547 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] [2025-03-16 21:08:31,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:08:31,547 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:31,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 31348300, now seen corresponding path program 1 times [2025-03-16 21:08:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:31,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869273344] [2025-03-16 21:08:31,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:31,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:31,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:31,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:31,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:31,745 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,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:31,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869273344] [2025-03-16 21:08:31,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869273344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:31,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:31,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:31,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735321082] [2025-03-16 21:08:31,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:31,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:08:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:31,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:08:31,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:08:31,746 INFO L87 Difference]: Start difference. First operand 1955 states and 2822 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:33,443 INFO L93 Difference]: Finished difference Result 4371 states and 6317 transitions. [2025-03-16 21:08:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:08:33,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:33,447 INFO L225 Difference]: With dead ends: 4371 [2025-03-16 21:08:33,447 INFO L226 Difference]: Without dead ends: 2585 [2025-03-16 21:08:33,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:33,449 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 3917 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 3887 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3917 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:33,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3917 Valid, 4434 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3887 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 21:08:33,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2025-03-16 21:08:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 1927. [2025-03-16 21:08:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1926 states have (on average 1.4371754932502596) internal successors, (2768), 1926 states have internal predecessors, (2768), 0 states have call successors, (0), 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:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2768 transitions. [2025-03-16 21:08:33,468 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2768 transitions. Word has length 137 [2025-03-16 21:08:33,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:33,468 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2768 transitions. [2025-03-16 21:08:33,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2768 transitions. [2025-03-16 21:08:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:33,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:33,470 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] [2025-03-16 21:08:33,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:08:33,471 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:33,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1355498403, now seen corresponding path program 1 times [2025-03-16 21:08:33,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:33,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378895624] [2025-03-16 21:08:33,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:33,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:33,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:33,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:33,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:33,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:33,780 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,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:33,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378895624] [2025-03-16 21:08:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378895624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:33,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:08:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248384859] [2025-03-16 21:08:33,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:33,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:08:33,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:33,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:08:33,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:08:33,782 INFO L87 Difference]: Start difference. First operand 1927 states and 2768 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:35,690 INFO L93 Difference]: Finished difference Result 4894 states and 7047 transitions. [2025-03-16 21:08:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:08:35,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:35,697 INFO L225 Difference]: With dead ends: 4894 [2025-03-16 21:08:35,697 INFO L226 Difference]: Without dead ends: 3136 [2025-03-16 21:08:35,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:08:35,700 INFO L435 NwaCegarLoop]: 1255 mSDtfsCounter, 5080 mSDsluCounter, 3384 mSDsCounter, 0 mSdLazyCounter, 3676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5080 SdHoareTripleChecker+Valid, 4639 SdHoareTripleChecker+Invalid, 3676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:35,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5080 Valid, 4639 Invalid, 3676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3676 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 21:08:35,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-03-16 21:08:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 1922. [2025-03-16 21:08:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1921 states have (on average 1.435710567412806) internal successors, (2758), 1921 states have internal predecessors, (2758), 0 states have call successors, (0), 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:35,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2758 transitions. [2025-03-16 21:08:35,724 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2758 transitions. Word has length 137 [2025-03-16 21:08:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:35,724 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2758 transitions. [2025-03-16 21:08:35,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 5 states have internal predecessors, (137), 0 states have call successors, (0), 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:35,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2758 transitions. [2025-03-16 21:08:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:35,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:35,726 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] [2025-03-16 21:08:35,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:08:35,727 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:35,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:35,727 INFO L85 PathProgramCache]: Analyzing trace with hash 447173761, now seen corresponding path program 1 times [2025-03-16 21:08:35,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:35,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69507768] [2025-03-16 21:08:35,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:35,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:35,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:35,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:35,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:36,354 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:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:36,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69507768] [2025-03-16 21:08:36,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69507768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:36,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:36,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785112661] [2025-03-16 21:08:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:36,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:36,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:36,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:36,356 INFO L87 Difference]: Start difference. First operand 1922 states and 2758 transitions. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:39,977 INFO L93 Difference]: Finished difference Result 4849 states and 6951 transitions. [2025-03-16 21:08:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:39,978 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:39,981 INFO L225 Difference]: With dead ends: 4849 [2025-03-16 21:08:39,981 INFO L226 Difference]: Without dead ends: 3096 [2025-03-16 21:08:39,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:08:39,983 INFO L435 NwaCegarLoop]: 1743 mSDtfsCounter, 4588 mSDsluCounter, 7338 mSDsCounter, 0 mSdLazyCounter, 8449 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4588 SdHoareTripleChecker+Valid, 9081 SdHoareTripleChecker+Invalid, 8451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:39,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4588 Valid, 9081 Invalid, 8451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8449 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-16 21:08:39,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2025-03-16 21:08:40,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 2242. [2025-03-16 21:08:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2241 states have (on average 1.4154395359214635) internal successors, (3172), 2241 states have internal predecessors, (3172), 0 states have call successors, (0), 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,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3172 transitions. [2025-03-16 21:08:40,005 INFO L78 Accepts]: Start accepts. Automaton has 2242 states and 3172 transitions. Word has length 137 [2025-03-16 21:08:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:40,005 INFO L471 AbstractCegarLoop]: Abstraction has 2242 states and 3172 transitions. [2025-03-16 21:08:40,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2242 states and 3172 transitions. [2025-03-16 21:08:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:40,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:40,006 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] [2025-03-16 21:08:40,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:08:40,007 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:40,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:40,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1583285231, now seen corresponding path program 1 times [2025-03-16 21:08:40,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:40,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656645903] [2025-03-16 21:08:40,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:40,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:40,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:40,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:40,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:40,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:40,602 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:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:40,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656645903] [2025-03-16 21:08:40,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656645903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:40,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:40,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:08:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213165268] [2025-03-16 21:08:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:40,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:08:40,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:40,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:08:40,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:08:40,603 INFO L87 Difference]: Start difference. First operand 2242 states and 3172 transitions. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:43,870 INFO L93 Difference]: Finished difference Result 4970 states and 7060 transitions. [2025-03-16 21:08:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:43,870 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:43,872 INFO L225 Difference]: With dead ends: 4970 [2025-03-16 21:08:43,872 INFO L226 Difference]: Without dead ends: 2897 [2025-03-16 21:08:43,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-16 21:08:43,874 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 5075 mSDsluCounter, 6860 mSDsCounter, 0 mSdLazyCounter, 7889 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5075 SdHoareTripleChecker+Valid, 8441 SdHoareTripleChecker+Invalid, 7890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:43,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5075 Valid, 8441 Invalid, 7890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7889 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 21:08:43,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2025-03-16 21:08:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2210. [2025-03-16 21:08:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2210 states, 2209 states have (on average 1.416025350837483) internal successors, (3128), 2209 states have internal predecessors, (3128), 0 states have call successors, (0), 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:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 3128 transitions. [2025-03-16 21:08:43,890 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 3128 transitions. Word has length 137 [2025-03-16 21:08:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 2210 states and 3128 transitions. [2025-03-16 21:08:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 9 states have internal predecessors, (137), 0 states have call successors, (0), 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:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 3128 transitions. [2025-03-16 21:08:43,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 21:08:43,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:43,892 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] [2025-03-16 21:08:43,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:08:43,892 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:43,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 12788116, now seen corresponding path program 1 times [2025-03-16 21:08:43,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820741981] [2025-03-16 21:08:43,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:43,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 21:08:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 21:08:43,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:43,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:44,256 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:44,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:44,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820741981] [2025-03-16 21:08:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820741981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:44,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:44,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:08:44,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828855305] [2025-03-16 21:08:44,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:44,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:08:44,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:44,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:08:44,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:08:44,257 INFO L87 Difference]: Start difference. First operand 2210 states and 3128 transitions. Second operand has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:08:47,179 INFO L93 Difference]: Finished difference Result 5226 states and 7398 transitions. [2025-03-16 21:08:47,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:08:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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 137 [2025-03-16 21:08:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:08:47,181 INFO L225 Difference]: With dead ends: 5226 [2025-03-16 21:08:47,181 INFO L226 Difference]: Without dead ends: 3185 [2025-03-16 21:08:47,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:08:47,183 INFO L435 NwaCegarLoop]: 1584 mSDtfsCounter, 5041 mSDsluCounter, 5805 mSDsCounter, 0 mSdLazyCounter, 6902 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5041 SdHoareTripleChecker+Valid, 7389 SdHoareTripleChecker+Invalid, 6902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:08:47,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5041 Valid, 7389 Invalid, 6902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6902 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 21:08:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2025-03-16 21:08:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 2514. [2025-03-16 21:08:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2514 states, 2513 states have (on average 1.4046955829685634) internal successors, (3530), 2513 states have internal predecessors, (3530), 0 states have call successors, (0), 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,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 3530 transitions. [2025-03-16 21:08:47,202 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 3530 transitions. Word has length 137 [2025-03-16 21:08:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:08:47,202 INFO L471 AbstractCegarLoop]: Abstraction has 2514 states and 3530 transitions. [2025-03-16 21:08:47,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.125) internal successors, (137), 7 states have internal predecessors, (137), 0 states have call successors, (0), 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,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 3530 transitions. [2025-03-16 21:08:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-16 21:08:47,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:08:47,203 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] [2025-03-16 21:08:47,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:08:47,204 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:08:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:08:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1381934911, now seen corresponding path program 1 times [2025-03-16 21:08:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:08:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284054849] [2025-03-16 21:08:47,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:08:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:08:47,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-16 21:08:47,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-16 21:08:47,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:08:47,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:08:47,832 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:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:08:47,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284054849] [2025-03-16 21:08:47,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284054849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:08:47,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:08:47,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:08:47,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695969699] [2025-03-16 21:08:47,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:08:47,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:08:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:08:47,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:08:47,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:08:47,833 INFO L87 Difference]: Start difference. First operand 2514 states and 3530 transitions. Second operand has 9 states, 9 states have (on average 15.333333333333334) internal successors, (138), 8 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)