./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/toy.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:08:50,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:08:50,243 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:08:50,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:08:50,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:08:50,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:08:50,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:08:50,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:08:50,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:08:50,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:08:50,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:08:50,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:08:50,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:08:50,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:08:50,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:08:50,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:08:50,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:08:50,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:08:50,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:08:50,281 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-jdk21/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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2025-02-05 16:08:50,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:08:50,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:08:50,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:08:50,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:08:50,516 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:08:50,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2025-02-05 16:08:51,733 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f0ecc7ec/f25692ef6b544f489e0b9d8564224ae8/FLAG0cc6d7334 [2025-02-05 16:08:51,996 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:08:52,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2025-02-05 16:08:52,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f0ecc7ec/f25692ef6b544f489e0b9d8564224ae8/FLAG0cc6d7334 [2025-02-05 16:08:52,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9f0ecc7ec/f25692ef6b544f489e0b9d8564224ae8 [2025-02-05 16:08:52,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:08:52,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:08:52,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:08:52,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:08:52,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:08:52,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f460129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52, skipping insertion in model container [2025-02-05 16:08:52,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:08:52,452 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2025-02-05 16:08:52,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:08:52,518 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:08:52,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c[697,710] [2025-02-05 16:08:52,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:08:52,570 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:08:52,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52 WrapperNode [2025-02-05 16:08:52,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:08:52,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:08:52,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:08:52,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:08:52,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,598 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 348 [2025-02-05 16:08:52,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:08:52,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:08:52,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:08:52,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:08:52,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,620 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-02-05 16:08:52,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,625 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:08:52,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:08:52,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:08:52,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:08:52,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (1/1) ... [2025-02-05 16:08:52,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:08:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:08:52,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:08:52,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:08:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:08:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:08:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:08:52,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:08:52,737 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:08:52,738 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:08:53,097 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 16:08:53,098 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:08:53,109 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:08:53,109 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:08:53,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:08:53 BoogieIcfgContainer [2025-02-05 16:08:53,109 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:08:53,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:08:53,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:08:53,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:08:53,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:08:52" (1/3) ... [2025-02-05 16:08:53,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6824ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:08:53, skipping insertion in model container [2025-02-05 16:08:53,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:08:52" (2/3) ... [2025-02-05 16:08:53,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6824ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:08:53, skipping insertion in model container [2025-02-05 16:08:53,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:08:53" (3/3) ... [2025-02-05 16:08:53,119 INFO L128 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2025-02-05 16:08:53,131 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:08:53,132 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG toy.cil.c that has 1 procedures, 136 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-02-05 16:08:53,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:08:53,180 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;@13c01707, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:08:53,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:08:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:53,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:53,189 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] [2025-02-05 16:08:53,190 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:53,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -515177827, now seen corresponding path program 1 times [2025-02-05 16:08:53,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:53,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069936060] [2025-02-05 16:08:53,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:53,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:53,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:53,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:53,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:53,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:53,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069936060] [2025-02-05 16:08:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069936060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:53,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:53,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780260253] [2025-02-05 16:08:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:53,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:53,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:53,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:53,484 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:53,514 INFO L93 Difference]: Finished difference Result 265 states and 464 transitions. [2025-02-05 16:08:53,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:53,521 INFO L225 Difference]: With dead ends: 265 [2025-02-05 16:08:53,521 INFO L226 Difference]: Without dead ends: 131 [2025-02-05 16:08:53,523 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-02-05 16:08:53,525 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:53,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-05 16:08:53,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-02-05 16:08:53,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7230769230769232) internal successors, (224), 130 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 224 transitions. [2025-02-05 16:08:53,573 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 224 transitions. Word has length 36 [2025-02-05 16:08:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:53,573 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 224 transitions. [2025-02-05 16:08:53,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 224 transitions. [2025-02-05 16:08:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:53,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:53,574 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] [2025-02-05 16:08:53,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:08:53,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:53,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1668499100, now seen corresponding path program 1 times [2025-02-05 16:08:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373874369] [2025-02-05 16:08:53,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:53,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:53,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:53,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:53,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373874369] [2025-02-05 16:08:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373874369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:53,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:53,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:53,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206626783] [2025-02-05 16:08:53,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:53,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:53,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:53,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:53,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:53,661 INFO L87 Difference]: Start difference. First operand 131 states and 224 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:53,711 INFO L93 Difference]: Finished difference Result 355 states and 604 transitions. [2025-02-05 16:08:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:08:53,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:53,713 INFO L225 Difference]: With dead ends: 355 [2025-02-05 16:08:53,713 INFO L226 Difference]: Without dead ends: 227 [2025-02-05 16:08:53,713 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-02-05 16:08:53,714 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 586 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:53,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-05 16:08:53,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2025-02-05 16:08:53,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6995515695067265) internal successors, (379), 223 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 379 transitions. [2025-02-05 16:08:53,731 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 379 transitions. Word has length 36 [2025-02-05 16:08:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 379 transitions. [2025-02-05 16:08:53,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 379 transitions. [2025-02-05 16:08:53,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:53,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:53,733 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] [2025-02-05 16:08:53,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:08:53,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:53,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:53,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1933366499, now seen corresponding path program 1 times [2025-02-05 16:08:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668620774] [2025-02-05 16:08:53,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:53,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:53,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:53,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:53,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:53,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668620774] [2025-02-05 16:08:53,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668620774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:53,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:53,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:53,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691160700] [2025-02-05 16:08:53,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:53,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:53,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:53,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:53,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:53,839 INFO L87 Difference]: Start difference. First operand 224 states and 379 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:53,885 INFO L93 Difference]: Finished difference Result 439 states and 745 transitions. [2025-02-05 16:08:53,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:53,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:53,888 INFO L225 Difference]: With dead ends: 439 [2025-02-05 16:08:53,891 INFO L226 Difference]: Without dead ends: 224 [2025-02-05 16:08:53,892 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-02-05 16:08:53,892 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:53,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-05 16:08:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-02-05 16:08:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6457399103139014) internal successors, (367), 223 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 367 transitions. [2025-02-05 16:08:53,905 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 367 transitions. Word has length 36 [2025-02-05 16:08:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:53,905 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 367 transitions. [2025-02-05 16:08:53,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:53,905 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 367 transitions. [2025-02-05 16:08:53,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:53,906 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:53,906 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] [2025-02-05 16:08:53,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:08:53,906 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:53,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1596330075, now seen corresponding path program 1 times [2025-02-05 16:08:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010004681] [2025-02-05 16:08:53,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:53,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:53,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:53,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:53,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:53,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:53,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010004681] [2025-02-05 16:08:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010004681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640179874] [2025-02-05 16:08:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:53,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:53,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:53,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:53,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:53,969 INFO L87 Difference]: Start difference. First operand 224 states and 367 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,051 INFO L93 Difference]: Finished difference Result 613 states and 1004 transitions. [2025-02-05 16:08:54,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:08:54,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,053 INFO L225 Difference]: With dead ends: 613 [2025-02-05 16:08:54,053 INFO L226 Difference]: Without dead ends: 399 [2025-02-05 16:08:54,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:54,055 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 377 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 470 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:08:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-05 16:08:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 224. [2025-02-05 16:08:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6322869955156951) internal successors, (364), 223 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 364 transitions. [2025-02-05 16:08:54,079 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 364 transitions. Word has length 36 [2025-02-05 16:08:54,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:54,079 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 364 transitions. [2025-02-05 16:08:54,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,079 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 364 transitions. [2025-02-05 16:08:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:54,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:54,080 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] [2025-02-05 16:08:54,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:08:54,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:54,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1737023204, now seen corresponding path program 1 times [2025-02-05 16:08:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671102812] [2025-02-05 16:08:54,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:54,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:54,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:54,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:54,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:54,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:54,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671102812] [2025-02-05 16:08:54,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671102812] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:54,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:54,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:54,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530257637] [2025-02-05 16:08:54,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:54,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:54,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:54,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:54,120 INFO L87 Difference]: Start difference. First operand 224 states and 364 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,194 INFO L93 Difference]: Finished difference Result 614 states and 998 transitions. [2025-02-05 16:08:54,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:08:54,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,196 INFO L225 Difference]: With dead ends: 614 [2025-02-05 16:08:54,196 INFO L226 Difference]: Without dead ends: 401 [2025-02-05 16:08:54,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:54,197 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 375 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 477 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-05 16:08:54,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 224. [2025-02-05 16:08:54,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6188340807174888) internal successors, (361), 223 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 361 transitions. [2025-02-05 16:08:54,207 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 361 transitions. Word has length 36 [2025-02-05 16:08:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:54,207 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 361 transitions. [2025-02-05 16:08:54,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,207 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 361 transitions. [2025-02-05 16:08:54,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:54,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:54,208 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] [2025-02-05 16:08:54,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:08:54,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:54,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:54,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1706003397, now seen corresponding path program 1 times [2025-02-05 16:08:54,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:54,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973172149] [2025-02-05 16:08:54,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:54,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:54,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:54,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:54,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:54,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973172149] [2025-02-05 16:08:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973172149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:54,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:54,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505811031] [2025-02-05 16:08:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:54,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:54,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:54,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:54,245 INFO L87 Difference]: Start difference. First operand 224 states and 361 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,314 INFO L93 Difference]: Finished difference Result 767 states and 1232 transitions. [2025-02-05 16:08:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:08:54,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,316 INFO L225 Difference]: With dead ends: 767 [2025-02-05 16:08:54,316 INFO L226 Difference]: Without dead ends: 556 [2025-02-05 16:08:54,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:54,317 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 379 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 586 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-02-05 16:08:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 369. [2025-02-05 16:08:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.6005434782608696) internal successors, (589), 368 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 589 transitions. [2025-02-05 16:08:54,332 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 589 transitions. Word has length 36 [2025-02-05 16:08:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 589 transitions. [2025-02-05 16:08:54,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 589 transitions. [2025-02-05 16:08:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:54,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:54,334 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] [2025-02-05 16:08:54,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:08:54,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1773010150, now seen corresponding path program 1 times [2025-02-05 16:08:54,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:54,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319536106] [2025-02-05 16:08:54,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:54,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:54,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:54,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:54,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:54,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319536106] [2025-02-05 16:08:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319536106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:54,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918800912] [2025-02-05 16:08:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:54,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:54,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:54,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:54,378 INFO L87 Difference]: Start difference. First operand 369 states and 589 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,474 INFO L93 Difference]: Finished difference Result 1123 states and 1796 transitions. [2025-02-05 16:08:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:08:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,478 INFO L225 Difference]: With dead ends: 1123 [2025-02-05 16:08:54,478 INFO L226 Difference]: Without dead ends: 768 [2025-02-05 16:08:54,479 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-02-05 16:08:54,479 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 503 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 573 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:08:54,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-02-05 16:08:54,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 644. [2025-02-05 16:08:54,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5863141524105755) internal successors, (1020), 643 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1020 transitions. [2025-02-05 16:08:54,517 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1020 transitions. Word has length 36 [2025-02-05 16:08:54,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:54,517 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 1020 transitions. [2025-02-05 16:08:54,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,517 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1020 transitions. [2025-02-05 16:08:54,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:54,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:54,518 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] [2025-02-05 16:08:54,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:08:54,518 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash 128318485, now seen corresponding path program 1 times [2025-02-05 16:08:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252329279] [2025-02-05 16:08:54,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:54,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:54,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:54,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252329279] [2025-02-05 16:08:54,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252329279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:54,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:54,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:54,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208111549] [2025-02-05 16:08:54,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:54,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:54,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:54,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:54,554 INFO L87 Difference]: Start difference. First operand 644 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,595 INFO L93 Difference]: Finished difference Result 1591 states and 2523 transitions. [2025-02-05 16:08:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,599 INFO L225 Difference]: With dead ends: 1591 [2025-02-05 16:08:54,599 INFO L226 Difference]: Without dead ends: 959 [2025-02-05 16:08:54,600 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-02-05 16:08:54,600 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 178 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 348 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:54,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-02-05 16:08:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2025-02-05 16:08:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5679916317991631) internal successors, (1499), 956 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1499 transitions. [2025-02-05 16:08:54,633 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1499 transitions. Word has length 36 [2025-02-05 16:08:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:54,633 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1499 transitions. [2025-02-05 16:08:54,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1499 transitions. [2025-02-05 16:08:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:54,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:54,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:54,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:08:54,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:54,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:54,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1374312493, now seen corresponding path program 1 times [2025-02-05 16:08:54,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:54,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572526306] [2025-02-05 16:08:54,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:54,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:54,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:54,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:54,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:54,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:54,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572526306] [2025-02-05 16:08:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572526306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:54,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:54,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:54,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501652266] [2025-02-05 16:08:54,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:54,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:54,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:54,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:54,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:54,679 INFO L87 Difference]: Start difference. First operand 957 states and 1499 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,771 INFO L93 Difference]: Finished difference Result 2480 states and 3884 transitions. [2025-02-05 16:08:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:08:54,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,777 INFO L225 Difference]: With dead ends: 2480 [2025-02-05 16:08:54,777 INFO L226 Difference]: Without dead ends: 1539 [2025-02-05 16:08:54,779 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-02-05 16:08:54,779 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 489 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 336 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-02-05 16:08:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 957. [2025-02-05 16:08:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5564853556485356) internal successors, (1488), 956 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1488 transitions. [2025-02-05 16:08:54,816 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1488 transitions. Word has length 36 [2025-02-05 16:08:54,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:54,816 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1488 transitions. [2025-02-05 16:08:54,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1488 transitions. [2025-02-05 16:08:54,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:54,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:54,817 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] [2025-02-05 16:08:54,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:08:54,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:54,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:54,818 INFO L85 PathProgramCache]: Analyzing trace with hash -21002796, now seen corresponding path program 1 times [2025-02-05 16:08:54,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:54,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482674813] [2025-02-05 16:08:54,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:54,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:54,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482674813] [2025-02-05 16:08:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482674813] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521018878] [2025-02-05 16:08:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:54,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:54,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:54,858 INFO L87 Difference]: Start difference. First operand 957 states and 1488 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:54,953 INFO L93 Difference]: Finished difference Result 2484 states and 3845 transitions. [2025-02-05 16:08:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:08:54,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:54,961 INFO L225 Difference]: With dead ends: 2484 [2025-02-05 16:08:54,962 INFO L226 Difference]: Without dead ends: 1549 [2025-02-05 16:08:54,964 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-02-05 16:08:54,965 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 473 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:54,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 325 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:54,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-02-05 16:08:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 957. [2025-02-05 16:08:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5418410041841004) internal successors, (1474), 956 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1474 transitions. [2025-02-05 16:08:55,022 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1474 transitions. Word has length 36 [2025-02-05 16:08:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:55,022 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1474 transitions. [2025-02-05 16:08:55,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1474 transitions. [2025-02-05 16:08:55,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:55,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:55,023 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] [2025-02-05 16:08:55,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:08:55,023 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:55,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1486549013, now seen corresponding path program 1 times [2025-02-05 16:08:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:55,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695988848] [2025-02-05 16:08:55,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:55,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:55,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:55,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:55,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:55,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:55,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695988848] [2025-02-05 16:08:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695988848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:55,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:55,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69304309] [2025-02-05 16:08:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:55,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:55,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:55,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:55,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:55,072 INFO L87 Difference]: Start difference. First operand 957 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:55,155 INFO L93 Difference]: Finished difference Result 2162 states and 3318 transitions. [2025-02-05 16:08:55,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:08:55,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:55,160 INFO L225 Difference]: With dead ends: 2162 [2025-02-05 16:08:55,161 INFO L226 Difference]: Without dead ends: 1233 [2025-02-05 16:08:55,163 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-02-05 16:08:55,164 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 475 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:55,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 359 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-02-05 16:08:55,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1044. [2025-02-05 16:08:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 1.516778523489933) internal successors, (1582), 1043 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1582 transitions. [2025-02-05 16:08:55,216 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1582 transitions. Word has length 36 [2025-02-05 16:08:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:55,216 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1582 transitions. [2025-02-05 16:08:55,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1582 transitions. [2025-02-05 16:08:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 16:08:55,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:55,217 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] [2025-02-05 16:08:55,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:08:55,217 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:55,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:55,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1193146006, now seen corresponding path program 1 times [2025-02-05 16:08:55,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:55,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160968399] [2025-02-05 16:08:55,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:55,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:55,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 16:08:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 16:08:55,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:55,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:55,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160968399] [2025-02-05 16:08:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160968399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:55,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:55,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238899713] [2025-02-05 16:08:55,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:55,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:55,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:55,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:55,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:55,249 INFO L87 Difference]: Start difference. First operand 1044 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:55,323 INFO L93 Difference]: Finished difference Result 2309 states and 3499 transitions. [2025-02-05 16:08:55,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:55,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-02-05 16:08:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:55,328 INFO L225 Difference]: With dead ends: 2309 [2025-02-05 16:08:55,328 INFO L226 Difference]: Without dead ends: 1280 [2025-02-05 16:08:55,330 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-02-05 16:08:55,330 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 121 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:55,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 320 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-02-05 16:08:55,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1277. [2025-02-05 16:08:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1276 states have (on average 1.5070532915360502) internal successors, (1923), 1276 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1923 transitions. [2025-02-05 16:08:55,385 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1923 transitions. Word has length 36 [2025-02-05 16:08:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:55,385 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1923 transitions. [2025-02-05 16:08:55,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1923 transitions. [2025-02-05 16:08:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:08:55,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:55,386 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:08:55,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:08:55,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1228465586, now seen corresponding path program 1 times [2025-02-05 16:08:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291720972] [2025-02-05 16:08:55,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:55,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:08:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:08:55,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:55,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:55,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291720972] [2025-02-05 16:08:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291720972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914731571] [2025-02-05 16:08:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:55,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:55,420 INFO L87 Difference]: Start difference. First operand 1277 states and 1923 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:55,485 INFO L93 Difference]: Finished difference Result 3185 states and 4835 transitions. [2025-02-05 16:08:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-02-05 16:08:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:55,493 INFO L225 Difference]: With dead ends: 3185 [2025-02-05 16:08:55,493 INFO L226 Difference]: Without dead ends: 1935 [2025-02-05 16:08:55,495 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-02-05 16:08:55,496 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 84 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:55,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 426 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-02-05 16:08:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1933. [2025-02-05 16:08:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1932 states have (on average 1.5082815734989647) internal successors, (2914), 1932 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2914 transitions. [2025-02-05 16:08:55,566 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2914 transitions. Word has length 47 [2025-02-05 16:08:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:55,566 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2914 transitions. [2025-02-05 16:08:55,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2914 transitions. [2025-02-05 16:08:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 16:08:55,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:55,567 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:08:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:08:55,568 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1677162225, now seen corresponding path program 1 times [2025-02-05 16:08:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215311541] [2025-02-05 16:08:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:55,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 16:08:55,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 16:08:55,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:55,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:08:55,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215311541] [2025-02-05 16:08:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215311541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358144811] [2025-02-05 16:08:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:55,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:55,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:55,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:55,612 INFO L87 Difference]: Start difference. First operand 1933 states and 2914 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:55,678 INFO L93 Difference]: Finished difference Result 3817 states and 5768 transitions. [2025-02-05 16:08:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:55,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-05 16:08:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:55,685 INFO L225 Difference]: With dead ends: 3817 [2025-02-05 16:08:55,685 INFO L226 Difference]: Without dead ends: 1911 [2025-02-05 16:08:55,687 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-02-05 16:08:55,687 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:55,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-02-05 16:08:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2025-02-05 16:08:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 1.5109947643979058) internal successors, (2886), 1910 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2886 transitions. [2025-02-05 16:08:55,752 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2886 transitions. Word has length 47 [2025-02-05 16:08:55,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:55,752 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 2886 transitions. [2025-02-05 16:08:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2886 transitions. [2025-02-05 16:08:55,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 16:08:55,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:55,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:55,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:08:55,754 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:55,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash -919782336, now seen corresponding path program 1 times [2025-02-05 16:08:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:55,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296333370] [2025-02-05 16:08:55,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:55,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 16:08:55,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 16:08:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:55,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296333370] [2025-02-05 16:08:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296333370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:55,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940754369] [2025-02-05 16:08:55,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:55,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:55,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:55,787 INFO L87 Difference]: Start difference. First operand 1911 states and 2886 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:55,881 INFO L93 Difference]: Finished difference Result 4920 states and 7483 transitions. [2025-02-05 16:08:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:55,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-02-05 16:08:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:55,891 INFO L225 Difference]: With dead ends: 4920 [2025-02-05 16:08:55,892 INFO L226 Difference]: Without dead ends: 3036 [2025-02-05 16:08:55,894 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-02-05 16:08:55,895 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 83 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:55,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-02-05 16:08:56,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 3034. [2025-02-05 16:08:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 1.511045169798879) internal successors, (4583), 3033 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4583 transitions. [2025-02-05 16:08:56,019 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4583 transitions. Word has length 48 [2025-02-05 16:08:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:56,019 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4583 transitions. [2025-02-05 16:08:56,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4583 transitions. [2025-02-05 16:08:56,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 16:08:56,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:56,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:56,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:08:56,021 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:56,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1368478975, now seen corresponding path program 1 times [2025-02-05 16:08:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:56,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-02-05 16:08:56,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:56,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:56,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 16:08:56,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 16:08:56,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:56,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:08:56,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:56,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99009243] [2025-02-05 16:08:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99009243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:56,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:56,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:56,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753315168] [2025-02-05 16:08:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:56,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:56,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:56,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:56,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:56,057 INFO L87 Difference]: Start difference. First operand 3034 states and 4583 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:56,183 INFO L93 Difference]: Finished difference Result 6018 states and 9107 transitions. [2025-02-05 16:08:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:56,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-02-05 16:08:56,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:56,193 INFO L225 Difference]: With dead ends: 6018 [2025-02-05 16:08:56,194 INFO L226 Difference]: Without dead ends: 3013 [2025-02-05 16:08:56,197 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-02-05 16:08:56,198 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:56,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 185 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:56,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2025-02-05 16:08:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2025-02-05 16:08:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.5129482071713147) internal successors, (4557), 3012 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4557 transitions. [2025-02-05 16:08:56,335 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4557 transitions. Word has length 48 [2025-02-05 16:08:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:56,336 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 4557 transitions. [2025-02-05 16:08:56,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4557 transitions. [2025-02-05 16:08:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 16:08:56,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:56,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:56,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:08:56,337 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:56,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash 896768132, now seen corresponding path program 1 times [2025-02-05 16:08:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453570392] [2025-02-05 16:08:56,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:56,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:56,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 16:08:56,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 16:08:56,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453570392] [2025-02-05 16:08:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453570392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:56,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401344093] [2025-02-05 16:08:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:56,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:56,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:56,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:56,364 INFO L87 Difference]: Start difference. First operand 3013 states and 4557 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:56,502 INFO L93 Difference]: Finished difference Result 8088 states and 12374 transitions. [2025-02-05 16:08:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:56,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-02-05 16:08:56,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:56,524 INFO L225 Difference]: With dead ends: 8088 [2025-02-05 16:08:56,524 INFO L226 Difference]: Without dead ends: 5104 [2025-02-05 16:08:56,529 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-02-05 16:08:56,529 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 88 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:56,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 393 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2025-02-05 16:08:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5102. [2025-02-05 16:08:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 5101 states have (on average 1.524014899039404) internal successors, (7774), 5101 states have internal predecessors, (7774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 7774 transitions. [2025-02-05 16:08:56,718 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 7774 transitions. Word has length 49 [2025-02-05 16:08:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:56,718 INFO L471 AbstractCegarLoop]: Abstraction has 5102 states and 7774 transitions. [2025-02-05 16:08:56,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 7774 transitions. [2025-02-05 16:08:56,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 16:08:56,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:56,720 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:56,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:08:56,721 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:56,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash 448071493, now seen corresponding path program 1 times [2025-02-05 16:08:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-02-05 16:08:56,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:56,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:56,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 16:08:56,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 16:08:56,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:56,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:08:56,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:56,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986223479] [2025-02-05 16:08:56,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986223479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:56,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818866659] [2025-02-05 16:08:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:56,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:56,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:56,746 INFO L87 Difference]: Start difference. First operand 5102 states and 7774 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:56,910 INFO L93 Difference]: Finished difference Result 10153 states and 15490 transitions. [2025-02-05 16:08:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:56,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 49 [2025-02-05 16:08:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:56,932 INFO L225 Difference]: With dead ends: 10153 [2025-02-05 16:08:56,932 INFO L226 Difference]: Without dead ends: 5080 [2025-02-05 16:08:56,938 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-02-05 16:08:56,939 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:56,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 184 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2025-02-05 16:08:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 5080. [2025-02-05 16:08:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 5079 states have (on average 1.5254971451073045) internal successors, (7748), 5079 states have internal predecessors, (7748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 7748 transitions. [2025-02-05 16:08:57,181 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 7748 transitions. Word has length 49 [2025-02-05 16:08:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:57,182 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 7748 transitions. [2025-02-05 16:08:57,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 7748 transitions. [2025-02-05 16:08:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 16:08:57,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:57,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:08:57,184 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:57,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1230131702, now seen corresponding path program 1 times [2025-02-05 16:08:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202274279] [2025-02-05 16:08:57,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:57,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 16:08:57,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 16:08:57,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:57,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:57,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202274279] [2025-02-05 16:08:57,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202274279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:57,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:57,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:08:57,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484719333] [2025-02-05 16:08:57,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:57,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:08:57,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:57,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:08:57,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:08:57,236 INFO L87 Difference]: Start difference. First operand 5080 states and 7748 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:57,488 INFO L93 Difference]: Finished difference Result 12436 states and 18956 transitions. [2025-02-05 16:08:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:08:57,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-02-05 16:08:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:57,503 INFO L225 Difference]: With dead ends: 12436 [2025-02-05 16:08:57,503 INFO L226 Difference]: Without dead ends: 6587 [2025-02-05 16:08:57,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:08:57,511 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 384 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:57,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 290 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:57,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6587 states. [2025-02-05 16:08:57,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6587 to 6587. [2025-02-05 16:08:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6586 states have (on average 1.4952930458548437) internal successors, (9848), 6586 states have internal predecessors, (9848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:57,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 9848 transitions. [2025-02-05 16:08:57,748 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 9848 transitions. Word has length 50 [2025-02-05 16:08:57,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:57,749 INFO L471 AbstractCegarLoop]: Abstraction has 6587 states and 9848 transitions. [2025-02-05 16:08:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:57,749 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 9848 transitions. [2025-02-05 16:08:57,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:08:57,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:57,751 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:08:57,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:08:57,751 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:57,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash -995044220, now seen corresponding path program 1 times [2025-02-05 16:08:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604876236] [2025-02-05 16:08:57,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:57,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:08:57,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:08:57,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:57,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:57,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:57,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:57,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604876236] [2025-02-05 16:08:57,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604876236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:57,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:57,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:08:57,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643332192] [2025-02-05 16:08:57,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:57,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:08:57,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:57,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:08:57,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:08:57,802 INFO L87 Difference]: Start difference. First operand 6587 states and 9848 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:58,095 INFO L93 Difference]: Finished difference Result 16297 states and 24247 transitions. [2025-02-05 16:08:58,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:08:58,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 16:08:58,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:58,119 INFO L225 Difference]: With dead ends: 16297 [2025-02-05 16:08:58,120 INFO L226 Difference]: Without dead ends: 9728 [2025-02-05 16:08:58,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:08:58,130 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 704 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:58,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 530 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9728 states. [2025-02-05 16:08:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9728 to 7198. [2025-02-05 16:08:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 7197 states have (on average 1.4649159371960538) internal successors, (10543), 7197 states have internal predecessors, (10543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:58,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 10543 transitions. [2025-02-05 16:08:58,419 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 10543 transitions. Word has length 56 [2025-02-05 16:08:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:58,420 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 10543 transitions. [2025-02-05 16:08:58,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 10543 transitions. [2025-02-05 16:08:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:08:58,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:58,426 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:58,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:08:58,427 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:58,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1986790900, now seen corresponding path program 1 times [2025-02-05 16:08:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013063372] [2025-02-05 16:08:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:58,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:08:58,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:08:58,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:58,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:58,464 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:58,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:58,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013063372] [2025-02-05 16:08:58,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013063372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:58,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:58,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272693125] [2025-02-05 16:08:58,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:58,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:58,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:58,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:58,466 INFO L87 Difference]: Start difference. First operand 7198 states and 10543 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:58,794 INFO L93 Difference]: Finished difference Result 14663 states and 21496 transitions. [2025-02-05 16:08:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:58,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-02-05 16:08:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:58,811 INFO L225 Difference]: With dead ends: 14663 [2025-02-05 16:08:58,811 INFO L226 Difference]: Without dead ends: 7494 [2025-02-05 16:08:58,822 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-02-05 16:08:58,822 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 129 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:58,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7494 states. [2025-02-05 16:08:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7494 to 7462. [2025-02-05 16:08:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7462 states, 7461 states have (on average 1.4288969307063397) internal successors, (10661), 7461 states have internal predecessors, (10661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 10661 transitions. [2025-02-05 16:08:59,216 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 10661 transitions. Word has length 93 [2025-02-05 16:08:59,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:59,217 INFO L471 AbstractCegarLoop]: Abstraction has 7462 states and 10661 transitions. [2025-02-05 16:08:59,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 10661 transitions. [2025-02-05 16:08:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:08:59,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:59,222 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:59,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:08:59,222 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:59,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:59,223 INFO L85 PathProgramCache]: Analyzing trace with hash 979009057, now seen corresponding path program 1 times [2025-02-05 16:08:59,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:59,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538038747] [2025-02-05 16:08:59,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:59,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:08:59,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:08:59,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:59,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:59,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:59,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538038747] [2025-02-05 16:08:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538038747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536112435] [2025-02-05 16:08:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:59,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:59,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:59,275 INFO L87 Difference]: Start difference. First operand 7462 states and 10661 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:08:59,466 INFO L93 Difference]: Finished difference Result 15361 states and 21956 transitions. [2025-02-05 16:08:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:08:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-02-05 16:08:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:08:59,484 INFO L225 Difference]: With dead ends: 15361 [2025-02-05 16:08:59,484 INFO L226 Difference]: Without dead ends: 7940 [2025-02-05 16:08:59,493 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-02-05 16:08:59,495 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 129 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:08:59,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 319 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:08:59,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2025-02-05 16:08:59,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7892. [2025-02-05 16:08:59,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7892 states, 7891 states have (on average 1.3920922570016474) internal successors, (10985), 7891 states have internal predecessors, (10985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:59,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 10985 transitions. [2025-02-05 16:08:59,750 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 10985 transitions. Word has length 94 [2025-02-05 16:08:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:08:59,750 INFO L471 AbstractCegarLoop]: Abstraction has 7892 states and 10985 transitions. [2025-02-05 16:08:59,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:08:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 10985 transitions. [2025-02-05 16:08:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:08:59,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:08:59,755 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:08:59,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:08:59,755 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:08:59,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:08:59,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1851160074, now seen corresponding path program 1 times [2025-02-05 16:08:59,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:08:59,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900453355] [2025-02-05 16:08:59,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:08:59,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:08:59,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:08:59,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:08:59,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:08:59,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:08:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:08:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:08:59,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900453355] [2025-02-05 16:08:59,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900453355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:08:59,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:08:59,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:08:59,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025261468] [2025-02-05 16:08:59,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:08:59,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:08:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:08:59,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:08:59,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:08:59,785 INFO L87 Difference]: Start difference. First operand 7892 states and 10985 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:00,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:00,013 INFO L93 Difference]: Finished difference Result 15990 states and 22320 transitions. [2025-02-05 16:09:00,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-02-05 16:09:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:00,034 INFO L225 Difference]: With dead ends: 15990 [2025-02-05 16:09:00,034 INFO L226 Difference]: Without dead ends: 8159 [2025-02-05 16:09:00,043 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-02-05 16:09:00,044 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 126 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:00,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 316 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2025-02-05 16:09:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 7438. [2025-02-05 16:09:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7437 states have (on average 1.3372327551432028) internal successors, (9945), 7437 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9945 transitions. [2025-02-05 16:09:00,269 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9945 transitions. Word has length 95 [2025-02-05 16:09:00,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:00,269 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 9945 transitions. [2025-02-05 16:09:00,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:00,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9945 transitions. [2025-02-05 16:09:00,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:09:00,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:00,274 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:09:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:09:00,274 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:00,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1246550497, now seen corresponding path program 1 times [2025-02-05 16:09:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987202881] [2025-02-05 16:09:00,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:00,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:09:00,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:09:00,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:00,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:09:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:00,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987202881] [2025-02-05 16:09:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987202881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471912665] [2025-02-05 16:09:00,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:00,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:00,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:00,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:00,304 INFO L87 Difference]: Start difference. First operand 7438 states and 9945 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:00,492 INFO L93 Difference]: Finished difference Result 13448 states and 18028 transitions. [2025-02-05 16:09:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:00,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 96 [2025-02-05 16:09:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:00,506 INFO L225 Difference]: With dead ends: 13448 [2025-02-05 16:09:00,506 INFO L226 Difference]: Without dead ends: 7438 [2025-02-05 16:09:00,514 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-02-05 16:09:00,515 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:00,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7438 states. [2025-02-05 16:09:00,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7438 to 7438. [2025-02-05 16:09:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7437 states have (on average 1.3354847384698132) internal successors, (9932), 7437 states have internal predecessors, (9932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:00,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9932 transitions. [2025-02-05 16:09:00,720 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9932 transitions. Word has length 96 [2025-02-05 16:09:00,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:00,720 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 9932 transitions. [2025-02-05 16:09:00,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:00,720 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9932 transitions. [2025-02-05 16:09:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:09:00,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:00,724 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:09:00,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:09:00,725 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:00,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash -740991872, now seen corresponding path program 1 times [2025-02-05 16:09:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:00,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947517184] [2025-02-05 16:09:00,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:00,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:00,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:09:00,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:09:00,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:00,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:09:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947517184] [2025-02-05 16:09:00,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947517184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:00,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:09:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662774354] [2025-02-05 16:09:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:00,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:09:00,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:00,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:09:00,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:09:00,790 INFO L87 Difference]: Start difference. First operand 7438 states and 9932 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:01,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:01,232 INFO L93 Difference]: Finished difference Result 13984 states and 18615 transitions. [2025-02-05 16:09:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:09:01,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 96 [2025-02-05 16:09:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:01,242 INFO L225 Difference]: With dead ends: 13984 [2025-02-05 16:09:01,243 INFO L226 Difference]: Without dead ends: 5793 [2025-02-05 16:09:01,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:09:01,249 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 444 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:01,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 397 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:09:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2025-02-05 16:09:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5679. [2025-02-05 16:09:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5678 states have (on average 1.2962310672772104) internal successors, (7360), 5678 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 7360 transitions. [2025-02-05 16:09:01,522 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 7360 transitions. Word has length 96 [2025-02-05 16:09:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 5679 states and 7360 transitions. [2025-02-05 16:09:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 7360 transitions. [2025-02-05 16:09:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 16:09:01,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:01,530 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:09:01,530 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:01,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -473288378, now seen corresponding path program 1 times [2025-02-05 16:09:01,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:01,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679111518] [2025-02-05 16:09:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:01,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 16:09:01,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 16:09:01,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:01,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:09:01,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:01,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679111518] [2025-02-05 16:09:01,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679111518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:01,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:01,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:01,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493542646] [2025-02-05 16:09:01,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:01,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:01,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:01,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:01,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:01,561 INFO L87 Difference]: Start difference. First operand 5679 states and 7360 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:01,694 INFO L93 Difference]: Finished difference Result 10880 states and 14084 transitions. [2025-02-05 16:09:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:01,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 125 [2025-02-05 16:09:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:01,703 INFO L225 Difference]: With dead ends: 10880 [2025-02-05 16:09:01,703 INFO L226 Difference]: Without dead ends: 5625 [2025-02-05 16:09:01,707 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-02-05 16:09:01,707 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:01,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 308 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2025-02-05 16:09:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 5625. [2025-02-05 16:09:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5625 states, 5624 states have (on average 1.2898293029871977) internal successors, (7254), 5624 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:01,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 7254 transitions. [2025-02-05 16:09:01,910 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 7254 transitions. Word has length 125 [2025-02-05 16:09:01,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:01,910 INFO L471 AbstractCegarLoop]: Abstraction has 5625 states and 7254 transitions. [2025-02-05 16:09:01,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:01,910 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 7254 transitions. [2025-02-05 16:09:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 16:09:01,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:01,919 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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, 1, 1, 1, 1, 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-02-05 16:09:01,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:09:01,919 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:01,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:01,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2146581322, now seen corresponding path program 1 times [2025-02-05 16:09:01,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620580557] [2025-02-05 16:09:01,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:01,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:01,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 16:09:01,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 16:09:01,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:01,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:09:01,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620580557] [2025-02-05 16:09:01,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620580557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:01,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:01,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:09:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621253870] [2025-02-05 16:09:01,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:01,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:09:01,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:01,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:09:01,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:09:01,986 INFO L87 Difference]: Start difference. First operand 5625 states and 7254 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:02,144 INFO L93 Difference]: Finished difference Result 10071 states and 13010 transitions. [2025-02-05 16:09:02,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:09:02,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-02-05 16:09:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:02,154 INFO L225 Difference]: With dead ends: 10071 [2025-02-05 16:09:02,154 INFO L226 Difference]: Without dead ends: 5533 [2025-02-05 16:09:02,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:09:02,159 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 315 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:02,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 321 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2025-02-05 16:09:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5531. [2025-02-05 16:09:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5530 states have (on average 1.2681735985533453) internal successors, (7013), 5530 states have internal predecessors, (7013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 7013 transitions. [2025-02-05 16:09:02,310 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 7013 transitions. Word has length 139 [2025-02-05 16:09:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 5531 states and 7013 transitions. [2025-02-05 16:09:02,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 7013 transitions. [2025-02-05 16:09:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:09:02,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:02,317 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:02,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:09:02,317 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:02,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1603753747, now seen corresponding path program 1 times [2025-02-05 16:09:02,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179747932] [2025-02-05 16:09:02,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:02,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:09:02,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:09:02,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:02,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 16:09:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:02,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179747932] [2025-02-05 16:09:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179747932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897358870] [2025-02-05 16:09:02,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:02,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:02,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:02,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:02,353 INFO L87 Difference]: Start difference. First operand 5531 states and 7013 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:02,487 INFO L93 Difference]: Finished difference Result 10637 states and 13476 transitions. [2025-02-05 16:09:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:02,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-05 16:09:02,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:02,497 INFO L225 Difference]: With dead ends: 10637 [2025-02-05 16:09:02,498 INFO L226 Difference]: Without dead ends: 5530 [2025-02-05 16:09:02,502 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-02-05 16:09:02,502 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 23 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:02,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 307 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2025-02-05 16:09:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 5490. [2025-02-05 16:09:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 5489 states have (on average 1.2625250501002003) internal successors, (6930), 5489 states have internal predecessors, (6930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 6930 transitions. [2025-02-05 16:09:02,697 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 6930 transitions. Word has length 144 [2025-02-05 16:09:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:02,698 INFO L471 AbstractCegarLoop]: Abstraction has 5490 states and 6930 transitions. [2025-02-05 16:09:02,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 6930 transitions. [2025-02-05 16:09:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-02-05 16:09:02,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:02,704 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:02,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:09:02,705 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1604412281, now seen corresponding path program 1 times [2025-02-05 16:09:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326247081] [2025-02-05 16:09:02,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:02,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:02,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-02-05 16:09:02,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-02-05 16:09:02,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:02,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 16:09:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:02,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326247081] [2025-02-05 16:09:02,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326247081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:02,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:02,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:02,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956413493] [2025-02-05 16:09:02,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:02,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:02,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:02,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:02,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:02,742 INFO L87 Difference]: Start difference. First operand 5490 states and 6930 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:02,887 INFO L93 Difference]: Finished difference Result 10576 states and 13337 transitions. [2025-02-05 16:09:02,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-02-05 16:09:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:02,896 INFO L225 Difference]: With dead ends: 10576 [2025-02-05 16:09:02,896 INFO L226 Difference]: Without dead ends: 5500 [2025-02-05 16:09:02,901 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-02-05 16:09:02,901 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:02,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 303 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5500 states. [2025-02-05 16:09:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5500 to 5460. [2025-02-05 16:09:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 1.256457226598278) internal successors, (6859), 5459 states have internal predecessors, (6859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 6859 transitions. [2025-02-05 16:09:03,048 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 6859 transitions. Word has length 144 [2025-02-05 16:09:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:03,048 INFO L471 AbstractCegarLoop]: Abstraction has 5460 states and 6859 transitions. [2025-02-05 16:09:03,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 6859 transitions. [2025-02-05 16:09:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:09:03,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:03,054 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:03,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:09:03,055 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:03,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:03,055 INFO L85 PathProgramCache]: Analyzing trace with hash 650584586, now seen corresponding path program 1 times [2025-02-05 16:09:03,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:03,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278135520] [2025-02-05 16:09:03,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:03,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:03,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:09:03,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:09:03,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:03,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 16:09:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278135520] [2025-02-05 16:09:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278135520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:03,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:03,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:09:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640160828] [2025-02-05 16:09:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:03,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:09:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:03,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:09:03,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:09:03,127 INFO L87 Difference]: Start difference. First operand 5460 states and 6859 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:03,247 INFO L93 Difference]: Finished difference Result 8778 states and 11075 transitions. [2025-02-05 16:09:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:09:03,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 149 [2025-02-05 16:09:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:03,255 INFO L225 Difference]: With dead ends: 8778 [2025-02-05 16:09:03,255 INFO L226 Difference]: Without dead ends: 3748 [2025-02-05 16:09:03,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:09:03,259 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 288 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:03,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 298 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2025-02-05 16:09:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3746. [2025-02-05 16:09:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3745 states have (on average 1.225634178905207) internal successors, (4590), 3745 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 4590 transitions. [2025-02-05 16:09:03,418 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 4590 transitions. Word has length 149 [2025-02-05 16:09:03,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:03,419 INFO L471 AbstractCegarLoop]: Abstraction has 3746 states and 4590 transitions. [2025-02-05 16:09:03,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 4590 transitions. [2025-02-05 16:09:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:09:03,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:03,424 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:03,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:09:03,424 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:03,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:03,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1942356060, now seen corresponding path program 1 times [2025-02-05 16:09:03,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:03,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677738069] [2025-02-05 16:09:03,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:03,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:09:03,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:09:03,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:03,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:09:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677738069] [2025-02-05 16:09:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677738069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:03,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:09:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125792927] [2025-02-05 16:09:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:03,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:09:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:03,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:09:03,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:09:03,498 INFO L87 Difference]: Start difference. First operand 3746 states and 4590 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:03,584 INFO L93 Difference]: Finished difference Result 5950 states and 7296 transitions. [2025-02-05 16:09:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:09:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 149 [2025-02-05 16:09:03,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:03,591 INFO L225 Difference]: With dead ends: 5950 [2025-02-05 16:09:03,591 INFO L226 Difference]: Without dead ends: 2301 [2025-02-05 16:09:03,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:09:03,595 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 288 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:03,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 291 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:03,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2025-02-05 16:09:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2299. [2025-02-05 16:09:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2298 states have (on average 1.1936466492602262) internal successors, (2743), 2298 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 2743 transitions. [2025-02-05 16:09:03,662 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 2743 transitions. Word has length 149 [2025-02-05 16:09:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:03,662 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 2743 transitions. [2025-02-05 16:09:03,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 2743 transitions. [2025-02-05 16:09:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 16:09:03,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:03,665 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 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-02-05 16:09:03,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:09:03,665 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:03,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:03,666 INFO L85 PathProgramCache]: Analyzing trace with hash 307239103, now seen corresponding path program 1 times [2025-02-05 16:09:03,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:03,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553733293] [2025-02-05 16:09:03,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:03,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:03,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 16:09:03,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 16:09:03,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:03,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 16:09:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553733293] [2025-02-05 16:09:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553733293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:03,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:03,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:03,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082445281] [2025-02-05 16:09:03,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:03,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:03,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:03,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:03,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:03,705 INFO L87 Difference]: Start difference. First operand 2299 states and 2743 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:03,772 INFO L93 Difference]: Finished difference Result 4135 states and 4970 transitions. [2025-02-05 16:09:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:03,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 188 [2025-02-05 16:09:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:03,778 INFO L225 Difference]: With dead ends: 4135 [2025-02-05 16:09:03,778 INFO L226 Difference]: Without dead ends: 2237 [2025-02-05 16:09:03,780 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-02-05 16:09:03,780 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:03,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 308 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2025-02-05 16:09:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2159. [2025-02-05 16:09:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2158 states have (on average 1.1793327154772937) internal successors, (2545), 2158 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2545 transitions. [2025-02-05 16:09:03,850 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2545 transitions. Word has length 188 [2025-02-05 16:09:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:03,851 INFO L471 AbstractCegarLoop]: Abstraction has 2159 states and 2545 transitions. [2025-02-05 16:09:03,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2545 transitions. [2025-02-05 16:09:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 16:09:03,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:03,852 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 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-02-05 16:09:03,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:09:03,853 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:03,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:03,853 INFO L85 PathProgramCache]: Analyzing trace with hash -476914583, now seen corresponding path program 1 times [2025-02-05 16:09:03,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:03,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799582727] [2025-02-05 16:09:03,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:03,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:03,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 16:09:03,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 16:09:03,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:03,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 16:09:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799582727] [2025-02-05 16:09:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799582727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:03,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321972378] [2025-02-05 16:09:03,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:03,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:03,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:03,887 INFO L87 Difference]: Start difference. First operand 2159 states and 2545 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:03,965 INFO L93 Difference]: Finished difference Result 4618 states and 5482 transitions. [2025-02-05 16:09:03,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:03,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-02-05 16:09:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:03,971 INFO L225 Difference]: With dead ends: 4618 [2025-02-05 16:09:03,972 INFO L226 Difference]: Without dead ends: 2854 [2025-02-05 16:09:03,973 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-02-05 16:09:03,974 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 136 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:03,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 304 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:03,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2025-02-05 16:09:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2453. [2025-02-05 16:09:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2452 states have (on average 1.1651712887438825) internal successors, (2857), 2452 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 2857 transitions. [2025-02-05 16:09:04,049 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 2857 transitions. Word has length 195 [2025-02-05 16:09:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:04,050 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 2857 transitions. [2025-02-05 16:09:04,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 2857 transitions. [2025-02-05 16:09:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 16:09:04,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:04,051 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:04,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:09:04,051 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:04,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:04,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1550299473, now seen corresponding path program 1 times [2025-02-05 16:09:04,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:04,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887843005] [2025-02-05 16:09:04,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:04,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:04,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 16:09:04,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 16:09:04,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 16:09:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887843005] [2025-02-05 16:09:04,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887843005] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:04,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:04,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:04,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430304006] [2025-02-05 16:09:04,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:04,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:04,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:04,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:04,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:04,084 INFO L87 Difference]: Start difference. First operand 2453 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:04,182 INFO L93 Difference]: Finished difference Result 4146 states and 4865 transitions. [2025-02-05 16:09:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-05 16:09:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:04,187 INFO L225 Difference]: With dead ends: 4146 [2025-02-05 16:09:04,187 INFO L226 Difference]: Without dead ends: 2086 [2025-02-05 16:09:04,189 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-02-05 16:09:04,189 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 3 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 303 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-02-05 16:09:04,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 303 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2025-02-05 16:09:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2005. [2025-02-05 16:09:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 2004 states have (on average 1.1492015968063871) internal successors, (2303), 2004 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2303 transitions. [2025-02-05 16:09:04,298 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2303 transitions. Word has length 198 [2025-02-05 16:09:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:04,298 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2303 transitions. [2025-02-05 16:09:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2303 transitions. [2025-02-05 16:09:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 16:09:04,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:04,300 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-02-05 16:09:04,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:09:04,300 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:04,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1806136208, now seen corresponding path program 1 times [2025-02-05 16:09:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976639267] [2025-02-05 16:09:04,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:04,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 16:09:04,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 16:09:04,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:04,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:09:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976639267] [2025-02-05 16:09:04,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976639267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:09:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356060346] [2025-02-05 16:09:04,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:04,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:09:04,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:09:04,661 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:09:04,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:09:04,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 16:09:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 16:09:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:04,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:04,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 16:09:04,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:09:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:09:05,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:09:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:09:05,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356060346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:09:05,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:09:05,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2025-02-05 16:09:05,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825595225] [2025-02-05 16:09:05,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:09:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-05 16:09:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:05,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-05 16:09:05,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:09:05,553 INFO L87 Difference]: Start difference. First operand 2005 states and 2303 transitions. Second operand has 27 states, 27 states have (on average 17.814814814814813) internal successors, (481), 27 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-02-05 16:09:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:07,020 INFO L93 Difference]: Finished difference Result 7156 states and 8238 transitions. [2025-02-05 16:09:07,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-05 16:09:07,021 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 17.814814814814813) internal successors, (481), 27 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) Word has length 198 [2025-02-05 16:09:07,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:07,032 INFO L225 Difference]: With dead ends: 7156 [2025-02-05 16:09:07,032 INFO L226 Difference]: Without dead ends: 5467 [2025-02-05 16:09:07,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=490, Invalid=3416, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 16:09:07,037 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 3562 mSDsluCounter, 7822 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3562 SdHoareTripleChecker+Valid, 8364 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:07,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3562 Valid, 8364 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:09:07,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2025-02-05 16:09:07,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 3004. [2025-02-05 16:09:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 1.1525141525141525) internal successors, (3461), 3003 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3461 transitions. [2025-02-05 16:09:07,196 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3461 transitions. Word has length 198 [2025-02-05 16:09:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:07,197 INFO L471 AbstractCegarLoop]: Abstraction has 3004 states and 3461 transitions. [2025-02-05 16:09:07,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.814814814814813) internal successors, (481), 27 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-02-05 16:09:07,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3461 transitions. [2025-02-05 16:09:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 16:09:07,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:07,199 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2025-02-05 16:09:07,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 16:09:07,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-05 16:09:07,400 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:07,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -607026488, now seen corresponding path program 1 times [2025-02-05 16:09:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778500390] [2025-02-05 16:09:07,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:07,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 16:09:07,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 16:09:07,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:07,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-02-05 16:09:07,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:07,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778500390] [2025-02-05 16:09:07,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778500390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:07,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181626239] [2025-02-05 16:09:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:07,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:07,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:07,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:07,457 INFO L87 Difference]: Start difference. First operand 3004 states and 3461 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:07,538 INFO L93 Difference]: Finished difference Result 4644 states and 5327 transitions. [2025-02-05 16:09:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 268 [2025-02-05 16:09:07,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:07,544 INFO L225 Difference]: With dead ends: 4644 [2025-02-05 16:09:07,544 INFO L226 Difference]: Without dead ends: 2004 [2025-02-05 16:09:07,546 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-02-05 16:09:07,547 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:07,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 318 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2025-02-05 16:09:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1949. [2025-02-05 16:09:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1948 states have (on average 1.129876796714579) internal successors, (2201), 1948 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-02-05 16:09:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2201 transitions. [2025-02-05 16:09:07,619 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2201 transitions. Word has length 268 [2025-02-05 16:09:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:07,620 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2201 transitions. [2025-02-05 16:09:07,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2201 transitions. [2025-02-05 16:09:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-05 16:09:07,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:07,622 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:09:07,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:09:07,622 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:07,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash -347996123, now seen corresponding path program 1 times [2025-02-05 16:09:07,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:07,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054432564] [2025-02-05 16:09:07,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:07,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:07,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-05 16:09:07,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-05 16:09:07,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:07,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-05 16:09:07,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:07,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054432564] [2025-02-05 16:09:07,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054432564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:07,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:07,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:09:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346894166] [2025-02-05 16:09:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:09:07,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:07,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:09:07,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:09:07,737 INFO L87 Difference]: Start difference. First operand 1949 states and 2201 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:07,826 INFO L93 Difference]: Finished difference Result 3583 states and 4055 transitions. [2025-02-05 16:09:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:09:07,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 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 276 [2025-02-05 16:09:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:07,832 INFO L225 Difference]: With dead ends: 3583 [2025-02-05 16:09:07,832 INFO L226 Difference]: Without dead ends: 1950 [2025-02-05 16:09:07,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-02-05 16:09:07,833 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 195 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:07,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 233 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-02-05 16:09:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1949. [2025-02-05 16:09:07,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1948 states have (on average 1.1196098562628336) internal successors, (2181), 1948 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2181 transitions. [2025-02-05 16:09:07,937 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2181 transitions. Word has length 276 [2025-02-05 16:09:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:07,937 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2181 transitions. [2025-02-05 16:09:07,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2181 transitions. [2025-02-05 16:09:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 16:09:07,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:09:07,940 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:09:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:09:07,940 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:09:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:09:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1392581146, now seen corresponding path program 1 times [2025-02-05 16:09:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:09:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557339435] [2025-02-05 16:09:07,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:09:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:09:07,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 16:09:07,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 16:09:07,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:09:07,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:09:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 16:09:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:09:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557339435] [2025-02-05 16:09:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557339435] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:09:07,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:09:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:09:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192760764] [2025-02-05 16:09:07,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:09:07,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:09:07,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:09:07,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:09:07,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:09:07,990 INFO L87 Difference]: Start difference. First operand 1949 states and 2181 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:09:08,034 INFO L93 Difference]: Finished difference Result 2234 states and 2491 transitions. [2025-02-05 16:09:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:09:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 278 [2025-02-05 16:09:08,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:09:08,038 INFO L225 Difference]: With dead ends: 2234 [2025-02-05 16:09:08,038 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 16:09:08,040 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-02-05 16:09:08,040 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 24 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:09:08,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 304 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:09:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 16:09:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 16:09:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:08,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 16:09:08,042 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2025-02-05 16:09:08,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:09:08,043 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 16:09:08,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:09:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 16:09:08,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 16:09:08,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 16:09:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:09:08,048 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 16:09:08,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 16:09:14,078 WARN L286 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 297 DAG size of output: 411 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 16:09:58,908 WARN L286 SmtUtils]: Spent 44.83s on a formula simplification. DAG size of input: 569 DAG size of output: 838 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-02-05 16:10:14,958 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 385 DAG size of output: 627 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)