./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.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/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:53:28,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:53:28,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:53:28,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:53:28,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:53:28,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:53:28,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:53:28,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:53:28,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:53:28,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:53:28,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:53:28,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:53:28,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:53:28,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:53:28,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:53:28,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:53:28,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:53:28,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:53:28,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:53:28,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:53:28,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:53:28,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:53:28,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:53:28,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:53:28,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:53:28,598 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 -> a2c5c77b8d7714bea640ff99a5b0e1a19cf307340ccbaffec9b7e0efde04f6ec [2025-03-03 14:53:28,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:53:28,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:53:28,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:53:28,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:53:28,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:53:28,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:53:30,061 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a6d62eaa/f2b8d20ec2f1417bb55712ec5ad39a20/FLAGa6458536d [2025-03-03 14:53:30,338 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:53:30,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:53:30,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a6d62eaa/f2b8d20ec2f1417bb55712ec5ad39a20/FLAGa6458536d [2025-03-03 14:53:30,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a6d62eaa/f2b8d20ec2f1417bb55712ec5ad39a20 [2025-03-03 14:53:30,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:53:30,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:53:30,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:53:30,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:53:30,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:53:30,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:30,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30, skipping insertion in model container [2025-03-03 14:53:30,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:30,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:53:30,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2025-03-03 14:53:30,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:53:30,865 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:53:30,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c[12951,12964] [2025-03-03 14:53:30,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:53:30,946 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:53:30,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30 WrapperNode [2025-03-03 14:53:30,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:53:30,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:53:30,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:53:30,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:53:30,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:30,963 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:30,993 INFO L138 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 481 [2025-03-03 14:53:30,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:53:30,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:53:31,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:53:31,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:53:31,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,020 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 14:53:31,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,025 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,028 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:53:31,031 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:53:31,031 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:53:31,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:53:31,033 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (1/1) ... [2025-03-03 14:53:31,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:53:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:53:31,067 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 14:53:31,070 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 14:53:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:53:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:53:31,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:53:31,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:53:31,165 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:53:31,166 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:53:31,593 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2025-03-03 14:53:31,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:53:31,601 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:53:31,602 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:53:31,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:53:31 BoogieIcfgContainer [2025-03-03 14:53:31,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:53:31,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:53:31,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:53:31,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:53:31,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:53:30" (1/3) ... [2025-03-03 14:53:31,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626ec2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:53:31, skipping insertion in model container [2025-03-03 14:53:31,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:53:30" (2/3) ... [2025-03-03 14:53:31,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626ec2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:53:31, skipping insertion in model container [2025-03-03 14:53:31,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:53:31" (3/3) ... [2025-03-03 14:53:31,611 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c [2025-03-03 14:53:31,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:53:31,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:53:31,678 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:53:31,686 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;@14a2db95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:53:31,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:53:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.7578125) internal successors, (225), 129 states have internal predecessors, (225), 0 states have call successors, (0), 0 states 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 14:53:31,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:53:31,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:31,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:31,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:31,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2138989480, now seen corresponding path program 1 times [2025-03-03 14:53:31,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561986421] [2025-03-03 14:53:31,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:31,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:53:31,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:53:31,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:31,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:31,959 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 14:53:31,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:31,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561986421] [2025-03-03 14:53:31,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561986421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:31,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:31,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 14:53:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645072414] [2025-03-03 14:53:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:31,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:53:31,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:31,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:53:31,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:53:31,981 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.7578125) internal successors, (225), 129 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:53:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:31,999 INFO L93 Difference]: Finished difference Result 204 states and 352 transitions. [2025-03-03 14:53:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:53:32,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 14:53:32,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:32,006 INFO L225 Difference]: With dead ends: 204 [2025-03-03 14:53:32,006 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 14:53:32,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 14:53:32,010 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:32,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 14:53:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 14:53:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 220 transitions. [2025-03-03 14:53:32,042 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 220 transitions. Word has length 37 [2025-03-03 14:53:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:32,042 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 220 transitions. [2025-03-03 14:53:32,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:53:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 220 transitions. [2025-03-03 14:53:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 14:53:32,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:32,043 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:32,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:53:32,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:32,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1747153591, now seen corresponding path program 1 times [2025-03-03 14:53:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700583689] [2025-03-03 14:53:32,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:32,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:32,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 14:53:32,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 14:53:32,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:32,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:32,306 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 14:53:32,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:32,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700583689] [2025-03-03 14:53:32,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700583689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:32,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:32,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:32,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882681563] [2025-03-03 14:53:32,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:32,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:32,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:32,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:32,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:32,309 INFO L87 Difference]: Start difference. First operand 127 states and 220 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:53:32,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:32,372 INFO L93 Difference]: Finished difference Result 204 states and 348 transitions. [2025-03-03 14:53:32,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:32,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 14:53:32,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:32,374 INFO L225 Difference]: With dead ends: 204 [2025-03-03 14:53:32,374 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 14:53:32,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:32,374 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 0 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:32,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 843 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 14:53:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 14:53:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 126 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 196 transitions. [2025-03-03 14:53:32,383 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 196 transitions. Word has length 37 [2025-03-03 14:53:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:32,383 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 196 transitions. [2025-03-03 14:53:32,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 14:53:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 196 transitions. [2025-03-03 14:53:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:53:32,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:32,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:32,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:53:32,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:32,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1399409367, now seen corresponding path program 1 times [2025-03-03 14:53:32,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:32,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717188585] [2025-03-03 14:53:32,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:32,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:32,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:53:32,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:53:32,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:32,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:32,515 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 14:53:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717188585] [2025-03-03 14:53:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717188585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593916072] [2025-03-03 14:53:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:32,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:32,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:32,516 INFO L87 Difference]: Start difference. First operand 127 states and 196 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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 14:53:32,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:32,584 INFO L93 Difference]: Finished difference Result 263 states and 426 transitions. [2025-03-03 14:53:32,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:32,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-03-03 14:53:32,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:32,586 INFO L225 Difference]: With dead ends: 263 [2025-03-03 14:53:32,586 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 14:53:32,588 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 14:53:32,589 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:32,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 346 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 14:53:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2025-03-03 14:53:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.5806451612903225) internal successors, (294), 186 states have internal predecessors, (294), 0 states have call successors, (0), 0 states 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 14:53:32,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 294 transitions. [2025-03-03 14:53:32,597 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 294 transitions. Word has length 60 [2025-03-03 14:53:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:32,597 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 294 transitions. [2025-03-03 14:53:32,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states 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 14:53:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 294 transitions. [2025-03-03 14:53:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:53:32,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:32,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:32,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:53:32,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1715195172, now seen corresponding path program 1 times [2025-03-03 14:53:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966334517] [2025-03-03 14:53:32,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:32,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:32,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:53:32,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:53:32,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:32,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:32,694 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 14:53:32,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:32,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966334517] [2025-03-03 14:53:32,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966334517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:32,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:32,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171072014] [2025-03-03 14:53:32,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:32,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:32,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:32,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:32,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:32,695 INFO L87 Difference]: Start difference. First operand 187 states and 294 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:32,725 INFO L93 Difference]: Finished difference Result 437 states and 710 transitions. [2025-03-03 14:53:32,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:32,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-03-03 14:53:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:32,729 INFO L225 Difference]: With dead ends: 437 [2025-03-03 14:53:32,729 INFO L226 Difference]: Without dead ends: 304 [2025-03-03 14:53:32,729 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 14:53:32,730 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 99 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:32,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 359 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-03 14:53:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2025-03-03 14:53:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.608695652173913) internal successors, (481), 299 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 14:53:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 481 transitions. [2025-03-03 14:53:32,745 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 481 transitions. Word has length 62 [2025-03-03 14:53:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:32,746 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 481 transitions. [2025-03-03 14:53:32,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 481 transitions. [2025-03-03 14:53:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:53:32,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:32,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:32,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:53:32,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:32,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash 995869409, now seen corresponding path program 1 times [2025-03-03 14:53:32,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:32,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439659263] [2025-03-03 14:53:32,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:32,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:53:32,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:53:32,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:32,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:32,859 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 14:53:32,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:32,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439659263] [2025-03-03 14:53:32,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439659263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:32,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:32,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:32,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447656391] [2025-03-03 14:53:32,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:32,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:32,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:32,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:32,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:32,861 INFO L87 Difference]: Start difference. First operand 300 states and 481 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 14:53:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:32,902 INFO L93 Difference]: Finished difference Result 760 states and 1243 transitions. [2025-03-03 14:53:32,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:32,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 14:53:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:32,904 INFO L225 Difference]: With dead ends: 760 [2025-03-03 14:53:32,904 INFO L226 Difference]: Without dead ends: 514 [2025-03-03 14:53:32,905 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 14:53:32,907 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 93 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:32,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 360 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-03 14:53:32,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 508. [2025-03-03 14:53:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.6193293885601578) internal successors, (821), 507 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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 14:53:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 821 transitions. [2025-03-03 14:53:32,928 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 821 transitions. Word has length 64 [2025-03-03 14:53:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:32,929 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 821 transitions. [2025-03-03 14:53:32,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 14:53:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 821 transitions. [2025-03-03 14:53:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:53:32,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:32,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:32,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:53:32,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:32,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:32,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1589811942, now seen corresponding path program 1 times [2025-03-03 14:53:32,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:32,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151042003] [2025-03-03 14:53:32,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:32,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:53:32,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:53:32,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:32,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:33,060 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 14:53:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:33,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151042003] [2025-03-03 14:53:33,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151042003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:33,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:33,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:33,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376821734] [2025-03-03 14:53:33,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:33,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:33,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:33,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:33,061 INFO L87 Difference]: Start difference. First operand 508 states and 821 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:33,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:33,234 INFO L93 Difference]: Finished difference Result 2184 states and 3627 transitions. [2025-03-03 14:53:33,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:53:33,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-03-03 14:53:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:33,244 INFO L225 Difference]: With dead ends: 2184 [2025-03-03 14:53:33,244 INFO L226 Difference]: Without dead ends: 1730 [2025-03-03 14:53:33,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:53:33,247 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 716 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:33,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1334 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-03 14:53:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 906. [2025-03-03 14:53:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.6331491712707182) internal successors, (1478), 905 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states 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 14:53:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1478 transitions. [2025-03-03 14:53:33,283 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1478 transitions. Word has length 66 [2025-03-03 14:53:33,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:33,284 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1478 transitions. [2025-03-03 14:53:33,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1478 transitions. [2025-03-03 14:53:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:53:33,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:33,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:33,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:53:33,287 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2090385141, now seen corresponding path program 1 times [2025-03-03 14:53:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336038018] [2025-03-03 14:53:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:33,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:53:33,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:53:33,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:33,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:33,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 14:53:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336038018] [2025-03-03 14:53:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336038018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:33,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:33,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505804213] [2025-03-03 14:53:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:33,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:33,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:33,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:33,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:33,380 INFO L87 Difference]: Start difference. First operand 906 states and 1478 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 14:53:33,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:33,458 INFO L93 Difference]: Finished difference Result 2648 states and 4388 transitions. [2025-03-03 14:53:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:33,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 14:53:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:33,465 INFO L225 Difference]: With dead ends: 2648 [2025-03-03 14:53:33,465 INFO L226 Difference]: Without dead ends: 1796 [2025-03-03 14:53:33,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:33,468 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 357 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:33,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 636 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-03-03 14:53:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1342. [2025-03-03 14:53:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1342 states, 1341 states have (on average 1.6413124533929904) internal successors, (2201), 1341 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states 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 14:53:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 2201 transitions. [2025-03-03 14:53:33,515 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 2201 transitions. Word has length 67 [2025-03-03 14:53:33,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:33,516 INFO L471 AbstractCegarLoop]: Abstraction has 1342 states and 2201 transitions. [2025-03-03 14:53:33,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 14:53:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 2201 transitions. [2025-03-03 14:53:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:53:33,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:33,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:33,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:53:33,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:33,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 426438084, now seen corresponding path program 1 times [2025-03-03 14:53:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:33,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126073748] [2025-03-03 14:53:33,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:33,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:33,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:53:33,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:53:33,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:33,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:33,604 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 14:53:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:33,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126073748] [2025-03-03 14:53:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126073748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043692000] [2025-03-03 14:53:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:33,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:33,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:33,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:33,606 INFO L87 Difference]: Start difference. First operand 1342 states and 2201 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:53:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:33,701 INFO L93 Difference]: Finished difference Result 3902 states and 6452 transitions. [2025-03-03 14:53:33,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:33,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-03-03 14:53:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:33,711 INFO L225 Difference]: With dead ends: 3902 [2025-03-03 14:53:33,711 INFO L226 Difference]: Without dead ends: 2614 [2025-03-03 14:53:33,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:33,714 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 357 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:33,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 634 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2025-03-03 14:53:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 1966. [2025-03-03 14:53:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1965 states have (on average 1.6391857506361323) internal successors, (3221), 1965 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states 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 14:53:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 3221 transitions. [2025-03-03 14:53:33,778 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 3221 transitions. Word has length 68 [2025-03-03 14:53:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:33,779 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 3221 transitions. [2025-03-03 14:53:33,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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 14:53:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 3221 transitions. [2025-03-03 14:53:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:53:33,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:33,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:33,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:53:33,784 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:33,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash 381839827, now seen corresponding path program 1 times [2025-03-03 14:53:33,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:33,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185796262] [2025-03-03 14:53:33,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:33,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:53:33,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:53:33,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:33,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:33,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:33,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:33,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185796262] [2025-03-03 14:53:33,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185796262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:33,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:33,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:33,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043331385] [2025-03-03 14:53:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:33,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:33,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:33,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:33,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:33,888 INFO L87 Difference]: Start difference. First operand 1966 states and 3221 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 14:53:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:33,992 INFO L93 Difference]: Finished difference Result 5686 states and 9376 transitions. [2025-03-03 14:53:33,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:33,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2025-03-03 14:53:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:34,004 INFO L225 Difference]: With dead ends: 5686 [2025-03-03 14:53:34,005 INFO L226 Difference]: Without dead ends: 3774 [2025-03-03 14:53:34,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:34,010 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 355 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:34,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 636 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2025-03-03 14:53:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 2854. [2025-03-03 14:53:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2853 states have (on average 1.6358219418156326) internal successors, (4667), 2853 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states 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 14:53:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 4667 transitions. [2025-03-03 14:53:34,101 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 4667 transitions. Word has length 69 [2025-03-03 14:53:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:34,101 INFO L471 AbstractCegarLoop]: Abstraction has 2854 states and 4667 transitions. [2025-03-03 14:53:34,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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 14:53:34,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 4667 transitions. [2025-03-03 14:53:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:53:34,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:34,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:34,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:53:34,103 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:34,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1524540063, now seen corresponding path program 1 times [2025-03-03 14:53:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063390769] [2025-03-03 14:53:34,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:34,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:34,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:53:34,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:53:34,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:34,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:34,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:34,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063390769] [2025-03-03 14:53:34,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063390769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:34,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:34,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:34,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22466753] [2025-03-03 14:53:34,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:34,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:34,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:34,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:34,175 INFO L87 Difference]: Start difference. First operand 2854 states and 4667 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 14:53:34,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:34,241 INFO L93 Difference]: Finished difference Result 6479 states and 10681 transitions. [2025-03-03 14:53:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:34,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 14:53:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:34,255 INFO L225 Difference]: With dead ends: 6479 [2025-03-03 14:53:34,255 INFO L226 Difference]: Without dead ends: 4418 [2025-03-03 14:53:34,259 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 14:53:34,259 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 104 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:34,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 449 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states. [2025-03-03 14:53:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4416. [2025-03-03 14:53:34,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4416 states, 4415 states have (on average 1.6323895809739524) internal successors, (7207), 4415 states have internal predecessors, (7207), 0 states have call successors, (0), 0 states 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 14:53:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 7207 transitions. [2025-03-03 14:53:34,350 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 7207 transitions. Word has length 70 [2025-03-03 14:53:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:34,350 INFO L471 AbstractCegarLoop]: Abstraction has 4416 states and 7207 transitions. [2025-03-03 14:53:34,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 14:53:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 7207 transitions. [2025-03-03 14:53:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:53:34,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:34,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:34,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:53:34,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:34,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:34,351 INFO L85 PathProgramCache]: Analyzing trace with hash -499355487, now seen corresponding path program 1 times [2025-03-03 14:53:34,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:34,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464111718] [2025-03-03 14:53:34,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:34,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:53:34,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:53:34,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:34,400 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 14:53:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:34,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464111718] [2025-03-03 14:53:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464111718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:34,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:34,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:34,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16701411] [2025-03-03 14:53:34,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:34,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:34,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:34,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:34,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:34,402 INFO L87 Difference]: Start difference. First operand 4416 states and 7207 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 14:53:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:34,493 INFO L93 Difference]: Finished difference Result 9893 states and 16161 transitions. [2025-03-03 14:53:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 14:53:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:34,513 INFO L225 Difference]: With dead ends: 9893 [2025-03-03 14:53:34,513 INFO L226 Difference]: Without dead ends: 6738 [2025-03-03 14:53:34,518 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 14:53:34,519 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 98 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:34,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 446 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6738 states. [2025-03-03 14:53:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6738 to 6736. [2025-03-03 14:53:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 1.6187082405345212) internal successors, (10902), 6735 states have internal predecessors, (10902), 0 states have call successors, (0), 0 states 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 14:53:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 10902 transitions. [2025-03-03 14:53:34,672 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 10902 transitions. Word has length 70 [2025-03-03 14:53:34,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:34,673 INFO L471 AbstractCegarLoop]: Abstraction has 6736 states and 10902 transitions. [2025-03-03 14:53:34,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 14:53:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 10902 transitions. [2025-03-03 14:53:34,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:53:34,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:34,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:34,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:53:34,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:34,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1997081631, now seen corresponding path program 1 times [2025-03-03 14:53:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208716024] [2025-03-03 14:53:34,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:34,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:34,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:53:34,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:53:34,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:34,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:34,719 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 14:53:34,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:34,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208716024] [2025-03-03 14:53:34,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208716024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:34,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:34,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372522302] [2025-03-03 14:53:34,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:34,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:34,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:34,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:34,721 INFO L87 Difference]: Start difference. First operand 6736 states and 10902 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 14:53:34,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:34,843 INFO L93 Difference]: Finished difference Result 15002 states and 24282 transitions. [2025-03-03 14:53:34,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:34,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-03 14:53:34,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:34,867 INFO L225 Difference]: With dead ends: 15002 [2025-03-03 14:53:34,867 INFO L226 Difference]: Without dead ends: 10165 [2025-03-03 14:53:34,874 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 14:53:34,875 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 92 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:34,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 435 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:34,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10165 states. [2025-03-03 14:53:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10165 to 10163. [2025-03-03 14:53:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10163 states, 10162 states have (on average 1.6012595945679984) internal successors, (16272), 10162 states have internal predecessors, (16272), 0 states have call successors, (0), 0 states 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 14:53:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10163 states to 10163 states and 16272 transitions. [2025-03-03 14:53:35,142 INFO L78 Accepts]: Start accepts. Automaton has 10163 states and 16272 transitions. Word has length 70 [2025-03-03 14:53:35,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:35,142 INFO L471 AbstractCegarLoop]: Abstraction has 10163 states and 16272 transitions. [2025-03-03 14:53:35,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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 14:53:35,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10163 states and 16272 transitions. [2025-03-03 14:53:35,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:53:35,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:35,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:35,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:53:35,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -970910543, now seen corresponding path program 1 times [2025-03-03 14:53:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013903263] [2025-03-03 14:53:35,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:35,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:53:35,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:53:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:35,307 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 14:53:35,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013903263] [2025-03-03 14:53:35,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013903263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:35,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:35,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:35,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282180027] [2025-03-03 14:53:35,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:35,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:35,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:35,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:35,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:35,309 INFO L87 Difference]: Start difference. First operand 10163 states and 16272 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 14:53:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:35,532 INFO L93 Difference]: Finished difference Result 20256 states and 32447 transitions. [2025-03-03 14:53:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-03 14:53:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:35,552 INFO L225 Difference]: With dead ends: 20256 [2025-03-03 14:53:35,553 INFO L226 Difference]: Without dead ends: 10165 [2025-03-03 14:53:35,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:53:35,562 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 283 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:35,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 520 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:35,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10165 states. [2025-03-03 14:53:35,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10165 to 10163. [2025-03-03 14:53:35,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10163 states, 10162 states have (on average 1.5889588663648888) internal successors, (16147), 10162 states have internal predecessors, (16147), 0 states have call successors, (0), 0 states 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 14:53:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10163 states to 10163 states and 16147 transitions. [2025-03-03 14:53:35,812 INFO L78 Accepts]: Start accepts. Automaton has 10163 states and 16147 transitions. Word has length 71 [2025-03-03 14:53:35,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:35,812 INFO L471 AbstractCegarLoop]: Abstraction has 10163 states and 16147 transitions. [2025-03-03 14:53:35,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 14:53:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 10163 states and 16147 transitions. [2025-03-03 14:53:35,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:53:35,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:35,813 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:35,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:53:35,814 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:35,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash -419837219, now seen corresponding path program 1 times [2025-03-03 14:53:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634626347] [2025-03-03 14:53:35,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:35,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:53:35,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:53:35,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:35,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:36,000 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 14:53:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634626347] [2025-03-03 14:53:36,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634626347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:36,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:36,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215413796] [2025-03-03 14:53:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:36,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:36,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:36,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:36,002 INFO L87 Difference]: Start difference. First operand 10163 states and 16147 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 14:53:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:36,284 INFO L93 Difference]: Finished difference Result 29132 states and 46429 transitions. [2025-03-03 14:53:36,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:36,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 14:53:36,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:36,318 INFO L225 Difference]: With dead ends: 29132 [2025-03-03 14:53:36,319 INFO L226 Difference]: Without dead ends: 19041 [2025-03-03 14:53:36,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:53:36,329 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 185 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:36,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 522 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19041 states. [2025-03-03 14:53:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19041 to 19039. [2025-03-03 14:53:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19039 states, 19038 states have (on average 1.5752705116083623) internal successors, (29990), 19038 states have internal predecessors, (29990), 0 states have call successors, (0), 0 states 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 14:53:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19039 states to 19039 states and 29990 transitions. [2025-03-03 14:53:36,657 INFO L78 Accepts]: Start accepts. Automaton has 19039 states and 29990 transitions. Word has length 74 [2025-03-03 14:53:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:36,657 INFO L471 AbstractCegarLoop]: Abstraction has 19039 states and 29990 transitions. [2025-03-03 14:53:36,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states 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 14:53:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 19039 states and 29990 transitions. [2025-03-03 14:53:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:53:36,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:36,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:53:36,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:53:36,658 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:36,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:36,658 INFO L85 PathProgramCache]: Analyzing trace with hash -97667126, now seen corresponding path program 1 times [2025-03-03 14:53:36,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:36,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138448777] [2025-03-03 14:53:36,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:36,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:53:36,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:53:36,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:36,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:36,865 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 14:53:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:36,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138448777] [2025-03-03 14:53:36,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138448777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:36,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:36,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040331064] [2025-03-03 14:53:36,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:36,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:36,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:36,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:36,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:36,866 INFO L87 Difference]: Start difference. First operand 19039 states and 29990 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 14:53:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:36,991 INFO L93 Difference]: Finished difference Result 20127 states and 31439 transitions. [2025-03-03 14:53:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-03-03 14:53:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:37,028 INFO L225 Difference]: With dead ends: 20127 [2025-03-03 14:53:37,029 INFO L226 Difference]: Without dead ends: 20125 [2025-03-03 14:53:37,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:37,037 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:37,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 758 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20125 states. [2025-03-03 14:53:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20125 to 20125. [2025-03-03 14:53:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20125 states, 20124 states have (on average 1.5437785728483402) internal successors, (31067), 20124 states have internal predecessors, (31067), 0 states have call successors, (0), 0 states 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 14:53:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20125 states to 20125 states and 31067 transitions. [2025-03-03 14:53:37,408 INFO L78 Accepts]: Start accepts. Automaton has 20125 states and 31067 transitions. Word has length 75 [2025-03-03 14:53:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:37,408 INFO L471 AbstractCegarLoop]: Abstraction has 20125 states and 31067 transitions. [2025-03-03 14:53:37,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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 14:53:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20125 states and 31067 transitions. [2025-03-03 14:53:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:53:37,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:37,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:37,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:53:37,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 554706859, now seen corresponding path program 1 times [2025-03-03 14:53:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:37,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543679263] [2025-03-03 14:53:37,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:37,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:37,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:53:37,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:53:37,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:37,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:53:37,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:37,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543679263] [2025-03-03 14:53:37,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543679263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:37,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:37,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:37,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918221781] [2025-03-03 14:53:37,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:37,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:37,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:37,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:37,514 INFO L87 Difference]: Start difference. First operand 20125 states and 31067 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 14:53:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:37,922 INFO L93 Difference]: Finished difference Result 49653 states and 76957 transitions. [2025-03-03 14:53:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 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 103 [2025-03-03 14:53:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:38,004 INFO L225 Difference]: With dead ends: 49653 [2025-03-03 14:53:38,004 INFO L226 Difference]: Without dead ends: 39811 [2025-03-03 14:53:38,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:53:38,022 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 450 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:38,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 858 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39811 states. [2025-03-03 14:53:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39811 to 31021. [2025-03-03 14:53:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31021 states, 31020 states have (on average 1.5412959381044486) internal successors, (47811), 31020 states have internal predecessors, (47811), 0 states have call successors, (0), 0 states 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 14:53:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31021 states to 31021 states and 47811 transitions. [2025-03-03 14:53:38,704 INFO L78 Accepts]: Start accepts. Automaton has 31021 states and 47811 transitions. Word has length 103 [2025-03-03 14:53:38,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:38,705 INFO L471 AbstractCegarLoop]: Abstraction has 31021 states and 47811 transitions. [2025-03-03 14:53:38,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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 14:53:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31021 states and 47811 transitions. [2025-03-03 14:53:38,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:53:38,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:38,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:38,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:53:38,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:38,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:38,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1579891435, now seen corresponding path program 1 times [2025-03-03 14:53:38,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:38,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924554412] [2025-03-03 14:53:38,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:38,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:38,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:53:38,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:53:38,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:53:38,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:38,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924554412] [2025-03-03 14:53:38,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924554412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:38,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:38,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229032668] [2025-03-03 14:53:38,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:38,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:38,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:38,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:38,830 INFO L87 Difference]: Start difference. First operand 31021 states and 47811 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 14:53:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:39,226 INFO L93 Difference]: Finished difference Result 55729 states and 86387 transitions. [2025-03-03 14:53:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 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 103 [2025-03-03 14:53:39,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:39,304 INFO L225 Difference]: With dead ends: 55729 [2025-03-03 14:53:39,304 INFO L226 Difference]: Without dead ends: 46147 [2025-03-03 14:53:39,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:53:39,326 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 443 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:39,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 907 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:39,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46147 states. [2025-03-03 14:53:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46147 to 42173. [2025-03-03 14:53:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.5430380347149768) internal successors, (65073), 42172 states have internal predecessors, (65073), 0 states have call successors, (0), 0 states 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 14:53:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 65073 transitions. [2025-03-03 14:53:40,019 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 65073 transitions. Word has length 103 [2025-03-03 14:53:40,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:40,019 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 65073 transitions. [2025-03-03 14:53:40,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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 14:53:40,019 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 65073 transitions. [2025-03-03 14:53:40,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:53:40,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:40,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:40,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:53:40,021 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 82165291, now seen corresponding path program 1 times [2025-03-03 14:53:40,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:40,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119773378] [2025-03-03 14:53:40,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:40,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:40,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:53:40,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:53:40,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:40,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:53:40,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119773378] [2025-03-03 14:53:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119773378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:40,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:53:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887092475] [2025-03-03 14:53:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:40,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:53:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:40,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:53:40,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:53:40,130 INFO L87 Difference]: Start difference. First operand 42173 states and 65073 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:40,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:40,453 INFO L93 Difference]: Finished difference Result 59593 states and 92379 transitions. [2025-03-03 14:53:40,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:53:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 14:53:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:40,525 INFO L225 Difference]: With dead ends: 59593 [2025-03-03 14:53:40,525 INFO L226 Difference]: Without dead ends: 50011 [2025-03-03 14:53:40,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:53:40,550 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 456 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:40,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 864 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:53:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50011 states. [2025-03-03 14:53:41,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50011 to 48405. [2025-03-03 14:53:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48405 states, 48404 states have (on average 1.5450169407486984) internal successors, (74785), 48404 states have internal predecessors, (74785), 0 states have call successors, (0), 0 states 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 14:53:41,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48405 states to 48405 states and 74785 transitions. [2025-03-03 14:53:41,630 INFO L78 Accepts]: Start accepts. Automaton has 48405 states and 74785 transitions. Word has length 103 [2025-03-03 14:53:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:41,630 INFO L471 AbstractCegarLoop]: Abstraction has 48405 states and 74785 transitions. [2025-03-03 14:53:41,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:53:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 48405 states and 74785 transitions. [2025-03-03 14:53:41,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:53:41,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:41,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:41,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:53:41,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:41,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:41,633 INFO L85 PathProgramCache]: Analyzing trace with hash 66898640, now seen corresponding path program 1 times [2025-03-03 14:53:41,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:41,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072665415] [2025-03-03 14:53:41,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:41,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:41,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:53:41,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:53:41,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:41,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:53:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:41,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072665415] [2025-03-03 14:53:41,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072665415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:41,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:53:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134141131] [2025-03-03 14:53:41,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:41,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:53:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:41,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:53:41,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:41,739 INFO L87 Difference]: Start difference. First operand 48405 states and 74785 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 14:53:42,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:42,309 INFO L93 Difference]: Finished difference Result 79148 states and 122944 transitions. [2025-03-03 14:53:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:53:42,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 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 104 [2025-03-03 14:53:42,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:42,407 INFO L225 Difference]: With dead ends: 79148 [2025-03-03 14:53:42,407 INFO L226 Difference]: Without dead ends: 62970 [2025-03-03 14:53:42,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:53:42,440 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 196 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:42,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 595 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62970 states. [2025-03-03 14:53:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62970 to 61366. [2025-03-03 14:53:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61366 states, 61365 states have (on average 1.5451967734050354) internal successors, (94821), 61365 states have internal predecessors, (94821), 0 states have call successors, (0), 0 states 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 14:53:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61366 states to 61366 states and 94821 transitions. [2025-03-03 14:53:43,466 INFO L78 Accepts]: Start accepts. Automaton has 61366 states and 94821 transitions. Word has length 104 [2025-03-03 14:53:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:43,466 INFO L471 AbstractCegarLoop]: Abstraction has 61366 states and 94821 transitions. [2025-03-03 14:53:43,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 14:53:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 61366 states and 94821 transitions. [2025-03-03 14:53:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:53:43,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:43,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:43,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:53:43,469 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:43,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash 278249553, now seen corresponding path program 1 times [2025-03-03 14:53:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:43,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509701515] [2025-03-03 14:53:43,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:43,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:53:43,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:53:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:43,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:53:43,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:43,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509701515] [2025-03-03 14:53:43,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509701515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:43,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:43,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688300290] [2025-03-03 14:53:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:43,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:43,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:43,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:43,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:43,523 INFO L87 Difference]: Start difference. First operand 61366 states and 94821 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 14:53:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:44,473 INFO L93 Difference]: Finished difference Result 132982 states and 206190 transitions. [2025-03-03 14:53:44,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 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 104 [2025-03-03 14:53:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:44,624 INFO L225 Difference]: With dead ends: 132982 [2025-03-03 14:53:44,625 INFO L226 Difference]: Without dead ends: 103948 [2025-03-03 14:53:44,653 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 14:53:44,654 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 81 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:44,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 359 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103948 states. [2025-03-03 14:53:46,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103948 to 103670. [2025-03-03 14:53:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103670 states, 103669 states have (on average 1.5448301806711746) internal successors, (160151), 103669 states have internal predecessors, (160151), 0 states have call successors, (0), 0 states 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 14:53:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103670 states to 103670 states and 160151 transitions. [2025-03-03 14:53:46,381 INFO L78 Accepts]: Start accepts. Automaton has 103670 states and 160151 transitions. Word has length 104 [2025-03-03 14:53:46,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:46,382 INFO L471 AbstractCegarLoop]: Abstraction has 103670 states and 160151 transitions. [2025-03-03 14:53:46,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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 14:53:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 103670 states and 160151 transitions. [2025-03-03 14:53:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:53:46,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:46,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:46,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:53:46,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:46,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:46,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1121282432, now seen corresponding path program 1 times [2025-03-03 14:53:46,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083764783] [2025-03-03 14:53:46,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:46,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:53:46,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:53:46,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:46,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:46,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083764783] [2025-03-03 14:53:46,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083764783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:46,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:46,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:46,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396354145] [2025-03-03 14:53:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:46,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:46,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:46,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:46,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:46,446 INFO L87 Difference]: Start difference. First operand 103670 states and 160151 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 14:53:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:48,020 INFO L93 Difference]: Finished difference Result 308714 states and 475910 transitions. [2025-03-03 14:53:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:48,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-03 14:53:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:48,401 INFO L225 Difference]: With dead ends: 308714 [2025-03-03 14:53:48,402 INFO L226 Difference]: Without dead ends: 205110 [2025-03-03 14:53:48,515 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 14:53:48,516 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 126 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:48,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 434 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:48,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205110 states. [2025-03-03 14:53:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205110 to 205108. [2025-03-03 14:53:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205108 states, 205107 states have (on average 1.5291433251912416) internal successors, (313638), 205107 states have internal predecessors, (313638), 0 states have call successors, (0), 0 states 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 14:53:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205108 states to 205108 states and 313638 transitions. [2025-03-03 14:53:52,487 INFO L78 Accepts]: Start accepts. Automaton has 205108 states and 313638 transitions. Word has length 105 [2025-03-03 14:53:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:53:52,487 INFO L471 AbstractCegarLoop]: Abstraction has 205108 states and 313638 transitions. [2025-03-03 14:53:52,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 14:53:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 205108 states and 313638 transitions. [2025-03-03 14:53:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:53:52,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:53:52,490 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:52,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:53:52,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:53:52,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:53:52,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1212773888, now seen corresponding path program 1 times [2025-03-03 14:53:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:53:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261722555] [2025-03-03 14:53:52,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:53:52,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:53:52,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:53:52,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:53:52,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:53:52,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:53:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:53:52,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:53:52,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261722555] [2025-03-03 14:53:52,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261722555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:53:52,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:53:52,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:53:52,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873754103] [2025-03-03 14:53:52,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:53:52,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:53:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:53:52,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:53:52,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:53:52,541 INFO L87 Difference]: Start difference. First operand 205108 states and 313638 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 14:53:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:53:56,419 INFO L93 Difference]: Finished difference Result 610773 states and 931903 transitions. [2025-03-03 14:53:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:53:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-03 14:53:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:53:57,281 INFO L225 Difference]: With dead ends: 610773 [2025-03-03 14:53:57,281 INFO L226 Difference]: Without dead ends: 405787 [2025-03-03 14:53:57,744 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 14:53:57,746 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 145 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:53:57,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 460 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:53:58,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405787 states. [2025-03-03 14:54:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405787 to 405785. [2025-03-03 14:54:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405785 states, 405784 states have (on average 1.513132602566883) internal successors, (614005), 405784 states have internal predecessors, (614005), 0 states have call successors, (0), 0 states 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 14:54:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405785 states to 405785 states and 614005 transitions. [2025-03-03 14:54:05,522 INFO L78 Accepts]: Start accepts. Automaton has 405785 states and 614005 transitions. Word has length 105 [2025-03-03 14:54:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:54:05,527 INFO L471 AbstractCegarLoop]: Abstraction has 405785 states and 614005 transitions. [2025-03-03 14:54:05,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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 14:54:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 405785 states and 614005 transitions. [2025-03-03 14:54:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:54:05,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:54:05,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:05,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:54:05,534 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:54:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:54:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash -517234551, now seen corresponding path program 1 times [2025-03-03 14:54:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:54:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548143506] [2025-03-03 14:54:05,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:54:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:54:05,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:54:05,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:54:05,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:54:05,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:54:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:54:05,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:54:05,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548143506] [2025-03-03 14:54:05,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548143506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:54:05,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:54:05,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:54:05,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883119942] [2025-03-03 14:54:05,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:54:05,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:54:05,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:54:05,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:54:05,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:54:05,672 INFO L87 Difference]: Start difference. First operand 405785 states and 614005 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)