./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:19:16,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:19:16,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:19:16,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:19:16,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:19:16,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:19:16,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:19:16,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:19:16,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:19:16,335 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:19:16,335 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:19:16,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:19:16,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:19:16,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:19:16,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:19:16,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:19:16,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:19:16,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:19:16,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:19:16,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:19:16,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:19:16,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:19:16,338 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bfb987fcec0e4e87ab47a565086b76b03edc9a60525cd8ee77a0c461c0fdaaa [2025-03-03 17:19:16,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:19:16,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:19:16,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:19:16,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:19:16,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:19:16,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2025-03-03 17:19:17,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56cbb127/f2e6c230d5ac491e9bd7f24339944bc9/FLAGf102bbd15 [2025-03-03 17:19:18,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:19:18,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2025-03-03 17:19:18,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56cbb127/f2e6c230d5ac491e9bd7f24339944bc9/FLAGf102bbd15 [2025-03-03 17:19:18,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e56cbb127/f2e6c230d5ac491e9bd7f24339944bc9 [2025-03-03 17:19:18,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:19:18,092 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:19:18,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:19:18,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:19:18,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:19:18,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221cd4b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18, skipping insertion in model container [2025-03-03 17:19:18,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:19:18,243 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2025-03-03 17:19:18,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:19:18,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:19:18,426 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c[1279,1292] [2025-03-03 17:19:18,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:19:18,515 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:19:18,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18 WrapperNode [2025-03-03 17:19:18,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:19:18,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:19:18,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:19:18,517 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:19:18,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,637 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1382 [2025-03-03 17:19:18,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:19:18,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:19:18,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:19:18,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:19:18,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,716 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:19:18,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,755 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,763 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:19:18,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:19:18,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:19:18,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:19:18,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (1/1) ... [2025-03-03 17:19:18,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:19:18,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:19:18,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:19:18,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:19:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:19:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 17:19:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 17:19:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:19:18,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:19:18,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:19:19,030 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:19:19,032 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:19:20,220 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-03 17:19:20,220 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:19:20,279 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:19:20,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:19:20,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:19:20 BoogieIcfgContainer [2025-03-03 17:19:20,280 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:19:20,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:19:20,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:19:20,285 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:19:20,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:19:18" (1/3) ... [2025-03-03 17:19:20,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c32e799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:19:20, skipping insertion in model container [2025-03-03 17:19:20,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:19:18" (2/3) ... [2025-03-03 17:19:20,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c32e799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:19:20, skipping insertion in model container [2025-03-03 17:19:20,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:19:20" (3/3) ... [2025-03-03 17:19:20,288 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c [2025-03-03 17:19:20,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:19:20,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.circular_pointer_top_w32_d8_e0.c that has 2 procedures, 392 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:19:20,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:19:20,356 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;@18f88ab3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:19:20,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:19:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 17:19:20,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:20,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:20,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 9518675, now seen corresponding path program 1 times [2025-03-03 17:19:20,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:20,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048944530] [2025-03-03 17:19:20,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:20,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:20,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 17:19:20,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 17:19:20,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:20,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:20,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 17:19:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048944530] [2025-03-03 17:19:20,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048944530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:19:20,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929817168] [2025-03-03 17:19:20,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:20,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:19:20,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:19:20,740 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:19:20,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:19:20,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 17:19:21,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 17:19:21,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:21,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 17:19:21,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:19:21,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 17:19:21,060 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:19:21,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929817168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:21,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:19:21,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 17:19:21,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675654534] [2025-03-03 17:19:21,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 17:19:21,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:21,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 17:19:21,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 17:19:21,090 INFO L87 Difference]: Start difference. First operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 17:19:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:21,254 INFO L93 Difference]: Finished difference Result 711 states and 1061 transitions. [2025-03-03 17:19:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 17:19:21,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117 [2025-03-03 17:19:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:21,264 INFO L225 Difference]: With dead ends: 711 [2025-03-03 17:19:21,264 INFO L226 Difference]: Without dead ends: 389 [2025-03-03 17:19:21,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 17:19:21,271 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:21,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 484 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:19:21,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-03 17:19:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-03 17:19:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4869791666666667) internal successors, (571), 384 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 577 transitions. [2025-03-03 17:19:21,321 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 577 transitions. Word has length 117 [2025-03-03 17:19:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:21,322 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 577 transitions. [2025-03-03 17:19:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 17:19:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 577 transitions. [2025-03-03 17:19:21,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 17:19:21,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:21,326 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:21,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:19:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 17:19:21,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:21,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -918513680, now seen corresponding path program 1 times [2025-03-03 17:19:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:21,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477226040] [2025-03-03 17:19:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:21,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 17:19:21,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 17:19:21,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:21,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:22,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477226040] [2025-03-03 17:19:22,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477226040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:22,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:22,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:22,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057943613] [2025-03-03 17:19:22,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:22,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:22,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:22,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:22,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:22,220 INFO L87 Difference]: Start difference. First operand 389 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:22,416 INFO L93 Difference]: Finished difference Result 393 states and 581 transitions. [2025-03-03 17:19:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:22,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2025-03-03 17:19:22,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:22,420 INFO L225 Difference]: With dead ends: 393 [2025-03-03 17:19:22,422 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 17:19:22,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:22,424 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 0 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:22,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 17:19:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-03-03 17:19:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4844559585492227) internal successors, (573), 386 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 579 transitions. [2025-03-03 17:19:22,442 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 579 transitions. Word has length 117 [2025-03-03 17:19:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 579 transitions. [2025-03-03 17:19:22,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 579 transitions. [2025-03-03 17:19:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 17:19:22,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:22,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:22,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:19:22,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1595526459, now seen corresponding path program 1 times [2025-03-03 17:19:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235816983] [2025-03-03 17:19:22,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:22,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 17:19:22,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 17:19:22,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:22,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:22,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235816983] [2025-03-03 17:19:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235816983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:22,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:22,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:22,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162041979] [2025-03-03 17:19:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:22,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:22,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:22,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:22,852 INFO L87 Difference]: Start difference. First operand 391 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:23,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:23,322 INFO L93 Difference]: Finished difference Result 971 states and 1441 transitions. [2025-03-03 17:19:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:23,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2025-03-03 17:19:23,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:23,325 INFO L225 Difference]: With dead ends: 971 [2025-03-03 17:19:23,326 INFO L226 Difference]: Without dead ends: 391 [2025-03-03 17:19:23,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:19:23,328 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1090 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:23,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1416 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-03 17:19:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2025-03-03 17:19:23,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4818652849740932) internal successors, (572), 386 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 578 transitions. [2025-03-03 17:19:23,343 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 578 transitions. Word has length 118 [2025-03-03 17:19:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:23,343 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 578 transitions. [2025-03-03 17:19:23,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 578 transitions. [2025-03-03 17:19:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 17:19:23,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:23,348 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:23,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:19:23,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:23,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1218222754, now seen corresponding path program 1 times [2025-03-03 17:19:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213279389] [2025-03-03 17:19:23,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:23,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:23,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 17:19:23,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 17:19:23,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:23,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:23,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:23,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213279389] [2025-03-03 17:19:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213279389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:23,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767730434] [2025-03-03 17:19:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:23,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:23,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:23,597 INFO L87 Difference]: Start difference. First operand 391 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:23,767 INFO L93 Difference]: Finished difference Result 714 states and 1055 transitions. [2025-03-03 17:19:23,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:23,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2025-03-03 17:19:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:23,769 INFO L225 Difference]: With dead ends: 714 [2025-03-03 17:19:23,769 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:23,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:23,770 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 0 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:23,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1435 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4793814432989691) internal successors, (574), 388 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:23,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 580 transitions. [2025-03-03 17:19:23,785 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 580 transitions. Word has length 119 [2025-03-03 17:19:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:23,786 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 580 transitions. [2025-03-03 17:19:23,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 580 transitions. [2025-03-03 17:19:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 17:19:23,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:23,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:23,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:19:23,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:23,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:23,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1473657464, now seen corresponding path program 1 times [2025-03-03 17:19:23,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:23,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862154969] [2025-03-03 17:19:23,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:23,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 17:19:23,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 17:19:23,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:23,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:24,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862154969] [2025-03-03 17:19:24,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862154969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:24,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:24,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997077272] [2025-03-03 17:19:24,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:24,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:24,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:24,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:24,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:24,195 INFO L87 Difference]: Start difference. First operand 393 states and 580 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:24,404 INFO L93 Difference]: Finished difference Result 716 states and 1056 transitions. [2025-03-03 17:19:24,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:24,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2025-03-03 17:19:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:24,406 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:24,406 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:24,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:24,407 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 478 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:24,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 900 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:24,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4768041237113403) internal successors, (573), 388 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 579 transitions. [2025-03-03 17:19:24,421 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 579 transitions. Word has length 120 [2025-03-03 17:19:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:24,421 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 579 transitions. [2025-03-03 17:19:24,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 579 transitions. [2025-03-03 17:19:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 17:19:24,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:24,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:24,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:19:24,424 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1845444275, now seen corresponding path program 1 times [2025-03-03 17:19:24,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340303737] [2025-03-03 17:19:24,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:24,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:24,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 17:19:24,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 17:19:24,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:24,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:24,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340303737] [2025-03-03 17:19:24,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340303737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:24,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:24,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:24,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048953279] [2025-03-03 17:19:24,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:24,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:24,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:24,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:24,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:24,681 INFO L87 Difference]: Start difference. First operand 393 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:24,916 INFO L93 Difference]: Finished difference Result 722 states and 1062 transitions. [2025-03-03 17:19:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:19:24,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 121 [2025-03-03 17:19:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:24,919 INFO L225 Difference]: With dead ends: 722 [2025-03-03 17:19:24,919 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:24,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:19:24,920 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 489 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:24,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 1401 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:24,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:24,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4742268041237114) internal successors, (572), 388 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 578 transitions. [2025-03-03 17:19:24,929 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 578 transitions. Word has length 121 [2025-03-03 17:19:24,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:24,929 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 578 transitions. [2025-03-03 17:19:24,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 578 transitions. [2025-03-03 17:19:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 17:19:24,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:24,931 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:24,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:19:24,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:24,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:24,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1276695705, now seen corresponding path program 1 times [2025-03-03 17:19:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020677455] [2025-03-03 17:19:24,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:24,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 17:19:24,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 17:19:24,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:25,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:25,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020677455] [2025-03-03 17:19:25,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020677455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:25,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:25,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:25,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545228503] [2025-03-03 17:19:25,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:25,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:25,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:25,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:25,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:25,165 INFO L87 Difference]: Start difference. First operand 393 states and 578 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:25,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:25,364 INFO L93 Difference]: Finished difference Result 716 states and 1052 transitions. [2025-03-03 17:19:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:25,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2025-03-03 17:19:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:25,367 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:25,367 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:25,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:25,370 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1039 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:25,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 900 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4716494845360826) internal successors, (571), 388 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 577 transitions. [2025-03-03 17:19:25,400 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 577 transitions. Word has length 122 [2025-03-03 17:19:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:25,400 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 577 transitions. [2025-03-03 17:19:25,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 577 transitions. [2025-03-03 17:19:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 17:19:25,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:25,401 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:25,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:19:25,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:25,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:25,402 INFO L85 PathProgramCache]: Analyzing trace with hash 20784658, now seen corresponding path program 1 times [2025-03-03 17:19:25,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934423471] [2025-03-03 17:19:25,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:25,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:25,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 17:19:25,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 17:19:25,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:25,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:25,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:25,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934423471] [2025-03-03 17:19:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934423471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:25,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:25,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:25,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691836681] [2025-03-03 17:19:25,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:25,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:25,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:25,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:25,619 INFO L87 Difference]: Start difference. First operand 393 states and 577 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:25,812 INFO L93 Difference]: Finished difference Result 716 states and 1050 transitions. [2025-03-03 17:19:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:25,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2025-03-03 17:19:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:25,814 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:25,815 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:25,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:25,816 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 1031 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:25,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 900 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:25,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4690721649484537) internal successors, (570), 388 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:25,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 576 transitions. [2025-03-03 17:19:25,824 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 576 transitions. Word has length 123 [2025-03-03 17:19:25,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:25,824 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 576 transitions. [2025-03-03 17:19:25,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:25,825 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 576 transitions. [2025-03-03 17:19:25,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 17:19:25,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:25,826 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:25,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:19:25,826 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:25,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1530727486, now seen corresponding path program 1 times [2025-03-03 17:19:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233206888] [2025-03-03 17:19:25,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:25,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 17:19:25,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 17:19:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:26,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233206888] [2025-03-03 17:19:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233206888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731634649] [2025-03-03 17:19:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:26,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:26,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:26,101 INFO L87 Difference]: Start difference. First operand 393 states and 576 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:26,261 INFO L93 Difference]: Finished difference Result 716 states and 1048 transitions. [2025-03-03 17:19:26,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:26,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2025-03-03 17:19:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:26,263 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:26,263 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:26,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:26,264 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 483 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:26,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 924 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:19:26,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 388 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2025-03-03 17:19:26,273 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 124 [2025-03-03 17:19:26,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:26,273 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2025-03-03 17:19:26,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:26,273 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2025-03-03 17:19:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 17:19:26,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:26,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:26,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:19:26,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2074811328, now seen corresponding path program 1 times [2025-03-03 17:19:26,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:26,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441809621] [2025-03-03 17:19:26,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:26,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:26,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 17:19:26,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 17:19:26,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:26,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:26,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:26,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441809621] [2025-03-03 17:19:26,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441809621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:26,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:26,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:26,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296713037] [2025-03-03 17:19:26,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:26,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:26,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:26,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:26,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:26,500 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:26,668 INFO L93 Difference]: Finished difference Result 716 states and 1044 transitions. [2025-03-03 17:19:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2025-03-03 17:19:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:26,670 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:26,670 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:26,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:26,671 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1033 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:26,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 924 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:19:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.461340206185567) internal successors, (567), 388 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions. [2025-03-03 17:19:26,681 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126 [2025-03-03 17:19:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:26,681 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 573 transitions. [2025-03-03 17:19:26,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions. [2025-03-03 17:19:26,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 17:19:26,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:26,685 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:26,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:19:26,685 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:26,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:26,686 INFO L85 PathProgramCache]: Analyzing trace with hash -146504235, now seen corresponding path program 1 times [2025-03-03 17:19:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:26,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000232575] [2025-03-03 17:19:26,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:26,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 17:19:26,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 17:19:26,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:26,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000232575] [2025-03-03 17:19:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000232575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:27,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:27,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:27,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733307574] [2025-03-03 17:19:27,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:27,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:27,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:27,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:27,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:27,014 INFO L87 Difference]: Start difference. First operand 393 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 17:19:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:27,187 INFO L93 Difference]: Finished difference Result 716 states and 1042 transitions. [2025-03-03 17:19:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:27,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2025-03-03 17:19:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:27,188 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:27,189 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:27,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:27,190 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 518 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:27,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 928 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:19:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions. [2025-03-03 17:19:27,198 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127 [2025-03-03 17:19:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:27,199 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 572 transitions. [2025-03-03 17:19:27,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 17:19:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions. [2025-03-03 17:19:27,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 17:19:27,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:27,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:27,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:19:27,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:27,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1012214780, now seen corresponding path program 1 times [2025-03-03 17:19:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:27,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901946180] [2025-03-03 17:19:27,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:27,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 17:19:27,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 17:19:27,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:27,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:27,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901946180] [2025-03-03 17:19:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901946180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274358186] [2025-03-03 17:19:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:27,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:27,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:27,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:27,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:27,484 INFO L87 Difference]: Start difference. First operand 393 states and 572 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 17:19:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:27,659 INFO L93 Difference]: Finished difference Result 716 states and 1040 transitions. [2025-03-03 17:19:27,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:27,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 128 [2025-03-03 17:19:27,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:27,661 INFO L225 Difference]: With dead ends: 716 [2025-03-03 17:19:27,661 INFO L226 Difference]: Without dead ends: 393 [2025-03-03 17:19:27,661 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-03-03 17:19:27,662 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 516 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:27,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 928 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-03-03 17:19:27,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2025-03-03 17:19:27,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4561855670103092) internal successors, (565), 388 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2025-03-03 17:19:27,670 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128 [2025-03-03 17:19:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:27,670 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 571 transitions. [2025-03-03 17:19:27,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 17:19:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions. [2025-03-03 17:19:27,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 17:19:27,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:27,671 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:27,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:19:27,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:27,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 436345397, now seen corresponding path program 1 times [2025-03-03 17:19:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143514012] [2025-03-03 17:19:27,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:27,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 17:19:27,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 17:19:27,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:27,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143514012] [2025-03-03 17:19:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143514012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:28,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:28,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:28,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812566853] [2025-03-03 17:19:28,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:28,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:28,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:28,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:28,100 INFO L87 Difference]: Start difference. First operand 393 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:28,416 INFO L93 Difference]: Finished difference Result 722 states and 1046 transitions. [2025-03-03 17:19:28,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:19:28,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2025-03-03 17:19:28,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:28,418 INFO L225 Difference]: With dead ends: 722 [2025-03-03 17:19:28,418 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 17:19:28,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:28,419 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 2 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:28,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1753 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:19:28,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 17:19:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2025-03-03 17:19:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4538461538461538) internal successors, (567), 390 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:28,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 573 transitions. [2025-03-03 17:19:28,430 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 573 transitions. Word has length 129 [2025-03-03 17:19:28,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:28,430 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 573 transitions. [2025-03-03 17:19:28,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 573 transitions. [2025-03-03 17:19:28,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 17:19:28,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:28,431 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:28,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:19:28,432 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:28,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -623471812, now seen corresponding path program 1 times [2025-03-03 17:19:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139341296] [2025-03-03 17:19:28,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:28,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 17:19:28,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 17:19:28,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:28,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:28,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:28,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139341296] [2025-03-03 17:19:28,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139341296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:28,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:28,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778997385] [2025-03-03 17:19:28,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:28,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:28,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:28,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:28,772 INFO L87 Difference]: Start difference. First operand 395 states and 573 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:28,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:28,998 INFO L93 Difference]: Finished difference Result 720 states and 1042 transitions. [2025-03-03 17:19:29,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:29,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2025-03-03 17:19:29,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:29,002 INFO L225 Difference]: With dead ends: 720 [2025-03-03 17:19:29,002 INFO L226 Difference]: Without dead ends: 395 [2025-03-03 17:19:29,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:29,003 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 470 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:29,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 890 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-03 17:19:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-03-03 17:19:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4512820512820512) internal successors, (566), 390 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:29,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions. [2025-03-03 17:19:29,012 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130 [2025-03-03 17:19:29,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:29,012 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 572 transitions. [2025-03-03 17:19:29,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:29,012 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions. [2025-03-03 17:19:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 17:19:29,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:29,015 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:29,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:19:29,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:29,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash 47394721, now seen corresponding path program 1 times [2025-03-03 17:19:29,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:29,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096097635] [2025-03-03 17:19:29,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:29,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:29,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 17:19:29,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 17:19:29,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:29,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:29,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:29,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096097635] [2025-03-03 17:19:29,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096097635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:29,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:29,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:29,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513105414] [2025-03-03 17:19:29,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:29,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:29,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:29,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:29,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:29,365 INFO L87 Difference]: Start difference. First operand 395 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:29,582 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2025-03-03 17:19:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:29,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2025-03-03 17:19:29,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:29,584 INFO L225 Difference]: With dead ends: 720 [2025-03-03 17:19:29,584 INFO L226 Difference]: Without dead ends: 395 [2025-03-03 17:19:29,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:29,585 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 466 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:29,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 897 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-03 17:19:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-03-03 17:19:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4487179487179487) internal successors, (565), 390 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2025-03-03 17:19:29,593 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131 [2025-03-03 17:19:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:29,593 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2025-03-03 17:19:29,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2025-03-03 17:19:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 17:19:29,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:29,595 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:19:29,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:29,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 772612916, now seen corresponding path program 1 times [2025-03-03 17:19:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834730669] [2025-03-03 17:19:29,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:29,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:29,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 17:19:29,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 17:19:29,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:29,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:29,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834730669] [2025-03-03 17:19:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834730669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:29,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:29,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873820168] [2025-03-03 17:19:29,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:29,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:29,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:29,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:29,809 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:29,998 INFO L93 Difference]: Finished difference Result 720 states and 1038 transitions. [2025-03-03 17:19:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:29,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 132 [2025-03-03 17:19:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:29,999 INFO L225 Difference]: With dead ends: 720 [2025-03-03 17:19:29,999 INFO L226 Difference]: Without dead ends: 395 [2025-03-03 17:19:30,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:30,000 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 458 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:30,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 890 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-03 17:19:30,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2025-03-03 17:19:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4461538461538461) internal successors, (564), 390 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:30,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions. [2025-03-03 17:19:30,009 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132 [2025-03-03 17:19:30,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:30,009 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 570 transitions. [2025-03-03 17:19:30,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2025-03-03 17:19:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 17:19:30,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:30,010 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:30,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:19:30,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:30,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -554082729, now seen corresponding path program 1 times [2025-03-03 17:19:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:30,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685198095] [2025-03-03 17:19:30,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:30,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:30,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 17:19:30,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 17:19:30,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:30,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:30,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685198095] [2025-03-03 17:19:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685198095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:30,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:30,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:19:30,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114925415] [2025-03-03 17:19:30,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:30,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:30,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:30,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:30,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:30,359 INFO L87 Difference]: Start difference. First operand 395 states and 570 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:30,753 INFO L93 Difference]: Finished difference Result 757 states and 1078 transitions. [2025-03-03 17:19:30,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:19:30,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2025-03-03 17:19:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:30,755 INFO L225 Difference]: With dead ends: 757 [2025-03-03 17:19:30,755 INFO L226 Difference]: Without dead ends: 428 [2025-03-03 17:19:30,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:19:30,756 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 40 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2255 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:30,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2255 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-03 17:19:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 393. [2025-03-03 17:19:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4458762886597938) internal successors, (561), 388 states have internal predecessors, (561), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 567 transitions. [2025-03-03 17:19:30,768 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 567 transitions. Word has length 133 [2025-03-03 17:19:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:30,768 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 567 transitions. [2025-03-03 17:19:30,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 567 transitions. [2025-03-03 17:19:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 17:19:30,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:30,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:19:30,770 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:30,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:30,771 INFO L85 PathProgramCache]: Analyzing trace with hash 312608028, now seen corresponding path program 1 times [2025-03-03 17:19:30,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:30,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547610948] [2025-03-03 17:19:30,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:30,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 17:19:30,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 17:19:30,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:30,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:31,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547610948] [2025-03-03 17:19:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547610948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:19:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384341299] [2025-03-03 17:19:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:31,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:19:31,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:31,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:19:31,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:19:31,061 INFO L87 Difference]: Start difference. First operand 393 states and 567 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:31,483 INFO L93 Difference]: Finished difference Result 780 states and 1123 transitions. [2025-03-03 17:19:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:19:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2025-03-03 17:19:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:31,485 INFO L225 Difference]: With dead ends: 780 [2025-03-03 17:19:31,485 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 17:19:31,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:19:31,486 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 585 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:31,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 2334 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:31,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 17:19:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2025-03-03 17:19:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.441025641025641) internal successors, (562), 390 states have internal predecessors, (562), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 568 transitions. [2025-03-03 17:19:31,494 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 568 transitions. Word has length 133 [2025-03-03 17:19:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:31,494 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 568 transitions. [2025-03-03 17:19:31,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 7 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 568 transitions. [2025-03-03 17:19:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 17:19:31,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:31,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:31,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:19:31,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash -336419700, now seen corresponding path program 1 times [2025-03-03 17:19:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067109544] [2025-03-03 17:19:31,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:31,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 17:19:31,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 17:19:31,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:31,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:31,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:31,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067109544] [2025-03-03 17:19:31,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067109544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:31,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:31,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:31,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328063967] [2025-03-03 17:19:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:31,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:31,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:31,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:31,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:31,977 INFO L87 Difference]: Start difference. First operand 395 states and 568 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:32,188 INFO L93 Difference]: Finished difference Result 764 states and 1086 transitions. [2025-03-03 17:19:32,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:19:32,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2025-03-03 17:19:32,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:32,190 INFO L225 Difference]: With dead ends: 764 [2025-03-03 17:19:32,190 INFO L226 Difference]: Without dead ends: 439 [2025-03-03 17:19:32,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:32,191 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 18 mSDsluCounter, 1384 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:32,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1848 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-03-03 17:19:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2025-03-03 17:19:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 432 states have (on average 1.4166666666666667) internal successors, (612), 432 states have internal predecessors, (612), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 17:19:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 618 transitions. [2025-03-03 17:19:32,199 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 618 transitions. Word has length 134 [2025-03-03 17:19:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:32,199 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 618 transitions. [2025-03-03 17:19:32,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:32,200 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 618 transitions. [2025-03-03 17:19:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 17:19:32,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:32,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:32,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:19:32,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:32,201 INFO L85 PathProgramCache]: Analyzing trace with hash 49286719, now seen corresponding path program 1 times [2025-03-03 17:19:32,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:32,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465135985] [2025-03-03 17:19:32,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:32,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 17:19:32,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 17:19:32,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 17:19:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465135985] [2025-03-03 17:19:32,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465135985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:32,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:32,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:19:32,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643903338] [2025-03-03 17:19:32,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:32,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:32,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:32,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:32,663 INFO L87 Difference]: Start difference. First operand 437 states and 618 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:32,940 INFO L93 Difference]: Finished difference Result 968 states and 1349 transitions. [2025-03-03 17:19:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135 [2025-03-03 17:19:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:32,943 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:32,943 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:32,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:19:32,944 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 853 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:32,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1823 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:32,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3861720067453627) internal successors, (822), 593 states have internal predecessors, (822), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:32,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 834 transitions. [2025-03-03 17:19:32,956 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 834 transitions. Word has length 135 [2025-03-03 17:19:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:32,956 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 834 transitions. [2025-03-03 17:19:32,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 834 transitions. [2025-03-03 17:19:32,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 17:19:32,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:32,959 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:32,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:19:32,959 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:32,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -173946213, now seen corresponding path program 1 times [2025-03-03 17:19:32,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:32,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057117560] [2025-03-03 17:19:32,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:32,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 17:19:33,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 17:19:33,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:33,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:33,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057117560] [2025-03-03 17:19:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057117560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:33,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:33,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:33,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746692048] [2025-03-03 17:19:33,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:33,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:33,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:33,391 INFO L87 Difference]: Start difference. First operand 601 states and 834 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:33,580 INFO L93 Difference]: Finished difference Result 968 states and 1348 transitions. [2025-03-03 17:19:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:33,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2025-03-03 17:19:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:33,582 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:33,582 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:33,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:33,583 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 934 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:33,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 886 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:33,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.384485666104553) internal successors, (821), 593 states have internal predecessors, (821), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 833 transitions. [2025-03-03 17:19:33,600 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 833 transitions. Word has length 324 [2025-03-03 17:19:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:33,600 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 833 transitions. [2025-03-03 17:19:33,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 833 transitions. [2025-03-03 17:19:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-03 17:19:33,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:33,603 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:33,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:19:33,604 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:33,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1352169827, now seen corresponding path program 1 times [2025-03-03 17:19:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:33,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347778801] [2025-03-03 17:19:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-03 17:19:33,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-03 17:19:33,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:33,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:34,022 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:34,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:34,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347778801] [2025-03-03 17:19:34,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347778801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:34,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:34,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:34,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369561583] [2025-03-03 17:19:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:34,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:34,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:34,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:34,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:34,024 INFO L87 Difference]: Start difference. First operand 601 states and 833 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:34,205 INFO L93 Difference]: Finished difference Result 968 states and 1346 transitions. [2025-03-03 17:19:34,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2025-03-03 17:19:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:34,210 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:34,210 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:34,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:34,213 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 918 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:34,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 886 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3827993254637436) internal successors, (820), 593 states have internal predecessors, (820), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:34,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 832 transitions. [2025-03-03 17:19:34,229 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 832 transitions. Word has length 325 [2025-03-03 17:19:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:34,230 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 832 transitions. [2025-03-03 17:19:34,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 832 transitions. [2025-03-03 17:19:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-03 17:19:34,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:34,251 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:34,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:19:34,252 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash -939333654, now seen corresponding path program 1 times [2025-03-03 17:19:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060959120] [2025-03-03 17:19:34,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:34,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:34,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-03 17:19:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-03 17:19:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:34,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:34,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:34,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060959120] [2025-03-03 17:19:34,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060959120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:34,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:34,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:34,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614493486] [2025-03-03 17:19:34,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:34,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:34,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:34,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:34,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:34,705 INFO L87 Difference]: Start difference. First operand 601 states and 832 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:34,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:34,884 INFO L93 Difference]: Finished difference Result 968 states and 1344 transitions. [2025-03-03 17:19:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:34,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2025-03-03 17:19:34,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:34,887 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:34,887 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:34,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:34,888 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 902 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:34,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 886 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3811129848229342) internal successors, (819), 593 states have internal predecessors, (819), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 831 transitions. [2025-03-03 17:19:34,900 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 831 transitions. Word has length 326 [2025-03-03 17:19:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:34,900 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 831 transitions. [2025-03-03 17:19:34,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 831 transitions. [2025-03-03 17:19:34,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-03 17:19:34,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:34,902 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:34,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:19:34,903 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:34,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1325401228, now seen corresponding path program 1 times [2025-03-03 17:19:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954402546] [2025-03-03 17:19:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:34,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:34,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-03 17:19:35,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-03 17:19:35,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:35,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:35,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954402546] [2025-03-03 17:19:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954402546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:35,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:35,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:35,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732407187] [2025-03-03 17:19:35,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:35,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:35,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:35,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:35,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:35,309 INFO L87 Difference]: Start difference. First operand 601 states and 831 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:35,490 INFO L93 Difference]: Finished difference Result 968 states and 1342 transitions. [2025-03-03 17:19:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:35,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2025-03-03 17:19:35,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:35,493 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:35,493 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:35,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:35,494 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 489 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:35,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 893 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:35,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3794266441821248) internal successors, (818), 593 states have internal predecessors, (818), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:35,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 830 transitions. [2025-03-03 17:19:35,508 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 830 transitions. Word has length 327 [2025-03-03 17:19:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:35,508 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 830 transitions. [2025-03-03 17:19:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:35,509 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 830 transitions. [2025-03-03 17:19:35,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-03 17:19:35,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:35,511 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:35,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 17:19:35,511 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:35,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:35,512 INFO L85 PathProgramCache]: Analyzing trace with hash 260044729, now seen corresponding path program 1 times [2025-03-03 17:19:35,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:35,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725841676] [2025-03-03 17:19:35,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:35,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:35,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-03 17:19:35,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-03 17:19:35,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:35,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:35,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:35,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725841676] [2025-03-03 17:19:35,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725841676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:35,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:35,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:35,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417330982] [2025-03-03 17:19:35,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:35,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:35,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:35,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:35,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:35,968 INFO L87 Difference]: Start difference. First operand 601 states and 830 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:36,127 INFO L93 Difference]: Finished difference Result 968 states and 1340 transitions. [2025-03-03 17:19:36,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:36,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2025-03-03 17:19:36,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:36,130 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:36,130 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:36,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:36,131 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 474 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:36,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 909 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:19:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:36,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3777403035413154) internal successors, (817), 593 states have internal predecessors, (817), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 829 transitions. [2025-03-03 17:19:36,147 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 829 transitions. Word has length 328 [2025-03-03 17:19:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:36,148 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 829 transitions. [2025-03-03 17:19:36,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 829 transitions. [2025-03-03 17:19:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-03 17:19:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:36,152 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 17:19:36,153 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:36,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:36,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1740407557, now seen corresponding path program 1 times [2025-03-03 17:19:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:36,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548918221] [2025-03-03 17:19:36,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:36,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-03 17:19:36,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-03 17:19:36,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:36,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548918221] [2025-03-03 17:19:36,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548918221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:36,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:36,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347509943] [2025-03-03 17:19:36,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:36,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:36,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:36,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:36,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:36,570 INFO L87 Difference]: Start difference. First operand 601 states and 829 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:36,751 INFO L93 Difference]: Finished difference Result 968 states and 1338 transitions. [2025-03-03 17:19:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:36,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2025-03-03 17:19:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:36,754 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:36,755 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:36,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:36,755 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 847 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:36,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 902 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:36,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.376053962900506) internal successors, (816), 593 states have internal predecessors, (816), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 828 transitions. [2025-03-03 17:19:36,767 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 828 transitions. Word has length 329 [2025-03-03 17:19:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:36,768 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 828 transitions. [2025-03-03 17:19:36,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:36,768 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 828 transitions. [2025-03-03 17:19:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-03 17:19:36,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:36,771 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:36,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 17:19:36,772 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 871610888, now seen corresponding path program 1 times [2025-03-03 17:19:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394447553] [2025-03-03 17:19:36,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:36,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:36,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-03 17:19:36,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-03 17:19:36,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:36,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:37,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:37,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394447553] [2025-03-03 17:19:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394447553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736824238] [2025-03-03 17:19:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:37,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:37,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:37,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:37,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:37,248 INFO L87 Difference]: Start difference. First operand 601 states and 828 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:37,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:37,531 INFO L93 Difference]: Finished difference Result 968 states and 1336 transitions. [2025-03-03 17:19:37,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:37,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2025-03-03 17:19:37,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:37,534 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:37,534 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:37,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:37,535 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 787 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:37,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [787 Valid, 676 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:19:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:37,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:37,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3743676222596966) internal successors, (815), 593 states have internal predecessors, (815), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 827 transitions. [2025-03-03 17:19:37,548 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 827 transitions. Word has length 330 [2025-03-03 17:19:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:37,548 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 827 transitions. [2025-03-03 17:19:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 827 transitions. [2025-03-03 17:19:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-03 17:19:37,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:37,551 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:37,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 17:19:37,551 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash 955428842, now seen corresponding path program 1 times [2025-03-03 17:19:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:37,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141448265] [2025-03-03 17:19:37,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:37,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-03 17:19:37,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-03 17:19:37,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:37,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:38,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:38,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141448265] [2025-03-03 17:19:38,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141448265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:38,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:38,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:38,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335057214] [2025-03-03 17:19:38,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:38,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:38,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:38,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:38,249 INFO L87 Difference]: Start difference. First operand 601 states and 827 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:38,390 INFO L93 Difference]: Finished difference Result 968 states and 1334 transitions. [2025-03-03 17:19:38,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:38,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2025-03-03 17:19:38,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:38,392 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:38,392 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:38,393 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-03-03 17:19:38,394 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 380 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:38,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 900 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:19:38,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:38,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.372681281618887) internal successors, (814), 593 states have internal predecessors, (814), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:38,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 826 transitions. [2025-03-03 17:19:38,406 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 826 transitions. Word has length 331 [2025-03-03 17:19:38,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 826 transitions. [2025-03-03 17:19:38,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 826 transitions. [2025-03-03 17:19:38,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 17:19:38,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:38,408 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:38,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 17:19:38,409 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:38,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash -806249323, now seen corresponding path program 1 times [2025-03-03 17:19:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:38,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102377613] [2025-03-03 17:19:38,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:38,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:38,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 17:19:38,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 17:19:38,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:38,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:39,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102377613] [2025-03-03 17:19:39,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102377613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:39,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:39,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729636971] [2025-03-03 17:19:39,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:39,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:39,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:39,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:39,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:39,068 INFO L87 Difference]: Start difference. First operand 601 states and 826 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:39,261 INFO L93 Difference]: Finished difference Result 968 states and 1332 transitions. [2025-03-03 17:19:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2025-03-03 17:19:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:39,264 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:39,264 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:39,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:39,265 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 453 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:39,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 885 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:39,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3709949409780775) internal successors, (813), 593 states have internal predecessors, (813), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:39,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 825 transitions. [2025-03-03 17:19:39,283 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 825 transitions. Word has length 332 [2025-03-03 17:19:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:39,284 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 825 transitions. [2025-03-03 17:19:39,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 825 transitions. [2025-03-03 17:19:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-03 17:19:39,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:39,285 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:39,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 17:19:39,286 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:39,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash -2020608399, now seen corresponding path program 1 times [2025-03-03 17:19:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826152992] [2025-03-03 17:19:39,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:39,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-03 17:19:39,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-03 17:19:39,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:39,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:40,015 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:40,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:40,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826152992] [2025-03-03 17:19:40,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826152992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:40,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:40,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:40,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928675882] [2025-03-03 17:19:40,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:40,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:40,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:40,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:40,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:40,019 INFO L87 Difference]: Start difference. First operand 601 states and 825 transitions. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:40,217 INFO L93 Difference]: Finished difference Result 968 states and 1330 transitions. [2025-03-03 17:19:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:40,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2025-03-03 17:19:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:40,219 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:40,219 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:40,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:40,221 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 452 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:40,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 885 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.369308600337268) internal successors, (812), 593 states have internal predecessors, (812), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 824 transitions. [2025-03-03 17:19:40,233 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 824 transitions. Word has length 333 [2025-03-03 17:19:40,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:40,233 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 824 transitions. [2025-03-03 17:19:40,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 824 transitions. [2025-03-03 17:19:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-03 17:19:40,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:40,235 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:40,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 17:19:40,235 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:40,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1741685985, now seen corresponding path program 1 times [2025-03-03 17:19:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:40,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021773104] [2025-03-03 17:19:40,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:40,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:40,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-03 17:19:40,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-03 17:19:40,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:40,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021773104] [2025-03-03 17:19:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021773104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:40,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:40,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:40,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075303304] [2025-03-03 17:19:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:40,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:40,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:40,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:40,859 INFO L87 Difference]: Start difference. First operand 601 states and 824 transitions. Second operand has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:41,033 INFO L93 Difference]: Finished difference Result 968 states and 1328 transitions. [2025-03-03 17:19:41,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:41,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2025-03-03 17:19:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:41,035 INFO L225 Difference]: With dead ends: 968 [2025-03-03 17:19:41,035 INFO L226 Difference]: Without dead ends: 601 [2025-03-03 17:19:41,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:41,036 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 389 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:41,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 878 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-03 17:19:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-03 17:19:41,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 593 states have (on average 1.3676222596964587) internal successors, (811), 593 states have internal predecessors, (811), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 17:19:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 823 transitions. [2025-03-03 17:19:41,048 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 823 transitions. Word has length 334 [2025-03-03 17:19:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:41,048 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 823 transitions. [2025-03-03 17:19:41,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.75) internal successors, (307), 4 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:41,048 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 823 transitions. [2025-03-03 17:19:41,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-03 17:19:41,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:41,051 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:41,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 17:19:41,051 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:41,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1985709928, now seen corresponding path program 1 times [2025-03-03 17:19:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:41,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835087231] [2025-03-03 17:19:41,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:41,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:41,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-03 17:19:41,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-03 17:19:41,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:41,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835087231] [2025-03-03 17:19:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835087231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:41,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:41,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:19:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472065534] [2025-03-03 17:19:41,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:41,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:41,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:41,745 INFO L87 Difference]: Start difference. First operand 601 states and 823 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:42,135 INFO L93 Difference]: Finished difference Result 1405 states and 1931 transitions. [2025-03-03 17:19:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:42,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2025-03-03 17:19:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:42,138 INFO L225 Difference]: With dead ends: 1405 [2025-03-03 17:19:42,138 INFO L226 Difference]: Without dead ends: 1038 [2025-03-03 17:19:42,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:19:42,140 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 586 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:42,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1648 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:42,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-03-03 17:19:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 924. [2025-03-03 17:19:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 913 states have (on average 1.3636363636363635) internal successors, (1245), 913 states have internal predecessors, (1245), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 17:19:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1263 transitions. [2025-03-03 17:19:42,159 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1263 transitions. Word has length 335 [2025-03-03 17:19:42,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:42,160 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1263 transitions. [2025-03-03 17:19:42,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1263 transitions. [2025-03-03 17:19:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-03 17:19:42,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:42,162 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:42,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 17:19:42,163 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:42,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:42,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1805089870, now seen corresponding path program 1 times [2025-03-03 17:19:42,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:42,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853448692] [2025-03-03 17:19:42,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:42,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:42,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-03 17:19:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-03 17:19:42,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:42,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 17:19:43,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:43,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853448692] [2025-03-03 17:19:43,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853448692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:43,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:43,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:19:43,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417687706] [2025-03-03 17:19:43,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:43,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:19:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:43,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:19:43,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:43,201 INFO L87 Difference]: Start difference. First operand 924 states and 1263 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:43,547 INFO L93 Difference]: Finished difference Result 1597 states and 2157 transitions. [2025-03-03 17:19:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:19:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2025-03-03 17:19:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:43,550 INFO L225 Difference]: With dead ends: 1597 [2025-03-03 17:19:43,550 INFO L226 Difference]: Without dead ends: 948 [2025-03-03 17:19:43,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:19:43,551 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 467 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:43,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1000 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:19:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-03 17:19:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 942. [2025-03-03 17:19:43,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 931 states have (on average 1.3566058002148227) internal successors, (1263), 931 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 17:19:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1281 transitions. [2025-03-03 17:19:43,574 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1281 transitions. Word has length 336 [2025-03-03 17:19:43,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:43,574 INFO L471 AbstractCegarLoop]: Abstraction has 942 states and 1281 transitions. [2025-03-03 17:19:43,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 5 states have internal predecessors, (276), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1281 transitions. [2025-03-03 17:19:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 17:19:43,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:43,578 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:43,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 17:19:43,578 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:43,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 252955742, now seen corresponding path program 1 times [2025-03-03 17:19:43,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:43,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315141482] [2025-03-03 17:19:43,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:43,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 17:19:43,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 17:19:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 17:19:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315141482] [2025-03-03 17:19:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315141482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:19:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151521698] [2025-03-03 17:19:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:19:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:44,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:19:44,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:44,370 INFO L87 Difference]: Start difference. First operand 942 states and 1281 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:44,646 INFO L93 Difference]: Finished difference Result 1597 states and 2151 transitions. [2025-03-03 17:19:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:19:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 338 [2025-03-03 17:19:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:44,649 INFO L225 Difference]: With dead ends: 1597 [2025-03-03 17:19:44,649 INFO L226 Difference]: Without dead ends: 942 [2025-03-03 17:19:44,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:19:44,650 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 320 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:44,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 674 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:19:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-03 17:19:44,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 924. [2025-03-03 17:19:44,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 913 states have (on average 1.357064622124863) internal successors, (1239), 913 states have internal predecessors, (1239), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 17:19:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1257 transitions. [2025-03-03 17:19:44,663 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1257 transitions. Word has length 338 [2025-03-03 17:19:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:44,664 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1257 transitions. [2025-03-03 17:19:44,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1257 transitions. [2025-03-03 17:19:44,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 17:19:44,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:44,670 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:44,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 17:19:44,670 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:44,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1316003454, now seen corresponding path program 1 times [2025-03-03 17:19:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:44,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478943758] [2025-03-03 17:19:44,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:44,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 17:19:45,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 17:19:45,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:45,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:45,519 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478943758] [2025-03-03 17:19:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478943758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:19:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969834074] [2025-03-03 17:19:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:45,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:45,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:45,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:45,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:45,526 INFO L87 Difference]: Start difference. First operand 924 states and 1257 transitions. Second operand has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:46,071 INFO L93 Difference]: Finished difference Result 1314 states and 1792 transitions. [2025-03-03 17:19:46,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:46,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338 [2025-03-03 17:19:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:46,074 INFO L225 Difference]: With dead ends: 1314 [2025-03-03 17:19:46,074 INFO L226 Difference]: Without dead ends: 947 [2025-03-03 17:19:46,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:19:46,075 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1002 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:46,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 1306 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:19:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-03 17:19:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 925. [2025-03-03 17:19:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 914 states have (on average 1.3566739606126914) internal successors, (1240), 914 states have internal predecessors, (1240), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 17:19:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1258 transitions. [2025-03-03 17:19:46,091 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1258 transitions. Word has length 338 [2025-03-03 17:19:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:46,092 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1258 transitions. [2025-03-03 17:19:46,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1258 transitions. [2025-03-03 17:19:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 17:19:46,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:46,094 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:46,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 17:19:46,095 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:46,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:46,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1896053525, now seen corresponding path program 1 times [2025-03-03 17:19:46,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:46,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529290188] [2025-03-03 17:19:46,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:46,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:46,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 17:19:46,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 17:19:46,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:46,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-03 17:19:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529290188] [2025-03-03 17:19:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529290188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:19:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719829992] [2025-03-03 17:19:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:19:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:19:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:19:47,062 INFO L87 Difference]: Start difference. First operand 925 states and 1258 transitions. Second operand has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:47,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:47,536 INFO L93 Difference]: Finished difference Result 2084 states and 2827 transitions. [2025-03-03 17:19:47,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:19:47,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 338 [2025-03-03 17:19:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:47,541 INFO L225 Difference]: With dead ends: 2084 [2025-03-03 17:19:47,541 INFO L226 Difference]: Without dead ends: 1605 [2025-03-03 17:19:47,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:19:47,542 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 803 mSDsluCounter, 4639 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 5724 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:47,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 5724 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-03 17:19:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 994. [2025-03-03 17:19:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 980 states have (on average 1.3591836734693878) internal successors, (1332), 980 states have internal predecessors, (1332), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 17:19:47,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1356 transitions. [2025-03-03 17:19:47,560 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1356 transitions. Word has length 338 [2025-03-03 17:19:47,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:47,561 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1356 transitions. [2025-03-03 17:19:47,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1356 transitions. [2025-03-03 17:19:47,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 17:19:47,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:47,563 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:47,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 17:19:47,564 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:47,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:47,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1890778514, now seen corresponding path program 1 times [2025-03-03 17:19:47,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:47,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273178928] [2025-03-03 17:19:47,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:47,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:47,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 17:19:48,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 17:19:48,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:48,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 81 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:48,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273178928] [2025-03-03 17:19:48,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273178928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:19:48,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468111255] [2025-03-03 17:19:48,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:48,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:19:48,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:19:48,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:19:48,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:19:49,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 17:19:49,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 17:19:49,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:49,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:49,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 2045 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 17:19:49,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:19:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-03 17:19:49,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:19:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468111255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:49,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:19:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2025-03-03 17:19:49,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542607586] [2025-03-03 17:19:49,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:49,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:49,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:49,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:49,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:19:49,551 INFO L87 Difference]: Start difference. First operand 994 states and 1356 transitions. Second operand has 6 states, 5 states have (on average 58.2) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 17:19:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:49,788 INFO L93 Difference]: Finished difference Result 1742 states and 2357 transitions. [2025-03-03 17:19:49,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:49,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 58.2) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 339 [2025-03-03 17:19:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:49,791 INFO L225 Difference]: With dead ends: 1742 [2025-03-03 17:19:49,791 INFO L226 Difference]: Without dead ends: 994 [2025-03-03 17:19:49,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:19:49,797 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 0 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:49,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2246 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:19:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-03 17:19:49,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2025-03-03 17:19:49,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 980 states have (on average 1.3551020408163266) internal successors, (1328), 980 states have internal predecessors, (1328), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 17:19:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1352 transitions. [2025-03-03 17:19:49,817 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1352 transitions. Word has length 339 [2025-03-03 17:19:49,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:49,818 INFO L471 AbstractCegarLoop]: Abstraction has 994 states and 1352 transitions. [2025-03-03 17:19:49,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 58.2) internal successors, (291), 6 states have internal predecessors, (291), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 17:19:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1352 transitions. [2025-03-03 17:19:49,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-03 17:19:49,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:49,821 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:49,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 17:19:50,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-03 17:19:50,022 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:50,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 545778736, now seen corresponding path program 1 times [2025-03-03 17:19:50,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:50,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844932095] [2025-03-03 17:19:50,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-03 17:19:50,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-03 17:19:50,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:50,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 17:19:50,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:50,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844932095] [2025-03-03 17:19:50,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844932095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:50,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:50,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:19:50,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213696762] [2025-03-03 17:19:50,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:50,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:19:50,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:50,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:19:50,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:19:50,883 INFO L87 Difference]: Start difference. First operand 994 states and 1352 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 17:19:51,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:51,290 INFO L93 Difference]: Finished difference Result 1810 states and 2451 transitions. [2025-03-03 17:19:51,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 341 [2025-03-03 17:19:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:51,293 INFO L225 Difference]: With dead ends: 1810 [2025-03-03 17:19:51,293 INFO L226 Difference]: Without dead ends: 1010 [2025-03-03 17:19:51,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:19:51,294 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 1031 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:51,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1305 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-03 17:19:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1002. [2025-03-03 17:19:51,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 988 states have (on average 1.3481781376518218) internal successors, (1332), 988 states have internal predecessors, (1332), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 17:19:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1356 transitions. [2025-03-03 17:19:51,308 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1356 transitions. Word has length 341 [2025-03-03 17:19:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:51,308 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1356 transitions. [2025-03-03 17:19:51,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 17:19:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1356 transitions. [2025-03-03 17:19:51,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-03-03 17:19:51,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:51,311 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:51,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 17:19:51,311 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:51,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:51,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2032695118, now seen corresponding path program 1 times [2025-03-03 17:19:51,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:51,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603465106] [2025-03-03 17:19:51,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:51,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:51,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-03-03 17:19:51,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-03-03 17:19:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 17:19:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603465106] [2025-03-03 17:19:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603465106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:19:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864634117] [2025-03-03 17:19:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:52,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:52,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:52,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:52,230 INFO L87 Difference]: Start difference. First operand 1002 states and 1356 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:52,633 INFO L93 Difference]: Finished difference Result 1860 states and 2504 transitions. [2025-03-03 17:19:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:52,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 343 [2025-03-03 17:19:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:52,636 INFO L225 Difference]: With dead ends: 1860 [2025-03-03 17:19:52,636 INFO L226 Difference]: Without dead ends: 1010 [2025-03-03 17:19:52,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:19:52,637 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 508 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:52,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 1305 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-03 17:19:52,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1006. [2025-03-03 17:19:52,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 992 states have (on average 1.346774193548387) internal successors, (1336), 992 states have internal predecessors, (1336), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 17:19:52,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1360 transitions. [2025-03-03 17:19:52,652 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1360 transitions. Word has length 343 [2025-03-03 17:19:52,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:52,653 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1360 transitions. [2025-03-03 17:19:52,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 17:19:52,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1360 transitions. [2025-03-03 17:19:52,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-03 17:19:52,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:52,655 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:52,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 17:19:52,656 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:52,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:52,656 INFO L85 PathProgramCache]: Analyzing trace with hash 255655688, now seen corresponding path program 1 times [2025-03-03 17:19:52,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:52,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429257382] [2025-03-03 17:19:52,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:52,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-03 17:19:53,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-03 17:19:53,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:53,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-03 17:19:53,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:53,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429257382] [2025-03-03 17:19:53,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429257382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:53,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:19:53,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:19:53,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998616207] [2025-03-03 17:19:53,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:53,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:53,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:53,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:53,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:19:53,599 INFO L87 Difference]: Start difference. First operand 1006 states and 1360 transitions. Second operand has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 17:19:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:54,000 INFO L93 Difference]: Finished difference Result 1805 states and 2431 transitions. [2025-03-03 17:19:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:54,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 345 [2025-03-03 17:19:54,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:54,003 INFO L225 Difference]: With dead ends: 1805 [2025-03-03 17:19:54,003 INFO L226 Difference]: Without dead ends: 1014 [2025-03-03 17:19:54,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:19:54,004 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 495 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:54,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1305 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-03 17:19:54,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1010. [2025-03-03 17:19:54,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 996 states have (on average 1.3453815261044177) internal successors, (1340), 996 states have internal predecessors, (1340), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 17:19:54,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1364 transitions. [2025-03-03 17:19:54,017 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1364 transitions. Word has length 345 [2025-03-03 17:19:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:54,018 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1364 transitions. [2025-03-03 17:19:54,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 17:19:54,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1364 transitions. [2025-03-03 17:19:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 17:19:54,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:54,022 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:54,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 17:19:54,023 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:54,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash -933839470, now seen corresponding path program 1 times [2025-03-03 17:19:54,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:54,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106398416] [2025-03-03 17:19:54,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:54,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 17:19:54,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 17:19:54,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:54,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:55,474 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106398416] [2025-03-03 17:19:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106398416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:19:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449666792] [2025-03-03 17:19:55,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:55,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:19:55,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:19:55,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:19:55,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 17:19:56,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 17:19:56,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 17:19:56,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:56,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:56,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 17:19:56,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:19:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-03 17:19:56,465 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:19:56,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449666792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:56,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:19:56,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2025-03-03 17:19:56,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670405377] [2025-03-03 17:19:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:56,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:19:56,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:56,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:19:56,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:19:56,466 INFO L87 Difference]: Start difference. First operand 1010 states and 1364 transitions. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 17:19:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:56,786 INFO L93 Difference]: Finished difference Result 1788 states and 2399 transitions. [2025-03-03 17:19:56,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:19:56,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 347 [2025-03-03 17:19:56,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:56,788 INFO L225 Difference]: With dead ends: 1788 [2025-03-03 17:19:56,788 INFO L226 Difference]: Without dead ends: 1026 [2025-03-03 17:19:56,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:19:56,789 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 479 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:56,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1287 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:19:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-03-03 17:19:56,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1022. [2025-03-03 17:19:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 1008 states have (on average 1.3373015873015872) internal successors, (1348), 1008 states have internal predecessors, (1348), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 17:19:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1372 transitions. [2025-03-03 17:19:56,801 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1372 transitions. Word has length 347 [2025-03-03 17:19:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:56,801 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1372 transitions. [2025-03-03 17:19:56,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 17:19:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1372 transitions. [2025-03-03 17:19:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 17:19:56,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:56,803 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:19:56,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 17:19:57,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:19:57,004 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:19:57,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:19:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1846269142, now seen corresponding path program 1 times [2025-03-03 17:19:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:19:57,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361325854] [2025-03-03 17:19:57,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:19:57,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 17:19:57,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 17:19:57,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:57,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:19:58,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:19:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361325854] [2025-03-03 17:19:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361325854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:19:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773293623] [2025-03-03 17:19:58,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:19:58,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:19:58,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:19:58,324 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:19:58,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 17:19:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 17:19:59,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 17:19:59,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:19:59,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:19:59,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 2063 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 17:19:59,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:19:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 17:19:59,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:19:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773293623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:19:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:19:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-03 17:19:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441783723] [2025-03-03 17:19:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:19:59,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:19:59,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:19:59,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:19:59,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:19:59,491 INFO L87 Difference]: Start difference. First operand 1022 states and 1372 transitions. Second operand has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:19:59,952 INFO L93 Difference]: Finished difference Result 2297 states and 3092 transitions. [2025-03-03 17:19:59,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:19:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349 [2025-03-03 17:19:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:19:59,961 INFO L225 Difference]: With dead ends: 2297 [2025-03-03 17:19:59,961 INFO L226 Difference]: Without dead ends: 1780 [2025-03-03 17:19:59,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-03 17:19:59,962 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1693 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:19:59,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 1574 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:19:59,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-03-03 17:19:59,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1434. [2025-03-03 17:19:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1411 states have (on average 1.3175053153791638) internal successors, (1859), 1411 states have internal predecessors, (1859), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 17:19:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1901 transitions. [2025-03-03 17:19:59,984 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1901 transitions. Word has length 349 [2025-03-03 17:19:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:19:59,984 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 1901 transitions. [2025-03-03 17:19:59,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.25) internal successors, (322), 8 states have internal predecessors, (322), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:19:59,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1901 transitions. [2025-03-03 17:19:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 17:19:59,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:19:59,987 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:00,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 17:20:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:00,187 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:00,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:00,188 INFO L85 PathProgramCache]: Analyzing trace with hash 340757861, now seen corresponding path program 1 times [2025-03-03 17:20:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592883624] [2025-03-03 17:20:00,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:00,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 17:20:00,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 17:20:00,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:00,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-03 17:20:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592883624] [2025-03-03 17:20:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592883624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:00,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:00,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:20:00,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627010035] [2025-03-03 17:20:00,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:00,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:20:00,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:00,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:20:00,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:20:00,591 INFO L87 Difference]: Start difference. First operand 1434 states and 1901 transitions. Second operand has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:00,754 INFO L93 Difference]: Finished difference Result 2219 states and 2953 transitions. [2025-03-03 17:20:00,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:20:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 349 [2025-03-03 17:20:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:00,757 INFO L225 Difference]: With dead ends: 2219 [2025-03-03 17:20:00,757 INFO L226 Difference]: Without dead ends: 1524 [2025-03-03 17:20:00,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:20:00,759 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 16 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:00,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 1794 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:20:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2025-03-03 17:20:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1524. [2025-03-03 17:20:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1501 states have (on average 1.3251165889407062) internal successors, (1989), 1501 states have internal predecessors, (1989), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 17:20:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2031 transitions. [2025-03-03 17:20:00,778 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2031 transitions. Word has length 349 [2025-03-03 17:20:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:00,778 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2031 transitions. [2025-03-03 17:20:00,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.0) internal successors, (285), 5 states have internal predecessors, (285), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2031 transitions. [2025-03-03 17:20:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-03 17:20:00,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:00,781 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:00,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 17:20:00,781 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:00,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:00,781 INFO L85 PathProgramCache]: Analyzing trace with hash -388067194, now seen corresponding path program 1 times [2025-03-03 17:20:00,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:00,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22030497] [2025-03-03 17:20:00,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:00,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:00,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 17:20:01,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 17:20:01,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:01,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 86 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:02,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:02,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22030497] [2025-03-03 17:20:02,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22030497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086414190] [2025-03-03 17:20:02,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:02,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:02,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:02,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:20:02,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 17:20:02,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-03 17:20:03,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-03 17:20:03,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:03,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:03,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 2064 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 17:20:03,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:20:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 84 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:03,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:20:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:03,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086414190] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:03,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:20:03,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 8] total 22 [2025-03-03 17:20:03,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700904865] [2025-03-03 17:20:03,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:03,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:20:03,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:03,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:20:03,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2025-03-03 17:20:03,695 INFO L87 Difference]: Start difference. First operand 1524 states and 2031 transitions. Second operand has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:04,109 INFO L93 Difference]: Finished difference Result 2306 states and 3092 transitions. [2025-03-03 17:20:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:20:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 350 [2025-03-03 17:20:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:04,112 INFO L225 Difference]: With dead ends: 2306 [2025-03-03 17:20:04,112 INFO L226 Difference]: Without dead ends: 1914 [2025-03-03 17:20:04,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-03-03 17:20:04,113 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 352 mSDsluCounter, 3633 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 4434 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:04,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 4434 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:20:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2025-03-03 17:20:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1711. [2025-03-03 17:20:04,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1685 states have (on average 1.3198813056379821) internal successors, (2224), 1685 states have internal predecessors, (2224), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 17:20:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2272 transitions. [2025-03-03 17:20:04,134 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2272 transitions. Word has length 350 [2025-03-03 17:20:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:04,134 INFO L471 AbstractCegarLoop]: Abstraction has 1711 states and 2272 transitions. [2025-03-03 17:20:04,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2272 transitions. [2025-03-03 17:20:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 17:20:04,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:04,137 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:04,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 17:20:04,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-03 17:20:04,337 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:04,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash 457040597, now seen corresponding path program 1 times [2025-03-03 17:20:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806408741] [2025-03-03 17:20:04,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:04,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 17:20:04,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 17:20:04,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:04,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:05,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:05,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806408741] [2025-03-03 17:20:05,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806408741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:05,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:20:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497651099] [2025-03-03 17:20:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:05,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:20:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:05,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:20:05,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:20:05,481 INFO L87 Difference]: Start difference. First operand 1711 states and 2272 transitions. Second operand has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:05,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:05,848 INFO L93 Difference]: Finished difference Result 2636 states and 3531 transitions. [2025-03-03 17:20:05,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:05,849 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 351 [2025-03-03 17:20:05,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:05,853 INFO L225 Difference]: With dead ends: 2636 [2025-03-03 17:20:05,853 INFO L226 Difference]: Without dead ends: 2057 [2025-03-03 17:20:05,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:20:05,854 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 968 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:05,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 2176 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2025-03-03 17:20:05,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2054. [2025-03-03 17:20:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2054 states, 2028 states have (on average 1.334319526627219) internal successors, (2706), 2028 states have internal predecessors, (2706), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-03 17:20:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2754 transitions. [2025-03-03 17:20:05,897 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2754 transitions. Word has length 351 [2025-03-03 17:20:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:05,897 INFO L471 AbstractCegarLoop]: Abstraction has 2054 states and 2754 transitions. [2025-03-03 17:20:05,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 40.5) internal successors, (324), 8 states have internal predecessors, (324), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:05,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2754 transitions. [2025-03-03 17:20:05,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 17:20:05,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:05,902 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:05,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 17:20:05,902 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:05,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:05,903 INFO L85 PathProgramCache]: Analyzing trace with hash 549612946, now seen corresponding path program 1 times [2025-03-03 17:20:05,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:05,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681286595] [2025-03-03 17:20:05,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:05,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 17:20:06,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 17:20:06,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:06,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:07,699 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 17:20:07,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:07,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681286595] [2025-03-03 17:20:07,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681286595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:07,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:07,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:20:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51645035] [2025-03-03 17:20:07,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:07,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:20:07,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:07,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:20:07,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:20:07,700 INFO L87 Difference]: Start difference. First operand 2054 states and 2754 transitions. Second operand has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:08,300 INFO L93 Difference]: Finished difference Result 3886 states and 5210 transitions. [2025-03-03 17:20:08,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:20:08,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351 [2025-03-03 17:20:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:08,305 INFO L225 Difference]: With dead ends: 3886 [2025-03-03 17:20:08,305 INFO L226 Difference]: Without dead ends: 2747 [2025-03-03 17:20:08,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:20:08,307 INFO L435 NwaCegarLoop]: 677 mSDtfsCounter, 1256 mSDsluCounter, 3951 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 4628 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:08,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 4628 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:20:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2025-03-03 17:20:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2128. [2025-03-03 17:20:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2128 states, 2098 states have (on average 1.3317445185891326) internal successors, (2794), 2098 states have internal predecessors, (2794), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 17:20:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2850 transitions. [2025-03-03 17:20:08,335 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2850 transitions. Word has length 351 [2025-03-03 17:20:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:08,336 INFO L471 AbstractCegarLoop]: Abstraction has 2128 states and 2850 transitions. [2025-03-03 17:20:08,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.6) internal successors, (276), 10 states have internal predecessors, (276), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2850 transitions. [2025-03-03 17:20:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-03 17:20:08,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:08,339 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:08,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 17:20:08,339 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:08,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:08,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1777145123, now seen corresponding path program 1 times [2025-03-03 17:20:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:08,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851324200] [2025-03-03 17:20:08,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:08,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-03 17:20:08,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-03 17:20:08,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:08,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:09,929 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-03 17:20:09,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:09,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851324200] [2025-03-03 17:20:09,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851324200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:09,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 17:20:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470274886] [2025-03-03 17:20:09,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:09,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 17:20:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:09,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 17:20:09,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:20:09,931 INFO L87 Difference]: Start difference. First operand 2128 states and 2850 transitions. Second operand has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:11,031 INFO L93 Difference]: Finished difference Result 5222 states and 6928 transitions. [2025-03-03 17:20:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:20:11,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 351 [2025-03-03 17:20:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:11,037 INFO L225 Difference]: With dead ends: 5222 [2025-03-03 17:20:11,037 INFO L226 Difference]: Without dead ends: 3767 [2025-03-03 17:20:11,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:20:11,038 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 878 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:11,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 3485 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:20:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-03-03 17:20:11,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 2474. [2025-03-03 17:20:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2434 states have (on average 1.3311421528348397) internal successors, (3240), 2434 states have internal predecessors, (3240), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 17:20:11,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3316 transitions. [2025-03-03 17:20:11,071 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3316 transitions. Word has length 351 [2025-03-03 17:20:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:11,071 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3316 transitions. [2025-03-03 17:20:11,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.454545454545453) internal successors, (280), 11 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3316 transitions. [2025-03-03 17:20:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 17:20:11,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:11,074 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 17:20:11,074 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:11,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:11,074 INFO L85 PathProgramCache]: Analyzing trace with hash 921672773, now seen corresponding path program 1 times [2025-03-03 17:20:11,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419334442] [2025-03-03 17:20:11,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:11,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 17:20:11,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 17:20:11,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:11,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:12,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419334442] [2025-03-03 17:20:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419334442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:12,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:12,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:20:12,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593500606] [2025-03-03 17:20:12,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:20:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:12,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:20:12,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:20:12,580 INFO L87 Difference]: Start difference. First operand 2474 states and 3316 transitions. Second operand has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:13,431 INFO L93 Difference]: Finished difference Result 4754 states and 6348 transitions. [2025-03-03 17:20:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:20:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 353 [2025-03-03 17:20:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:13,437 INFO L225 Difference]: With dead ends: 4754 [2025-03-03 17:20:13,437 INFO L226 Difference]: Without dead ends: 3727 [2025-03-03 17:20:13,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:20:13,439 INFO L435 NwaCegarLoop]: 510 mSDtfsCounter, 1286 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 2820 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:13,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 2820 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:20:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3727 states. [2025-03-03 17:20:13,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3727 to 3241. [2025-03-03 17:20:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3201 states have (on average 1.3130271790065604) internal successors, (4203), 3201 states have internal predecessors, (4203), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 17:20:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4279 transitions. [2025-03-03 17:20:13,483 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4279 transitions. Word has length 353 [2025-03-03 17:20:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:13,486 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 4279 transitions. [2025-03-03 17:20:13,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 36.22222222222222) internal successors, (326), 9 states have internal predecessors, (326), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4279 transitions. [2025-03-03 17:20:13,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 17:20:13,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:13,491 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 17:20:13,491 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash 491045453, now seen corresponding path program 1 times [2025-03-03 17:20:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321644865] [2025-03-03 17:20:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:13,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 17:20:14,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 17:20:14,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:14,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 51 proven. 37 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:16,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321644865] [2025-03-03 17:20:16,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321644865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:16,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646967472] [2025-03-03 17:20:16,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:16,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:16,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:16,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:20:16,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 17:20:17,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 17:20:18,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 17:20:18,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:18,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:18,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 2071 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 17:20:18,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:20:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 17:20:18,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:20:18,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646967472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:18,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 17:20:18,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [18] total 22 [2025-03-03 17:20:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485587563] [2025-03-03 17:20:18,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:18,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:18,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:18,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-03 17:20:18,121 INFO L87 Difference]: Start difference. First operand 3241 states and 4279 transitions. Second operand has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 17:20:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:18,380 INFO L93 Difference]: Finished difference Result 6005 states and 7914 transitions. [2025-03-03 17:20:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:20:18,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 353 [2025-03-03 17:20:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:18,386 INFO L225 Difference]: With dead ends: 6005 [2025-03-03 17:20:18,386 INFO L226 Difference]: Without dead ends: 3241 [2025-03-03 17:20:18,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-03-03 17:20:18,389 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 0 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:18,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2237 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 17:20:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3241 states. [2025-03-03 17:20:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3241 to 3241. [2025-03-03 17:20:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3241 states, 3201 states have (on average 1.3105279600124962) internal successors, (4195), 3201 states have internal predecessors, (4195), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-03 17:20:18,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3241 states to 3241 states and 4271 transitions. [2025-03-03 17:20:18,423 INFO L78 Accepts]: Start accepts. Automaton has 3241 states and 4271 transitions. Word has length 353 [2025-03-03 17:20:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 3241 states and 4271 transitions. [2025-03-03 17:20:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 54.6) internal successors, (273), 6 states have internal predecessors, (273), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 17:20:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3241 states and 4271 transitions. [2025-03-03 17:20:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 17:20:18,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:18,428 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:18,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 17:20:18,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-03 17:20:18,628 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:18,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash -590925895, now seen corresponding path program 1 times [2025-03-03 17:20:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785186605] [2025-03-03 17:20:18,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:18,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:18,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 17:20:19,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 17:20:19,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:19,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:19,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:19,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785186605] [2025-03-03 17:20:19,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785186605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:19,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:19,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:20:19,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906673977] [2025-03-03 17:20:19,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:19,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:19,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:19,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:19,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:19,470 INFO L87 Difference]: Start difference. First operand 3241 states and 4271 transitions. Second operand has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:19,989 INFO L93 Difference]: Finished difference Result 5285 states and 6980 transitions. [2025-03-03 17:20:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:20:19,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353 [2025-03-03 17:20:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:19,995 INFO L225 Difference]: With dead ends: 5285 [2025-03-03 17:20:19,995 INFO L226 Difference]: Without dead ends: 4337 [2025-03-03 17:20:19,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:20:19,997 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 744 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:19,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2058 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:20:19,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4337 states. [2025-03-03 17:20:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4337 to 3315. [2025-03-03 17:20:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3315 states, 3273 states have (on average 1.3113351665139017) internal successors, (4292), 3273 states have internal predecessors, (4292), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 17:20:20,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 4372 transitions. [2025-03-03 17:20:20,044 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 4372 transitions. Word has length 353 [2025-03-03 17:20:20,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:20,044 INFO L471 AbstractCegarLoop]: Abstraction has 3315 states and 4372 transitions. [2025-03-03 17:20:20,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 54.333333333333336) internal successors, (326), 6 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:20,046 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 4372 transitions. [2025-03-03 17:20:20,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 17:20:20,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:20,052 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:20,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 17:20:20,052 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:20,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash -232233251, now seen corresponding path program 1 times [2025-03-03 17:20:20,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:20,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081675350] [2025-03-03 17:20:20,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:20,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:20,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 17:20:20,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 17:20:20,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:20,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:21,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:21,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081675350] [2025-03-03 17:20:21,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081675350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:21,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:21,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:20:21,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627858864] [2025-03-03 17:20:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:21,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:20:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:21,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:20:21,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:20:21,203 INFO L87 Difference]: Start difference. First operand 3315 states and 4372 transitions. Second operand has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:22,043 INFO L93 Difference]: Finished difference Result 8522 states and 11272 transitions. [2025-03-03 17:20:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 17:20:22,044 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 353 [2025-03-03 17:20:22,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:22,054 INFO L225 Difference]: With dead ends: 8522 [2025-03-03 17:20:22,055 INFO L226 Difference]: Without dead ends: 7574 [2025-03-03 17:20:22,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:20:22,061 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 1733 mSDsluCounter, 2240 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1739 SdHoareTripleChecker+Valid, 2566 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:22,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1739 Valid, 2566 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:20:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7574 states. [2025-03-03 17:20:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7574 to 3489. [2025-03-03 17:20:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3489 states, 3439 states have (on average 1.3102646118057575) internal successors, (4506), 3439 states have internal predecessors, (4506), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 17:20:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4602 transitions. [2025-03-03 17:20:22,130 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4602 transitions. Word has length 353 [2025-03-03 17:20:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 3489 states and 4602 transitions. [2025-03-03 17:20:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.6) internal successors, (326), 10 states have internal predecessors, (326), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4602 transitions. [2025-03-03 17:20:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 17:20:22,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:22,137 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:22,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 17:20:22,137 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:22,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:22,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1715382692, now seen corresponding path program 1 times [2025-03-03 17:20:22,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:22,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587572797] [2025-03-03 17:20:22,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:22,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:22,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 17:20:22,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 17:20:22,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:22,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 17:20:23,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:23,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587572797] [2025-03-03 17:20:23,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587572797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:23,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:23,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:20:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512683355] [2025-03-03 17:20:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:23,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:20:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:23,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:20:23,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:20:23,229 INFO L87 Difference]: Start difference. First operand 3489 states and 4602 transitions. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:23,611 INFO L93 Difference]: Finished difference Result 7298 states and 9625 transitions. [2025-03-03 17:20:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:20:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 354 [2025-03-03 17:20:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:23,617 INFO L225 Difference]: With dead ends: 7298 [2025-03-03 17:20:23,617 INFO L226 Difference]: Without dead ends: 5521 [2025-03-03 17:20:23,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:20:23,619 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 1045 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 3102 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:23,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 3102 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2025-03-03 17:20:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 3637. [2025-03-03 17:20:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 3581 states have (on average 1.3080145210834961) internal successors, (4684), 3581 states have internal predecessors, (4684), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 17:20:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 4792 transitions. [2025-03-03 17:20:23,673 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 4792 transitions. Word has length 354 [2025-03-03 17:20:23,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:23,673 INFO L471 AbstractCegarLoop]: Abstraction has 3637 states and 4792 transitions. [2025-03-03 17:20:23,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 17:20:23,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 4792 transitions. [2025-03-03 17:20:23,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 17:20:23,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:23,679 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:23,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-03 17:20:23,679 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:23,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:23,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1473381018, now seen corresponding path program 1 times [2025-03-03 17:20:23,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032534310] [2025-03-03 17:20:23,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:23,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 17:20:23,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 17:20:23,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 17:20:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:24,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032534310] [2025-03-03 17:20:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032534310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:20:24,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:20:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:20:24,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75647274] [2025-03-03 17:20:24,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:20:24,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:20:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:24,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:20:24,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:24,113 INFO L87 Difference]: Start difference. First operand 3637 states and 4792 transitions. Second operand has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:20:24,443 INFO L93 Difference]: Finished difference Result 6089 states and 8003 transitions. [2025-03-03 17:20:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:20:24,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 354 [2025-03-03 17:20:24,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:20:24,447 INFO L225 Difference]: With dead ends: 6089 [2025-03-03 17:20:24,447 INFO L226 Difference]: Without dead ends: 3733 [2025-03-03 17:20:24,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:20:24,449 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 504 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:20:24,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1328 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:20:24,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2025-03-03 17:20:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3685. [2025-03-03 17:20:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 3629 states have (on average 1.3039404794709286) internal successors, (4732), 3629 states have internal predecessors, (4732), 54 states have call successors, (54), 1 states have call predecessors, (54), 1 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 17:20:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4840 transitions. [2025-03-03 17:20:24,492 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4840 transitions. Word has length 354 [2025-03-03 17:20:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:20:24,492 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4840 transitions. [2025-03-03 17:20:24,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 17:20:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4840 transitions. [2025-03-03 17:20:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-03 17:20:24,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:20:24,497 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:20:24,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-03 17:20:24,497 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:20:24,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:20:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 110205581, now seen corresponding path program 1 times [2025-03-03 17:20:24,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:20:24,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564038750] [2025-03-03 17:20:24,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:20:24,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 17:20:25,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 17:20:25,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:25,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 51 proven. 38 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:20:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564038750] [2025-03-03 17:20:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564038750] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 17:20:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25307429] [2025-03-03 17:20:28,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:20:28,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:20:28,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:20:28,802 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:20:28,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 17:20:29,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-03 17:20:30,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-03 17:20:30,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:20:30,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:20:30,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 2074 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 17:20:30,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:20:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 17:20:30,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:20:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 85 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 17:20:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25307429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:20:31,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 17:20:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 8] total 29 [2025-03-03 17:20:31,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301753394] [2025-03-03 17:20:31,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 17:20:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 17:20:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:20:31,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 17:20:31,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2025-03-03 17:20:31,809 INFO L87 Difference]: Start difference. First operand 3685 states and 4840 transitions. Second operand has 29 states, 29 states have (on average 28.724137931034484) internal successors, (833), 29 states have internal predecessors, (833), 6 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18)