./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_15-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:45:25,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:45:25,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:45:25,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:45:25,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:45:25,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:45:25,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:45:25,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:45:25,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:45:25,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:45:25,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:45:25,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:45:25,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:45:25,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:45:25,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:45:25,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:45:25,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:45:25,594 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:45:25,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:45:25,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:45:25,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:45:25,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:45:25,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:45:25,596 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2025-03-03 09:45:25,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:45:25,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:45:25,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:45:25,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:45:25,838 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:45:25,840 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2025-03-03 09:45:27,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1781455/ed647b65600d4a78903b3658855b465b/FLAG37a5e3e60 [2025-03-03 09:45:27,237 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:45:27,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2025-03-03 09:45:27,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1781455/ed647b65600d4a78903b3658855b465b/FLAG37a5e3e60 [2025-03-03 09:45:27,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef1781455/ed647b65600d4a78903b3658855b465b [2025-03-03 09:45:27,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:45:27,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:45:27,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:45:27,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:45:27,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:45:27,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27, skipping insertion in model container [2025-03-03 09:45:27,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:45:27,734 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/locks/test_locks_15-2.c[5628,5641] [2025-03-03 09:45:27,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:45:27,747 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:45:27,770 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/locks/test_locks_15-2.c[5628,5641] [2025-03-03 09:45:27,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:45:27,789 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:45:27,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27 WrapperNode [2025-03-03 09:45:27,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:45:27,790 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:45:27,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:45:27,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:45:27,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,822 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 205 [2025-03-03 09:45:27,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:45:27,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:45:27,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:45:27,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:45:27,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:45:27,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,850 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:45:27,861 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:45:27,861 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:45:27,861 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:45:27,865 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (1/1) ... [2025-03-03 09:45:27,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:45:27,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:45:27,894 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:45:27,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:45:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:45:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:45:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:45:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:45:27,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:45:27,965 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:45:28,219 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-03 09:45:28,223 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:45:28,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:45:28,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:45:28,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:28 BoogieIcfgContainer [2025-03-03 09:45:28,236 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:45:28,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:45:28,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:45:28,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:45:28,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:45:27" (1/3) ... [2025-03-03 09:45:28,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c38f54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:28, skipping insertion in model container [2025-03-03 09:45:28,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:45:27" (2/3) ... [2025-03-03 09:45:28,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c38f54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:45:28, skipping insertion in model container [2025-03-03 09:45:28,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:45:28" (3/3) ... [2025-03-03 09:45:28,244 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2025-03-03 09:45:28,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:45:28,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_15-2.c that has 1 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:45:28,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:45:28,310 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;@44da33a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:45:28,311 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:45:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:45:28,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:28,319 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] [2025-03-03 09:45:28,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash 92142694, now seen corresponding path program 1 times [2025-03-03 09:45:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704983140] [2025-03-03 09:45:28,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:28,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:45:28,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:45:28,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:28,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:28,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:28,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:28,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704983140] [2025-03-03 09:45:28,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704983140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:28,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:28,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908870496] [2025-03-03 09:45:28,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:28,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:28,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:28,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,527 INFO L87 Difference]: Start difference. First operand has 55 states, 53 states have (on average 1.9056603773584906) internal successors, (101), 54 states have internal predecessors, (101), 0 states have call successors, (0), 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 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:28,567 INFO L93 Difference]: Finished difference Result 111 states and 202 transitions. [2025-03-03 09:45:28,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:28,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-03 09:45:28,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:28,578 INFO L225 Difference]: With dead ends: 111 [2025-03-03 09:45:28,578 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:45:28,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,582 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 75 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:28,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 197 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:45:28,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2025-03-03 09:45:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 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-03 09:45:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2025-03-03 09:45:28,611 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2025-03-03 09:45:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:28,612 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2025-03-03 09:45:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2025-03-03 09:45:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:45:28,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:28,612 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] [2025-03-03 09:45:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:45:28,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -904929659, now seen corresponding path program 1 times [2025-03-03 09:45:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:28,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-03-03 09:45:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:28,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:45:28,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:45:28,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:28,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:28,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:28,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050576505] [2025-03-03 09:45:28,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050576505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:28,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:28,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941085293] [2025-03-03 09:45:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:28,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:28,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:28,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,684 INFO L87 Difference]: Start difference. First operand 67 states and 126 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:28,704 INFO L93 Difference]: Finished difference Result 164 states and 309 transitions. [2025-03-03 09:45:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-03 09:45:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:28,706 INFO L225 Difference]: With dead ends: 164 [2025-03-03 09:45:28,706 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:45:28,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,707 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 73 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:28,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:45:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2025-03-03 09:45:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2025-03-03 09:45:28,714 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2025-03-03 09:45:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:28,714 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2025-03-03 09:45:28,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2025-03-03 09:45:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:45:28,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:28,715 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] [2025-03-03 09:45:28,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:45:28,715 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:28,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:28,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1438514856, now seen corresponding path program 1 times [2025-03-03 09:45:28,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:28,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-03 09:45:28,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:28,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:28,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:45:28,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:45:28,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:28,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-03 09:45:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418507168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:28,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:28,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:28,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322524312] [2025-03-03 09:45:28,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:28,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:28,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:28,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,789 INFO L87 Difference]: Start difference. First operand 97 states and 182 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:28,811 INFO L93 Difference]: Finished difference Result 150 states and 276 transitions. [2025-03-03 09:45:28,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:28,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 09:45:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:28,813 INFO L225 Difference]: With dead ends: 150 [2025-03-03 09:45:28,813 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 09:45:28,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,814 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 75 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:28,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 240 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 09:45:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-03-03 09:45:28,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2025-03-03 09:45:28,826 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2025-03-03 09:45:28,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:28,826 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2025-03-03 09:45:28,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2025-03-03 09:45:28,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:45:28,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:28,827 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] [2025-03-03 09:45:28,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:45:28,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:28,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:28,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2011980569, now seen corresponding path program 1 times [2025-03-03 09:45:28,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:28,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-03 09:45:28,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:28,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:45:28,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:45:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:28,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:28,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-03 09:45:28,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334140648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:28,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:28,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:28,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823142964] [2025-03-03 09:45:28,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:28,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:28,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:28,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:28,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,898 INFO L87 Difference]: Start difference. First operand 100 states and 184 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:28,917 INFO L93 Difference]: Finished difference Result 193 states and 357 transitions. [2025-03-03 09:45:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 09:45:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:28,919 INFO L225 Difference]: With dead ends: 193 [2025-03-03 09:45:28,919 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 09:45:28,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:28,920 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 70 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:28,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 185 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 09:45:28,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 133. [2025-03-03 09:45:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2025-03-03 09:45:28,930 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2025-03-03 09:45:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:28,930 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2025-03-03 09:45:28,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2025-03-03 09:45:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:45:28,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:28,931 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] [2025-03-03 09:45:28,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:45:28,931 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:28,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1014908216, now seen corresponding path program 1 times [2025-03-03 09:45:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:28,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-03-03 09:45:28,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:28,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:45:28,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:45:28,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:28,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:28,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:28,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-03-03 09:45:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068833806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:28,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963213331] [2025-03-03 09:45:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:28,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:28,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,002 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,024 INFO L93 Difference]: Finished difference Result 321 states and 595 transitions. [2025-03-03 09:45:29,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 09:45:29,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,025 INFO L225 Difference]: With dead ends: 321 [2025-03-03 09:45:29,025 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 09:45:29,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,026 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 09:45:29,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-03-03 09:45:29,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2025-03-03 09:45:29,033 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2025-03-03 09:45:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,033 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2025-03-03 09:45:29,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2025-03-03 09:45:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:45:29,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,034 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] [2025-03-03 09:45:29,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:45:29,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2053083092, now seen corresponding path program 1 times [2025-03-03 09:45:29,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848746356] [2025-03-03 09:45:29,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:45:29,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:45:29,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848746356] [2025-03-03 09:45:29,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848746356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842533449] [2025-03-03 09:45:29,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,071 INFO L87 Difference]: Start difference. First operand 191 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,087 INFO L93 Difference]: Finished difference Result 288 states and 526 transitions. [2025-03-03 09:45:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-03 09:45:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,089 INFO L225 Difference]: With dead ends: 288 [2025-03-03 09:45:29,090 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 09:45:29,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,091 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 74 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 09:45:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-03-03 09:45:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2025-03-03 09:45:29,109 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2025-03-03 09:45:29,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,109 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2025-03-03 09:45:29,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,109 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2025-03-03 09:45:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:45:29,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:29,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:45:29,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1397412333, now seen corresponding path program 1 times [2025-03-03 09:45:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899638121] [2025-03-03 09:45:29,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:45:29,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:45:29,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899638121] [2025-03-03 09:45:29,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899638121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163281213] [2025-03-03 09:45:29,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,148 INFO L87 Difference]: Start difference. First operand 193 states and 351 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,159 INFO L93 Difference]: Finished difference Result 369 states and 677 transitions. [2025-03-03 09:45:29,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-03 09:45:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,161 INFO L225 Difference]: With dead ends: 369 [2025-03-03 09:45:29,161 INFO L226 Difference]: Without dead ends: 367 [2025-03-03 09:45:29,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,162 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 67 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 183 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-03 09:45:29,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 261. [2025-03-03 09:45:29,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.8115384615384615) internal successors, (471), 260 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 471 transitions. [2025-03-03 09:45:29,170 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 471 transitions. Word has length 24 [2025-03-03 09:45:29,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,170 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 471 transitions. [2025-03-03 09:45:29,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 471 transitions. [2025-03-03 09:45:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:45:29,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,171 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] [2025-03-03 09:45:29,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:45:29,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 400339980, now seen corresponding path program 1 times [2025-03-03 09:45:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712830896] [2025-03-03 09:45:29,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:45:29,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:45:29,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712830896] [2025-03-03 09:45:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712830896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690543867] [2025-03-03 09:45:29,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,196 INFO L87 Difference]: Start difference. First operand 261 states and 471 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,210 INFO L93 Difference]: Finished difference Result 629 states and 1141 transitions. [2025-03-03 09:45:29,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-03 09:45:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,212 INFO L225 Difference]: With dead ends: 629 [2025-03-03 09:45:29,212 INFO L226 Difference]: Without dead ends: 375 [2025-03-03 09:45:29,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,213 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 71 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-03 09:45:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2025-03-03 09:45:29,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2025-03-03 09:45:29,230 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2025-03-03 09:45:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,230 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2025-03-03 09:45:29,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2025-03-03 09:45:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:45:29,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,231 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] [2025-03-03 09:45:29,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:45:29,233 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash 370137855, now seen corresponding path program 1 times [2025-03-03 09:45:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344709321] [2025-03-03 09:45:29,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:45:29,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:45:29,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344709321] [2025-03-03 09:45:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344709321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302607976] [2025-03-03 09:45:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,265 INFO L87 Difference]: Start difference. First operand 373 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,279 INFO L93 Difference]: Finished difference Result 561 states and 1005 transitions. [2025-03-03 09:45:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 09:45:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,281 INFO L225 Difference]: With dead ends: 561 [2025-03-03 09:45:29,281 INFO L226 Difference]: Without dead ends: 379 [2025-03-03 09:45:29,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,282 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 73 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 232 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-03 09:45:29,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2025-03-03 09:45:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.7845744680851063) internal successors, (671), 376 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 671 transitions. [2025-03-03 09:45:29,294 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 671 transitions. Word has length 25 [2025-03-03 09:45:29,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,296 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 671 transitions. [2025-03-03 09:45:29,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,296 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 671 transitions. [2025-03-03 09:45:29,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:45:29,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,297 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] [2025-03-03 09:45:29,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:45:29,297 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -474334016, now seen corresponding path program 1 times [2025-03-03 09:45:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579572771] [2025-03-03 09:45:29,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:45:29,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:45:29,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579572771] [2025-03-03 09:45:29,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579572771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513272597] [2025-03-03 09:45:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,323 INFO L87 Difference]: Start difference. First operand 377 states and 671 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,338 INFO L93 Difference]: Finished difference Result 713 states and 1285 transitions. [2025-03-03 09:45:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 09:45:29,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,341 INFO L225 Difference]: With dead ends: 713 [2025-03-03 09:45:29,341 INFO L226 Difference]: Without dead ends: 711 [2025-03-03 09:45:29,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,342 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 64 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 181 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-03 09:45:29,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 517. [2025-03-03 09:45:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.7577519379844961) internal successors, (907), 516 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 907 transitions. [2025-03-03 09:45:29,353 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 907 transitions. Word has length 25 [2025-03-03 09:45:29,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,354 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 907 transitions. [2025-03-03 09:45:29,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,354 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 907 transitions. [2025-03-03 09:45:29,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:45:29,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,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] [2025-03-03 09:45:29,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:45:29,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1471406369, now seen corresponding path program 1 times [2025-03-03 09:45:29,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931583045] [2025-03-03 09:45:29,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:45:29,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:45:29,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931583045] [2025-03-03 09:45:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931583045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476091697] [2025-03-03 09:45:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,381 INFO L87 Difference]: Start difference. First operand 517 states and 907 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,403 INFO L93 Difference]: Finished difference Result 1241 states and 2189 transitions. [2025-03-03 09:45:29,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-03 09:45:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,406 INFO L225 Difference]: With dead ends: 1241 [2025-03-03 09:45:29,406 INFO L226 Difference]: Without dead ends: 735 [2025-03-03 09:45:29,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,410 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 70 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-03 09:45:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 733. [2025-03-03 09:45:29,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 1.7527322404371584) internal successors, (1283), 732 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1283 transitions. [2025-03-03 09:45:29,448 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1283 transitions. Word has length 25 [2025-03-03 09:45:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,450 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1283 transitions. [2025-03-03 09:45:29,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1283 transitions. [2025-03-03 09:45:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:45:29,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,451 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] [2025-03-03 09:45:29,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:45:29,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1819424333, now seen corresponding path program 1 times [2025-03-03 09:45:29,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783627876] [2025-03-03 09:45:29,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:45:29,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:45:29,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783627876] [2025-03-03 09:45:29,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783627876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243821254] [2025-03-03 09:45:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,483 INFO L87 Difference]: Start difference. First operand 733 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,503 INFO L93 Difference]: Finished difference Result 1101 states and 1921 transitions. [2025-03-03 09:45:29,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 09:45:29,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,507 INFO L225 Difference]: With dead ends: 1101 [2025-03-03 09:45:29,507 INFO L226 Difference]: Without dead ends: 743 [2025-03-03 09:45:29,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,508 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 72 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 228 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-03 09:45:29,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2025-03-03 09:45:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7337837837837837) internal successors, (1283), 740 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1283 transitions. [2025-03-03 09:45:29,527 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1283 transitions. Word has length 26 [2025-03-03 09:45:29,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,527 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1283 transitions. [2025-03-03 09:45:29,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,528 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1283 transitions. [2025-03-03 09:45:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:45:29,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,528 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] [2025-03-03 09:45:29,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:45:29,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1631071092, now seen corresponding path program 1 times [2025-03-03 09:45:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-03-03 09:45:29,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:45:29,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:45:29,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203482575] [2025-03-03 09:45:29,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203482575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400160607] [2025-03-03 09:45:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,549 INFO L87 Difference]: Start difference. First operand 741 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,575 INFO L93 Difference]: Finished difference Result 1385 states and 2437 transitions. [2025-03-03 09:45:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 09:45:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,579 INFO L225 Difference]: With dead ends: 1385 [2025-03-03 09:45:29,579 INFO L226 Difference]: Without dead ends: 1383 [2025-03-03 09:45:29,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,581 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 61 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-03 09:45:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1029. [2025-03-03 09:45:29,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.6994163424124513) internal successors, (1747), 1028 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1747 transitions. [2025-03-03 09:45:29,607 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1747 transitions. Word has length 26 [2025-03-03 09:45:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,607 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1747 transitions. [2025-03-03 09:45:29,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1747 transitions. [2025-03-03 09:45:29,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:45:29,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,609 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] [2025-03-03 09:45:29,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:45:29,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,609 INFO L85 PathProgramCache]: Analyzing trace with hash 633998739, now seen corresponding path program 1 times [2025-03-03 09:45:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268577513] [2025-03-03 09:45:29,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 09:45:29,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:45:29,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268577513] [2025-03-03 09:45:29,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268577513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392192894] [2025-03-03 09:45:29,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,636 INFO L87 Difference]: Start difference. First operand 1029 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,668 INFO L93 Difference]: Finished difference Result 2457 states and 4197 transitions. [2025-03-03 09:45:29,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 09:45:29,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,673 INFO L225 Difference]: With dead ends: 2457 [2025-03-03 09:45:29,673 INFO L226 Difference]: Without dead ends: 1447 [2025-03-03 09:45:29,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,676 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 69 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-03-03 09:45:29,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1445. [2025-03-03 09:45:29,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.6973684210526316) internal successors, (2451), 1444 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2451 transitions. [2025-03-03 09:45:29,708 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2451 transitions. Word has length 26 [2025-03-03 09:45:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,709 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2451 transitions. [2025-03-03 09:45:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2451 transitions. [2025-03-03 09:45:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:45:29,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,710 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] [2025-03-03 09:45:29,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:45:29,711 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,711 INFO L85 PathProgramCache]: Analyzing trace with hash -976375642, now seen corresponding path program 1 times [2025-03-03 09:45:29,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-03 09:45:29,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:45:29,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:45:29,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-03 09:45:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571360977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181813688] [2025-03-03 09:45:29,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,731 INFO L87 Difference]: Start difference. First operand 1445 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,768 INFO L93 Difference]: Finished difference Result 2169 states and 3669 transitions. [2025-03-03 09:45:29,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-03 09:45:29,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,772 INFO L225 Difference]: With dead ends: 2169 [2025-03-03 09:45:29,773 INFO L226 Difference]: Without dead ends: 1463 [2025-03-03 09:45:29,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,774 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 71 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2025-03-03 09:45:29,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1461. [2025-03-03 09:45:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.6787671232876713) internal successors, (2451), 1460 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2451 transitions. [2025-03-03 09:45:29,802 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2451 transitions. Word has length 27 [2025-03-03 09:45:29,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,802 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2451 transitions. [2025-03-03 09:45:29,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2451 transitions. [2025-03-03 09:45:29,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:45:29,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,803 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] [2025-03-03 09:45:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:45:29,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1820847513, now seen corresponding path program 1 times [2025-03-03 09:45:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526938427] [2025-03-03 09:45:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:45:29,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:45:29,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526938427] [2025-03-03 09:45:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526938427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383081123] [2025-03-03 09:45:29,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,829 INFO L87 Difference]: Start difference. First operand 1461 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,860 INFO L93 Difference]: Finished difference Result 2697 states and 4613 transitions. [2025-03-03 09:45:29,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-03 09:45:29,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,868 INFO L225 Difference]: With dead ends: 2697 [2025-03-03 09:45:29,868 INFO L226 Difference]: Without dead ends: 2695 [2025-03-03 09:45:29,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,870 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 58 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 177 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2025-03-03 09:45:29,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2053. [2025-03-03 09:45:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.6388888888888888) internal successors, (3363), 2052 states have internal predecessors, (3363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3363 transitions. [2025-03-03 09:45:29,915 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3363 transitions. Word has length 27 [2025-03-03 09:45:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:29,915 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3363 transitions. [2025-03-03 09:45:29,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3363 transitions. [2025-03-03 09:45:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:45:29,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:29,918 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] [2025-03-03 09:45:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 09:45:29,918 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1477047430, now seen corresponding path program 1 times [2025-03-03 09:45:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622109940] [2025-03-03 09:45:29,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:29,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:45:29,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:45:29,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:29,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:29,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622109940] [2025-03-03 09:45:29,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622109940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:29,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:29,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16997762] [2025-03-03 09:45:29,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:29,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:29,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:29,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,945 INFO L87 Difference]: Start difference. First operand 2053 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:29,989 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2025-03-03 09:45:29,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:29,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-03 09:45:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:29,996 INFO L225 Difference]: With dead ends: 4873 [2025-03-03 09:45:29,997 INFO L226 Difference]: Without dead ends: 2855 [2025-03-03 09:45:29,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:29,999 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:29,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:30,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2025-03-03 09:45:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2853. [2025-03-03 09:45:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.6392005610098177) internal successors, (4675), 2852 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4675 transitions. [2025-03-03 09:45:30,073 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4675 transitions. Word has length 27 [2025-03-03 09:45:30,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:30,073 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4675 transitions. [2025-03-03 09:45:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4675 transitions. [2025-03-03 09:45:30,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:45:30,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:30,075 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] [2025-03-03 09:45:30,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:45:30,076 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:30,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:30,076 INFO L85 PathProgramCache]: Analyzing trace with hash -611670214, now seen corresponding path program 1 times [2025-03-03 09:45:30,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-03 09:45:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:30,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:45:30,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:45:30,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:30,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:30,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:30,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120358721] [2025-03-03 09:45:30,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120358721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:30,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:30,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:30,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669009417] [2025-03-03 09:45:30,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:30,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:30,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:30,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:30,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,097 INFO L87 Difference]: Start difference. First operand 2853 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:30,132 INFO L93 Difference]: Finished difference Result 4281 states and 6997 transitions. [2025-03-03 09:45:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 09:45:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:30,140 INFO L225 Difference]: With dead ends: 4281 [2025-03-03 09:45:30,140 INFO L226 Difference]: Without dead ends: 2887 [2025-03-03 09:45:30,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,142 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:30,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:30,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2025-03-03 09:45:30,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2885. [2025-03-03 09:45:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6210124826629682) internal successors, (4675), 2884 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4675 transitions. [2025-03-03 09:45:30,218 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4675 transitions. Word has length 28 [2025-03-03 09:45:30,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:30,218 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4675 transitions. [2025-03-03 09:45:30,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4675 transitions. [2025-03-03 09:45:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:45:30,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:30,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:45:30,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 09:45:30,220 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:30,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1456142085, now seen corresponding path program 1 times [2025-03-03 09:45:30,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:30,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87426483] [2025-03-03 09:45:30,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:30,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:45:30,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:45:30,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:30,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87426483] [2025-03-03 09:45:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87426483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472776049] [2025-03-03 09:45:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:30,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:30,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:30,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,242 INFO L87 Difference]: Start difference. First operand 2885 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:30,307 INFO L93 Difference]: Finished difference Result 8457 states and 13637 transitions. [2025-03-03 09:45:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:30,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 09:45:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:30,327 INFO L225 Difference]: With dead ends: 8457 [2025-03-03 09:45:30,328 INFO L226 Difference]: Without dead ends: 5639 [2025-03-03 09:45:30,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,333 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:30,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 187 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2025-03-03 09:45:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5637. [2025-03-03 09:45:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.5903122782114976) internal successors, (8963), 5636 states have internal predecessors, (8963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8963 transitions. [2025-03-03 09:45:30,474 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8963 transitions. Word has length 28 [2025-03-03 09:45:30,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:30,475 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 8963 transitions. [2025-03-03 09:45:30,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8963 transitions. [2025-03-03 09:45:30,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:45:30,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:30,480 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] [2025-03-03 09:45:30,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 09:45:30,480 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:30,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -459069732, now seen corresponding path program 1 times [2025-03-03 09:45:30,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411159618] [2025-03-03 09:45:30,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:30,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:45:30,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:45:30,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:30,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:30,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411159618] [2025-03-03 09:45:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411159618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:30,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:30,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62823847] [2025-03-03 09:45:30,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:30,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:30,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:30,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,504 INFO L87 Difference]: Start difference. First operand 5637 states and 8963 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:30,590 INFO L93 Difference]: Finished difference Result 6793 states and 11141 transitions. [2025-03-03 09:45:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-03 09:45:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:30,608 INFO L225 Difference]: With dead ends: 6793 [2025-03-03 09:45:30,609 INFO L226 Difference]: Without dead ends: 6791 [2025-03-03 09:45:30,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,612 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 55 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:30,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 240 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:30,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6791 states. [2025-03-03 09:45:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6791 to 5637. [2025-03-03 09:45:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.578956706884315) internal successors, (8899), 5636 states have internal predecessors, (8899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8899 transitions. [2025-03-03 09:45:30,769 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8899 transitions. Word has length 28 [2025-03-03 09:45:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:30,769 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 8899 transitions. [2025-03-03 09:45:30,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8899 transitions. [2025-03-03 09:45:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:45:30,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:30,773 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] [2025-03-03 09:45:30,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 09:45:30,773 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:30,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:30,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2104263245, now seen corresponding path program 1 times [2025-03-03 09:45:30,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341419037] [2025-03-03 09:45:30,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:30,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:30,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:45:30,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:45:30,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:30,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:30,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341419037] [2025-03-03 09:45:30,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341419037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:30,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:30,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568105682] [2025-03-03 09:45:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:30,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:30,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:30,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,801 INFO L87 Difference]: Start difference. First operand 5637 states and 8899 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:30,879 INFO L93 Difference]: Finished difference Result 10185 states and 16453 transitions. [2025-03-03 09:45:30,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:30,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-03 09:45:30,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:30,896 INFO L225 Difference]: With dead ends: 10185 [2025-03-03 09:45:30,896 INFO L226 Difference]: Without dead ends: 10183 [2025-03-03 09:45:30,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:30,901 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:30,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10183 states. [2025-03-03 09:45:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10183 to 8133. [2025-03-03 09:45:31,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8133 states, 8132 states have (on average 1.5350467289719627) internal successors, (12483), 8132 states have internal predecessors, (12483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8133 states to 8133 states and 12483 transitions. [2025-03-03 09:45:31,067 INFO L78 Accepts]: Start accepts. Automaton has 8133 states and 12483 transitions. Word has length 29 [2025-03-03 09:45:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:31,067 INFO L471 AbstractCegarLoop]: Abstraction has 8133 states and 12483 transitions. [2025-03-03 09:45:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 8133 states and 12483 transitions. [2025-03-03 09:45:31,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:45:31,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:31,074 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] [2025-03-03 09:45:31,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 09:45:31,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:31,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:31,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1107190892, now seen corresponding path program 1 times [2025-03-03 09:45:31,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:31,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338131627] [2025-03-03 09:45:31,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:31,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:31,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:45:31,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:45:31,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:31,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:31,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338131627] [2025-03-03 09:45:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338131627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:31,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:31,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645114975] [2025-03-03 09:45:31,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:31,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:31,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:31,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:31,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:31,092 INFO L87 Difference]: Start difference. First operand 8133 states and 12483 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:31,207 INFO L93 Difference]: Finished difference Result 19145 states and 29637 transitions. [2025-03-03 09:45:31,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:31,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-03 09:45:31,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:31,223 INFO L225 Difference]: With dead ends: 19145 [2025-03-03 09:45:31,223 INFO L226 Difference]: Without dead ends: 11079 [2025-03-03 09:45:31,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:31,231 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 66 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:31,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:31,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11079 states. [2025-03-03 09:45:31,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11079 to 11077. [2025-03-03 09:45:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11077 states, 11076 states have (on average 1.5372878295413506) internal successors, (17027), 11076 states have internal predecessors, (17027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11077 states to 11077 states and 17027 transitions. [2025-03-03 09:45:31,494 INFO L78 Accepts]: Start accepts. Automaton has 11077 states and 17027 transitions. Word has length 29 [2025-03-03 09:45:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:31,495 INFO L471 AbstractCegarLoop]: Abstraction has 11077 states and 17027 transitions. [2025-03-03 09:45:31,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11077 states and 17027 transitions. [2025-03-03 09:45:31,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:45:31,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:31,503 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] [2025-03-03 09:45:31,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 09:45:31,504 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:31,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:31,504 INFO L85 PathProgramCache]: Analyzing trace with hash 807678562, now seen corresponding path program 1 times [2025-03-03 09:45:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:31,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568761452] [2025-03-03 09:45:31,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:31,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:45:31,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:45:31,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:31,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:31,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:31,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568761452] [2025-03-03 09:45:31,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568761452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:31,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:31,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:31,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767158] [2025-03-03 09:45:31,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:31,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:31,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:31,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:31,525 INFO L87 Difference]: Start difference. First operand 11077 states and 17027 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:31,648 INFO L93 Difference]: Finished difference Result 16713 states and 25669 transitions. [2025-03-03 09:45:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:31,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 09:45:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:31,668 INFO L225 Difference]: With dead ends: 16713 [2025-03-03 09:45:31,668 INFO L226 Difference]: Without dead ends: 11271 [2025-03-03 09:45:31,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:31,677 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:31,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:31,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11271 states. [2025-03-03 09:45:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11271 to 11269. [2025-03-03 09:45:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11269 states, 11268 states have (on average 1.522452964146255) internal successors, (17155), 11268 states have internal predecessors, (17155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11269 states to 11269 states and 17155 transitions. [2025-03-03 09:45:31,937 INFO L78 Accepts]: Start accepts. Automaton has 11269 states and 17155 transitions. Word has length 30 [2025-03-03 09:45:31,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:31,937 INFO L471 AbstractCegarLoop]: Abstraction has 11269 states and 17155 transitions. [2025-03-03 09:45:31,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11269 states and 17155 transitions. [2025-03-03 09:45:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:45:31,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:31,944 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] [2025-03-03 09:45:31,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 09:45:31,944 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:31,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -36793309, now seen corresponding path program 1 times [2025-03-03 09:45:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574183062] [2025-03-03 09:45:31,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:31,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:45:31,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:45:31,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:31,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574183062] [2025-03-03 09:45:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574183062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:31,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:31,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483949785] [2025-03-03 09:45:31,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:31,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:31,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:31,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:31,961 INFO L87 Difference]: Start difference. First operand 11269 states and 17155 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:32,063 INFO L93 Difference]: Finished difference Result 19977 states and 31109 transitions. [2025-03-03 09:45:32,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:32,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 09:45:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:32,093 INFO L225 Difference]: With dead ends: 19977 [2025-03-03 09:45:32,093 INFO L226 Difference]: Without dead ends: 19975 [2025-03-03 09:45:32,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:32,101 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:32,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 171 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:32,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19975 states. [2025-03-03 09:45:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19975 to 16389. [2025-03-03 09:45:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16389 states, 16388 states have (on average 1.476385159873078) internal successors, (24195), 16388 states have internal predecessors, (24195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16389 states to 16389 states and 24195 transitions. [2025-03-03 09:45:32,357 INFO L78 Accepts]: Start accepts. Automaton has 16389 states and 24195 transitions. Word has length 30 [2025-03-03 09:45:32,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:32,357 INFO L471 AbstractCegarLoop]: Abstraction has 16389 states and 24195 transitions. [2025-03-03 09:45:32,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16389 states and 24195 transitions. [2025-03-03 09:45:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:45:32,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:32,370 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] [2025-03-03 09:45:32,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 09:45:32,371 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:32,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:32,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1033865662, now seen corresponding path program 1 times [2025-03-03 09:45:32,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:32,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585247454] [2025-03-03 09:45:32,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:32,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:32,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:45:32,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:45:32,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:32,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585247454] [2025-03-03 09:45:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585247454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:32,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209054996] [2025-03-03 09:45:32,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:32,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:32,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:32,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:32,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:32,393 INFO L87 Difference]: Start difference. First operand 16389 states and 24195 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:32,569 INFO L93 Difference]: Finished difference Result 38153 states and 56709 transitions. [2025-03-03 09:45:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 09:45:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:32,599 INFO L225 Difference]: With dead ends: 38153 [2025-03-03 09:45:32,599 INFO L226 Difference]: Without dead ends: 22023 [2025-03-03 09:45:32,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:32,612 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:32,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2025-03-03 09:45:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 22021. [2025-03-03 09:45:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22021 states, 22020 states have (on average 1.4766121707538602) internal successors, (32515), 22020 states have internal predecessors, (32515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 32515 transitions. [2025-03-03 09:45:32,958 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 32515 transitions. Word has length 30 [2025-03-03 09:45:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 22021 states and 32515 transitions. [2025-03-03 09:45:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 32515 transitions. [2025-03-03 09:45:32,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:45:32,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:32,976 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] [2025-03-03 09:45:32,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 09:45:32,976 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:32,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:32,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1140565389, now seen corresponding path program 1 times [2025-03-03 09:45:32,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:32,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158149460] [2025-03-03 09:45:32,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:32,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:32,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:45:32,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:45:32,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:32,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158149460] [2025-03-03 09:45:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158149460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:32,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:32,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162283573] [2025-03-03 09:45:32,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:32,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:32,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:32,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:32,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:32,996 INFO L87 Difference]: Start difference. First operand 22021 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:33,226 INFO L93 Difference]: Finished difference Result 33033 states and 48645 transitions. [2025-03-03 09:45:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:33,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:45:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:33,266 INFO L225 Difference]: With dead ends: 33033 [2025-03-03 09:45:33,267 INFO L226 Difference]: Without dead ends: 22279 [2025-03-03 09:45:33,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:33,281 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 67 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:33,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22279 states. [2025-03-03 09:45:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22279 to 22277. [2025-03-03 09:45:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22277 states, 22276 states have (on average 1.4596426647513019) internal successors, (32515), 22276 states have internal predecessors, (32515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22277 states to 22277 states and 32515 transitions. [2025-03-03 09:45:33,701 INFO L78 Accepts]: Start accepts. Automaton has 22277 states and 32515 transitions. Word has length 31 [2025-03-03 09:45:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:33,702 INFO L471 AbstractCegarLoop]: Abstraction has 22277 states and 32515 transitions. [2025-03-03 09:45:33,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 22277 states and 32515 transitions. [2025-03-03 09:45:33,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:45:33,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:33,712 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] [2025-03-03 09:45:33,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 09:45:33,712 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:33,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:33,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1985037260, now seen corresponding path program 1 times [2025-03-03 09:45:33,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:33,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329699193] [2025-03-03 09:45:33,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:33,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:33,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:45:33,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:45:33,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:33,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:33,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:33,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329699193] [2025-03-03 09:45:33,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329699193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:33,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:33,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:33,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258099658] [2025-03-03 09:45:33,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:33,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:33,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:33,729 INFO L87 Difference]: Start difference. First operand 22277 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:33,969 INFO L93 Difference]: Finished difference Result 38921 states and 58117 transitions. [2025-03-03 09:45:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:45:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:34,028 INFO L225 Difference]: With dead ends: 38921 [2025-03-03 09:45:34,029 INFO L226 Difference]: Without dead ends: 38919 [2025-03-03 09:45:34,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:34,039 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 46 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:34,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:34,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38919 states. [2025-03-03 09:45:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38919 to 32773. [2025-03-03 09:45:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32773 states, 32772 states have (on average 1.4139814475772001) internal successors, (46339), 32772 states have internal predecessors, (46339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 46339 transitions. [2025-03-03 09:45:34,490 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 46339 transitions. Word has length 31 [2025-03-03 09:45:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 32773 states and 46339 transitions. [2025-03-03 09:45:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 46339 transitions. [2025-03-03 09:45:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:45:34,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:34,505 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] [2025-03-03 09:45:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 09:45:34,505 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:34,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:34,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1312857683, now seen corresponding path program 1 times [2025-03-03 09:45:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528050588] [2025-03-03 09:45:34,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:34,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:45:34,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:45:34,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:34,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528050588] [2025-03-03 09:45:34,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528050588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:34,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000384303] [2025-03-03 09:45:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:34,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:34,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:34,522 INFO L87 Difference]: Start difference. First operand 32773 states and 46339 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:34,795 INFO L93 Difference]: Finished difference Result 75785 states and 107781 transitions. [2025-03-03 09:45:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-03 09:45:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:34,839 INFO L225 Difference]: With dead ends: 75785 [2025-03-03 09:45:34,839 INFO L226 Difference]: Without dead ends: 43527 [2025-03-03 09:45:34,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:34,869 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 64 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:34,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43527 states. [2025-03-03 09:45:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43527 to 43525. [2025-03-03 09:45:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43525 states, 43524 states have (on average 1.4117038875103392) internal successors, (61443), 43524 states have internal predecessors, (61443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43525 states to 43525 states and 61443 transitions. [2025-03-03 09:45:35,531 INFO L78 Accepts]: Start accepts. Automaton has 43525 states and 61443 transitions. Word has length 31 [2025-03-03 09:45:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:35,532 INFO L471 AbstractCegarLoop]: Abstraction has 43525 states and 61443 transitions. [2025-03-03 09:45:35,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 43525 states and 61443 transitions. [2025-03-03 09:45:35,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:45:35,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:35,641 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] [2025-03-03 09:45:35,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 09:45:35,642 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:35,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1406585943, now seen corresponding path program 1 times [2025-03-03 09:45:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-03 09:45:35,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:35,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 09:45:35,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:45:35,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:35,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:35,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:35,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126435571] [2025-03-03 09:45:35,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126435571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:35,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:35,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:35,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280709694] [2025-03-03 09:45:35,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:35,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:35,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:35,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:35,664 INFO L87 Difference]: Start difference. First operand 43525 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:36,139 INFO L93 Difference]: Finished difference Result 65289 states and 91909 transitions. [2025-03-03 09:45:36,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 09:45:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:36,186 INFO L225 Difference]: With dead ends: 65289 [2025-03-03 09:45:36,187 INFO L226 Difference]: Without dead ends: 44039 [2025-03-03 09:45:36,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:36,208 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:36,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44039 states. [2025-03-03 09:45:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44039 to 44037. [2025-03-03 09:45:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.395290217095104) internal successors, (61443), 44036 states have internal predecessors, (61443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:37,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 61443 transitions. [2025-03-03 09:45:37,233 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 61443 transitions. Word has length 32 [2025-03-03 09:45:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 44037 states and 61443 transitions. [2025-03-03 09:45:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 61443 transitions. [2025-03-03 09:45:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:45:37,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:37,251 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] [2025-03-03 09:45:37,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 09:45:37,251 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:37,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2043909482, now seen corresponding path program 1 times [2025-03-03 09:45:37,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:37,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-03-03 09:45:37,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:37,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:37,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 09:45:37,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:45:37,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:37,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:37,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:37,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818545584] [2025-03-03 09:45:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818545584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:37,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:37,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103491172] [2025-03-03 09:45:37,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:37,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:37,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:37,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:37,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:37,268 INFO L87 Difference]: Start difference. First operand 44037 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:37,708 INFO L93 Difference]: Finished difference Result 75785 states and 108037 transitions. [2025-03-03 09:45:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:37,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 09:45:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:37,800 INFO L225 Difference]: With dead ends: 75785 [2025-03-03 09:45:37,800 INFO L226 Difference]: Without dead ends: 75783 [2025-03-03 09:45:37,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:37,825 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 43 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:37,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75783 states. [2025-03-03 09:45:38,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75783 to 65541. [2025-03-03 09:45:38,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65541 states, 65540 states have (on average 1.3515257857796765) internal successors, (88579), 65540 states have internal predecessors, (88579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65541 states to 65541 states and 88579 transitions. [2025-03-03 09:45:38,666 INFO L78 Accepts]: Start accepts. Automaton has 65541 states and 88579 transitions. Word has length 32 [2025-03-03 09:45:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:38,666 INFO L471 AbstractCegarLoop]: Abstraction has 65541 states and 88579 transitions. [2025-03-03 09:45:38,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65541 states and 88579 transitions. [2025-03-03 09:45:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:45:38,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:38,693 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] [2025-03-03 09:45:38,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 09:45:38,693 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:38,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:38,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1046837129, now seen corresponding path program 1 times [2025-03-03 09:45:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:38,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547374359] [2025-03-03 09:45:38,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:38,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:38,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-03 09:45:38,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:45:38,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:38,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547374359] [2025-03-03 09:45:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547374359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728670568] [2025-03-03 09:45:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:38,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:38,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:38,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:38,709 INFO L87 Difference]: Start difference. First operand 65541 states and 88579 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:39,387 INFO L93 Difference]: Finished difference Result 150537 states and 204293 transitions. [2025-03-03 09:45:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:39,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-03 09:45:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:39,454 INFO L225 Difference]: With dead ends: 150537 [2025-03-03 09:45:39,454 INFO L226 Difference]: Without dead ends: 86023 [2025-03-03 09:45:39,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:39,489 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 63 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:39,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86023 states. [2025-03-03 09:45:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86023 to 86021. [2025-03-03 09:45:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.345210416182283) internal successors, (115715), 86020 states have internal predecessors, (115715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 115715 transitions. [2025-03-03 09:45:41,140 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 115715 transitions. Word has length 32 [2025-03-03 09:45:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:41,141 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 115715 transitions. [2025-03-03 09:45:41,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:41,141 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 115715 transitions. [2025-03-03 09:45:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:45:41,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:41,397 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] [2025-03-03 09:45:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 09:45:41,397 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:41,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1063288742, now seen corresponding path program 1 times [2025-03-03 09:45:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:41,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-03-03 09:45:41,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:41,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:41,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:45:41,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:45:41,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:41,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:41,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73064787] [2025-03-03 09:45:41,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73064787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:41,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:41,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057027266] [2025-03-03 09:45:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:41,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:41,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:41,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:41,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:41,412 INFO L87 Difference]: Start difference. First operand 86021 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:42,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:42,098 INFO L93 Difference]: Finished difference Result 129033 states and 173061 transitions. [2025-03-03 09:45:42,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:42,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 09:45:42,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:42,179 INFO L225 Difference]: With dead ends: 129033 [2025-03-03 09:45:42,179 INFO L226 Difference]: Without dead ends: 87047 [2025-03-03 09:45:42,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:42,205 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:42,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87047 states. [2025-03-03 09:45:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87047 to 87045. [2025-03-03 09:45:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87045 states, 87044 states have (on average 1.3293851385506181) internal successors, (115715), 87044 states have internal predecessors, (115715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87045 states to 87045 states and 115715 transitions. [2025-03-03 09:45:43,597 INFO L78 Accepts]: Start accepts. Automaton has 87045 states and 115715 transitions. Word has length 33 [2025-03-03 09:45:43,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:43,597 INFO L471 AbstractCegarLoop]: Abstraction has 87045 states and 115715 transitions. [2025-03-03 09:45:43,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 87045 states and 115715 transitions. [2025-03-03 09:45:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:45:43,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:43,634 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] [2025-03-03 09:45:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 09:45:43,634 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:43,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1907760613, now seen corresponding path program 1 times [2025-03-03 09:45:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116462803] [2025-03-03 09:45:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:43,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:45:43,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:45:43,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:43,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:43,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:43,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:43,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116462803] [2025-03-03 09:45:43,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116462803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:43,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:43,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:43,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031724650] [2025-03-03 09:45:43,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:43,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:43,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:43,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:43,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:43,659 INFO L87 Difference]: Start difference. First operand 87045 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:45,101 INFO L93 Difference]: Finished difference Result 147465 states and 199685 transitions. [2025-03-03 09:45:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:45,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 09:45:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:45,238 INFO L225 Difference]: With dead ends: 147465 [2025-03-03 09:45:45,239 INFO L226 Difference]: Without dead ends: 147463 [2025-03-03 09:45:45,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:45,256 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:45,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147463 states. [2025-03-03 09:45:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147463 to 131077. [2025-03-03 09:45:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131077 states, 131076 states have (on average 1.2890460496200677) internal successors, (168963), 131076 states have internal predecessors, (168963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131077 states to 131077 states and 168963 transitions. [2025-03-03 09:45:47,558 INFO L78 Accepts]: Start accepts. Automaton has 131077 states and 168963 transitions. Word has length 33 [2025-03-03 09:45:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:47,558 INFO L471 AbstractCegarLoop]: Abstraction has 131077 states and 168963 transitions. [2025-03-03 09:45:47,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 131077 states and 168963 transitions. [2025-03-03 09:45:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:45:47,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:47,614 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] [2025-03-03 09:45:47,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 09:45:47,614 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:47,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:47,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1390134330, now seen corresponding path program 1 times [2025-03-03 09:45:47,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:47,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586561612] [2025-03-03 09:45:47,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:47,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:47,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:45:47,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:45:47,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:47,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:47,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586561612] [2025-03-03 09:45:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586561612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:47,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:47,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414438109] [2025-03-03 09:45:47,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:47,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:47,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:47,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:47,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:47,628 INFO L87 Difference]: Start difference. First operand 131077 states and 168963 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:45:49,631 INFO L93 Difference]: Finished difference Result 299017 states and 386053 transitions. [2025-03-03 09:45:49,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:45:49,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-03 09:45:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:45:49,779 INFO L225 Difference]: With dead ends: 299017 [2025-03-03 09:45:49,779 INFO L226 Difference]: Without dead ends: 169991 [2025-03-03 09:45:49,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:49,844 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:45:49,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:45:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169991 states. [2025-03-03 09:45:52,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169991 to 169989. [2025-03-03 09:45:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169989 states, 169988 states have (on average 1.2770960303080217) internal successors, (217091), 169988 states have internal predecessors, (217091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 217091 transitions. [2025-03-03 09:45:52,657 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 217091 transitions. Word has length 33 [2025-03-03 09:45:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:45:52,660 INFO L471 AbstractCegarLoop]: Abstraction has 169989 states and 217091 transitions. [2025-03-03 09:45:52,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:45:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 217091 transitions. [2025-03-03 09:45:52,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:45:52,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:45:52,735 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] [2025-03-03 09:45:52,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 09:45:52,735 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:45:52,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:45:52,735 INFO L85 PathProgramCache]: Analyzing trace with hash 988989680, now seen corresponding path program 1 times [2025-03-03 09:45:52,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:45:52,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-03-03 09:45:52,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:45:52,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:45:52,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-03 09:45:52,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:45:52,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:45:52,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:45:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:45:52,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:45:52,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509665093] [2025-03-03 09:45:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509665093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:45:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:45:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:45:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064164597] [2025-03-03 09:45:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:45:52,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:45:52,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:45:52,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:45:52,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:45:52,755 INFO L87 Difference]: Start difference. First operand 169989 states and 217091 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)