./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.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.sw_sym_ex_v.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 38bd35bc88609e3ab03fd0664ba55e28973f1f4c4d5b4f19ae2a936fbd22c96e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:19:00,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:19:00,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:19:00,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:19:00,689 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:19:00,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:19:00,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:19:00,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:19:00,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:19:00,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:19:00,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:19:00,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:19:00,707 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:19:00,707 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:19:00,707 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:19:00,708 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:19:00,708 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:19:00,708 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:19:00,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:19:00,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:19:00,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:19:00,710 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 -> 38bd35bc88609e3ab03fd0664ba55e28973f1f4c4d5b4f19ae2a936fbd22c96e [2025-03-03 18:19:00,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:19:00,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:19:00,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:19:00,952 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:19:00,952 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:19:00,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c [2025-03-03 18:19:02,123 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb47a6ce/f948300960f746d984ae80f762c7e2ec/FLAG91254140f [2025-03-03 18:19:02,352 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:19:02,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_sym_ex_v.c [2025-03-03 18:19:02,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb47a6ce/f948300960f746d984ae80f762c7e2ec/FLAG91254140f [2025-03-03 18:19:02,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eb47a6ce/f948300960f746d984ae80f762c7e2ec [2025-03-03 18:19:02,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:19:02,373 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:19:02,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:19:02,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:19:02,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:19:02,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d4705a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02, skipping insertion in model container [2025-03-03 18:19:02,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,400 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:19:02,511 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.sw_sym_ex_v.c[1251,1264] [2025-03-03 18:19:02,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:19:02,680 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:19:02,687 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.sw_sym_ex_v.c[1251,1264] [2025-03-03 18:19:02,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:19:02,761 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:19:02,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02 WrapperNode [2025-03-03 18:19:02,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:19:02,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:19:02,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:19:02,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:19:02,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,899 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1299 [2025-03-03 18:19:02,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:19:02,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:19:02,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:19:02,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:19:02,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,931 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,980 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 18:19:02,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:02,980 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:03,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:03,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:03,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:03,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:03,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:19:03,127 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:19:03,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:19:03,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:19:03,128 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (1/1) ... [2025-03-03 18:19:03,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:19:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:03,154 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 18:19:03,156 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 18:19:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:19:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:19:03,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:19:03,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:19:03,340 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:19:03,341 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:19:04,470 INFO L? ?]: Removed 798 outVars from TransFormulas that were not future-live. [2025-03-03 18:19:04,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:19:04,537 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:19:04,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:19:04,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:19:04 BoogieIcfgContainer [2025-03-03 18:19:04,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:19:04,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:19:04,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:19:04,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:19:04,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:19:02" (1/3) ... [2025-03-03 18:19:04,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33855583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:19:04, skipping insertion in model container [2025-03-03 18:19:04,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:19:02" (2/3) ... [2025-03-03 18:19:04,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33855583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:19:04, skipping insertion in model container [2025-03-03 18:19:04,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:19:04" (3/3) ... [2025-03-03 18:19:04,548 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_sym_ex_v.c [2025-03-03 18:19:04,559 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:19:04,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_sym_ex_v.c that has 1 procedures, 382 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:19:04,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:19:04,625 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;@5aa4d43b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:19:04,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:19:04,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 380 states have (on average 1.4973684210526317) internal successors, (569), 381 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 18:19:04,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:04,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:04,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:04,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:04,643 INFO L85 PathProgramCache]: Analyzing trace with hash 776529739, now seen corresponding path program 1 times [2025-03-03 18:19:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:04,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447174403] [2025-03-03 18:19:04,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:04,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:04,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 18:19:04,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 18:19:04,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:04,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:05,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447174403] [2025-03-03 18:19:05,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447174403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:05,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:05,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:19:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482972209] [2025-03-03 18:19:05,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:05,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:19:05,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:05,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:19:05,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:19:05,141 INFO L87 Difference]: Start difference. First operand has 382 states, 380 states have (on average 1.4973684210526317) internal successors, (569), 381 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:05,411 INFO L93 Difference]: Finished difference Result 717 states and 1071 transitions. [2025-03-03 18:19:05,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:19:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-03-03 18:19:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:05,420 INFO L225 Difference]: With dead ends: 717 [2025-03-03 18:19:05,420 INFO L226 Difference]: Without dead ends: 381 [2025-03-03 18:19:05,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 18:19:05,425 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1405 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 18:19:05,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1405 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-03 18:19:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-03 18:19:05,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4921052631578948) internal successors, (567), 380 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 567 transitions. [2025-03-03 18:19:05,479 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 567 transitions. Word has length 37 [2025-03-03 18:19:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:05,479 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 567 transitions. [2025-03-03 18:19:05,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 567 transitions. [2025-03-03 18:19:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 18:19:05,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:05,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:05,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:19:05,483 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:05,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1692702183, now seen corresponding path program 1 times [2025-03-03 18:19:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:05,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906334579] [2025-03-03 18:19:05,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:05,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 18:19:05,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 18:19:05,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:05,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:05,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:05,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906334579] [2025-03-03 18:19:05,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906334579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:05,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:05,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:19:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71274782] [2025-03-03 18:19:05,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:05,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:19:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:05,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:19:05,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:19:05,641 INFO L87 Difference]: Start difference. First operand 381 states and 567 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:05,851 INFO L93 Difference]: Finished difference Result 718 states and 1069 transitions. [2025-03-03 18:19:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:19:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-03 18:19:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:05,853 INFO L225 Difference]: With dead ends: 718 [2025-03-03 18:19:05,854 INFO L226 Difference]: Without dead ends: 383 [2025-03-03 18:19:05,854 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 18:19:05,855 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1402 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 18:19:05,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1402 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-03 18:19:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2025-03-03 18:19:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.4895287958115184) internal successors, (569), 382 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 569 transitions. [2025-03-03 18:19:05,875 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 569 transitions. Word has length 38 [2025-03-03 18:19:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:05,875 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 569 transitions. [2025-03-03 18:19:05,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 569 transitions. [2025-03-03 18:19:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 18:19:05,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:05,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:05,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:19:05,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:05,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:05,877 INFO L85 PathProgramCache]: Analyzing trace with hash 997349638, now seen corresponding path program 1 times [2025-03-03 18:19:05,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:05,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540880533] [2025-03-03 18:19:05,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:05,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:05,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 18:19:05,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 18:19:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:06,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:06,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:06,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540880533] [2025-03-03 18:19:06,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540880533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:06,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:06,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:06,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578582911] [2025-03-03 18:19:06,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:06,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:06,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:06,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:06,071 INFO L87 Difference]: Start difference. First operand 383 states and 569 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:06,358 INFO L93 Difference]: Finished difference Result 1027 states and 1528 transitions. [2025-03-03 18:19:06,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:06,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-03 18:19:06,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:06,361 INFO L225 Difference]: With dead ends: 1027 [2025-03-03 18:19:06,361 INFO L226 Difference]: Without dead ends: 690 [2025-03-03 18:19:06,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:06,363 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1449 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:06,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1449 Valid, 1372 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-03 18:19:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 397. [2025-03-03 18:19:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.4873737373737375) internal successors, (589), 396 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 589 transitions. [2025-03-03 18:19:06,378 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 589 transitions. Word has length 39 [2025-03-03 18:19:06,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:06,378 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 589 transitions. [2025-03-03 18:19:06,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 589 transitions. [2025-03-03 18:19:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 18:19:06,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:06,388 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:06,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:19:06,388 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:06,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1069685728, now seen corresponding path program 1 times [2025-03-03 18:19:06,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:06,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953875291] [2025-03-03 18:19:06,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:06,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:06,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 18:19:06,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 18:19:06,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:06,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:07,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953875291] [2025-03-03 18:19:07,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953875291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:07,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:07,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012626147] [2025-03-03 18:19:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:07,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:07,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:07,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:07,630 INFO L87 Difference]: Start difference. First operand 397 states and 589 transitions. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:07,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:07,904 INFO L93 Difference]: Finished difference Result 1003 states and 1491 transitions. [2025-03-03 18:19:07,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:07,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-03 18:19:07,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:07,907 INFO L225 Difference]: With dead ends: 1003 [2025-03-03 18:19:07,907 INFO L226 Difference]: Without dead ends: 666 [2025-03-03 18:19:07,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:07,908 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1347 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1347 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:07,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1347 Valid, 1370 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:07,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-03 18:19:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 448. [2025-03-03 18:19:07,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.4809843400447427) internal successors, (662), 447 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 662 transitions. [2025-03-03 18:19:07,924 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 662 transitions. Word has length 206 [2025-03-03 18:19:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:07,924 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 662 transitions. [2025-03-03 18:19:07,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 662 transitions. [2025-03-03 18:19:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 18:19:07,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:07,928 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:07,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:19:07,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:07,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash 715214038, now seen corresponding path program 1 times [2025-03-03 18:19:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:07,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882675645] [2025-03-03 18:19:07,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:07,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 18:19:08,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 18:19:08,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:08,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:09,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:09,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882675645] [2025-03-03 18:19:09,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882675645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:09,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:09,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:09,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812603675] [2025-03-03 18:19:09,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:09,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:09,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:09,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:09,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:09,235 INFO L87 Difference]: Start difference. First operand 448 states and 662 transitions. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:09,495 INFO L93 Difference]: Finished difference Result 1003 states and 1489 transitions. [2025-03-03 18:19:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-03 18:19:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:09,497 INFO L225 Difference]: With dead ends: 1003 [2025-03-03 18:19:09,498 INFO L226 Difference]: Without dead ends: 666 [2025-03-03 18:19:09,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:09,500 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1297 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:09,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 1369 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:09,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-03 18:19:09,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 539. [2025-03-03 18:19:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4814126394052045) internal successors, (797), 538 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 797 transitions. [2025-03-03 18:19:09,512 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 797 transitions. Word has length 208 [2025-03-03 18:19:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:09,513 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 797 transitions. [2025-03-03 18:19:09,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 797 transitions. [2025-03-03 18:19:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 18:19:09,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:09,516 INFO L218 NwaCegarLoop]: trace histogram [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, 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 18:19:09,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:19:09,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:09,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1622656744, now seen corresponding path program 1 times [2025-03-03 18:19:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:09,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44606688] [2025-03-03 18:19:09,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:09,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 18:19:09,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 18:19:09,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:09,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:10,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44606688] [2025-03-03 18:19:10,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44606688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:10,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:10,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:10,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428533352] [2025-03-03 18:19:10,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:10,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:10,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:10,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:10,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:10,459 INFO L87 Difference]: Start difference. First operand 539 states and 797 transitions. Second operand has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:10,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:10,824 INFO L93 Difference]: Finished difference Result 1011 states and 1500 transitions. [2025-03-03 18:19:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:10,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2025-03-03 18:19:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:10,831 INFO L225 Difference]: With dead ends: 1011 [2025-03-03 18:19:10,831 INFO L226 Difference]: Without dead ends: 674 [2025-03-03 18:19:10,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:10,832 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1317 mSDsluCounter, 1699 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:10,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 2154 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-03 18:19:10,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 542. [2025-03-03 18:19:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4805914972273568) internal successors, (801), 541 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 801 transitions. [2025-03-03 18:19:10,852 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 801 transitions. Word has length 209 [2025-03-03 18:19:10,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:10,852 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 801 transitions. [2025-03-03 18:19:10,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.857142857142858) internal successors, (209), 7 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 801 transitions. [2025-03-03 18:19:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 18:19:10,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:10,854 INFO L218 NwaCegarLoop]: trace histogram [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, 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 18:19:10,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:19:10,854 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:10,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1213155237, now seen corresponding path program 1 times [2025-03-03 18:19:10,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:10,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292994359] [2025-03-03 18:19:10,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:10,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:10,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 18:19:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 18:19:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292994359] [2025-03-03 18:19:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292994359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:11,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272020032] [2025-03-03 18:19:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:11,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:11,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:11,745 INFO L87 Difference]: Start difference. First operand 542 states and 801 transitions. Second operand has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:12,007 INFO L93 Difference]: Finished difference Result 1038 states and 1538 transitions. [2025-03-03 18:19:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-03 18:19:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:12,010 INFO L225 Difference]: With dead ends: 1038 [2025-03-03 18:19:12,010 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 18:19:12,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:12,011 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1311 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1311 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:12,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1311 Valid, 1369 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:12,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 18:19:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 542. [2025-03-03 18:19:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.478743068391867) internal successors, (800), 541 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 800 transitions. [2025-03-03 18:19:12,021 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 800 transitions. Word has length 210 [2025-03-03 18:19:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:12,021 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 800 transitions. [2025-03-03 18:19:12,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 800 transitions. [2025-03-03 18:19:12,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 18:19:12,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:12,023 INFO L218 NwaCegarLoop]: trace histogram [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, 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 18:19:12,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:19:12,023 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:12,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -838290747, now seen corresponding path program 1 times [2025-03-03 18:19:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669756542] [2025-03-03 18:19:12,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:12,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 18:19:12,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 18:19:12,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:12,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669756542] [2025-03-03 18:19:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669756542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378497134] [2025-03-03 18:19:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:12,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:12,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:12,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:12,787 INFO L87 Difference]: Start difference. First operand 542 states and 800 transitions. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:13,046 INFO L93 Difference]: Finished difference Result 1005 states and 1489 transitions. [2025-03-03 18:19:13,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:13,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-03 18:19:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:13,048 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 18:19:13,048 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 18:19:13,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:13,050 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1274 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:13,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1369 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 18:19:13,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 573. [2025-03-03 18:19:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4772727272727273) internal successors, (845), 572 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 845 transitions. [2025-03-03 18:19:13,063 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 845 transitions. Word has length 211 [2025-03-03 18:19:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:13,063 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 845 transitions. [2025-03-03 18:19:13,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 845 transitions. [2025-03-03 18:19:13,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 18:19:13,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:13,066 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 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 18:19:13,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:19:13,067 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:13,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:13,069 INFO L85 PathProgramCache]: Analyzing trace with hash -841262079, now seen corresponding path program 1 times [2025-03-03 18:19:13,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:13,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717879094] [2025-03-03 18:19:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:13,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 18:19:13,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 18:19:13,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:13,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717879094] [2025-03-03 18:19:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717879094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:13,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046234583] [2025-03-03 18:19:13,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:13,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:13,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:13,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:13,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:13,896 INFO L87 Difference]: Start difference. First operand 573 states and 845 transitions. Second operand has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:14,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:14,155 INFO L93 Difference]: Finished difference Result 1005 states and 1488 transitions. [2025-03-03 18:19:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-03-03 18:19:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:14,157 INFO L225 Difference]: With dead ends: 1005 [2025-03-03 18:19:14,158 INFO L226 Difference]: Without dead ends: 668 [2025-03-03 18:19:14,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:14,159 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1239 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1239 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:14,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1239 Valid, 1369 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-03 18:19:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 637. [2025-03-03 18:19:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 1.4779874213836477) internal successors, (940), 636 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 940 transitions. [2025-03-03 18:19:14,171 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 940 transitions. Word has length 212 [2025-03-03 18:19:14,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:14,173 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 940 transitions. [2025-03-03 18:19:14,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.4) internal successors, (212), 5 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:14,173 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 940 transitions. [2025-03-03 18:19:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-03 18:19:14,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:14,175 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 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 18:19:14,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:19:14,175 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:14,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1463270251, now seen corresponding path program 1 times [2025-03-03 18:19:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054760874] [2025-03-03 18:19:14,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:14,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-03 18:19:14,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-03 18:19:14,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:14,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054760874] [2025-03-03 18:19:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054760874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:14,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:14,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078231654] [2025-03-03 18:19:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:14,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:14,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:14,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:14,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:14,857 INFO L87 Difference]: Start difference. First operand 637 states and 940 transitions. Second operand has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:15,187 INFO L93 Difference]: Finished difference Result 1071 states and 1585 transitions. [2025-03-03 18:19:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2025-03-03 18:19:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:15,189 INFO L225 Difference]: With dead ends: 1071 [2025-03-03 18:19:15,190 INFO L226 Difference]: Without dead ends: 676 [2025-03-03 18:19:15,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:15,191 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1292 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2034 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.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:15,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2034 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-03 18:19:15,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 639. [2025-03-03 18:19:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 638 states have (on average 1.4764890282131662) internal successors, (942), 638 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 942 transitions. [2025-03-03 18:19:15,202 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 942 transitions. Word has length 213 [2025-03-03 18:19:15,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:15,202 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 942 transitions. [2025-03-03 18:19:15,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.428571428571427) internal successors, (213), 7 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:15,203 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 942 transitions. [2025-03-03 18:19:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 18:19:15,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:15,204 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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 18:19:15,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:19:15,204 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:15,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:15,205 INFO L85 PathProgramCache]: Analyzing trace with hash -624778196, now seen corresponding path program 1 times [2025-03-03 18:19:15,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:15,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559177061] [2025-03-03 18:19:15,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:15,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:15,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 18:19:15,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 18:19:15,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:15,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:15,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559177061] [2025-03-03 18:19:15,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559177061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:15,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:15,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239049955] [2025-03-03 18:19:15,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:15,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:15,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:15,890 INFO L87 Difference]: Start difference. First operand 639 states and 942 transitions. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:16,234 INFO L93 Difference]: Finished difference Result 1109 states and 1641 transitions. [2025-03-03 18:19:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:16,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-03 18:19:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:16,236 INFO L225 Difference]: With dead ends: 1109 [2025-03-03 18:19:16,236 INFO L226 Difference]: Without dead ends: 718 [2025-03-03 18:19:16,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:16,237 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1409 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 2129 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:16,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 2129 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-03 18:19:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 641. [2025-03-03 18:19:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 640 states have (on average 1.475) internal successors, (944), 640 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 944 transitions. [2025-03-03 18:19:16,249 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 944 transitions. Word has length 214 [2025-03-03 18:19:16,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:16,249 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 944 transitions. [2025-03-03 18:19:16,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 944 transitions. [2025-03-03 18:19:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-03 18:19:16,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:16,252 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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 18:19:16,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:19:16,253 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:16,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:16,253 INFO L85 PathProgramCache]: Analyzing trace with hash -449382381, now seen corresponding path program 1 times [2025-03-03 18:19:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47170625] [2025-03-03 18:19:16,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:16,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-03 18:19:16,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-03 18:19:16,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:17,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47170625] [2025-03-03 18:19:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47170625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63483625] [2025-03-03 18:19:17,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:17,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:17,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:17,019 INFO L87 Difference]: Start difference. First operand 641 states and 944 transitions. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:17,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:17,356 INFO L93 Difference]: Finished difference Result 1017 states and 1503 transitions. [2025-03-03 18:19:17,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:17,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 214 [2025-03-03 18:19:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:17,359 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 18:19:17,359 INFO L226 Difference]: Without dead ends: 680 [2025-03-03 18:19:17,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:17,361 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1257 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:17,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 2268 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:17,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-03 18:19:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 644. [2025-03-03 18:19:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.474339035769829) internal successors, (948), 643 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 948 transitions. [2025-03-03 18:19:17,380 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 948 transitions. Word has length 214 [2025-03-03 18:19:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:17,380 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 948 transitions. [2025-03-03 18:19:17,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:17,380 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 948 transitions. [2025-03-03 18:19:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 18:19:17,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:17,382 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 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 18:19:17,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:19:17,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash -174861816, now seen corresponding path program 1 times [2025-03-03 18:19:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128528285] [2025-03-03 18:19:17,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:17,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 18:19:17,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 18:19:17,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:17,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:18,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:18,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128528285] [2025-03-03 18:19:18,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128528285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:18,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:18,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:18,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566383342] [2025-03-03 18:19:18,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:18,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:18,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:18,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:18,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:18,032 INFO L87 Difference]: Start difference. First operand 644 states and 948 transitions. Second operand has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:18,284 INFO L93 Difference]: Finished difference Result 1044 states and 1541 transitions. [2025-03-03 18:19:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2025-03-03 18:19:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:18,286 INFO L225 Difference]: With dead ends: 1044 [2025-03-03 18:19:18,286 INFO L226 Difference]: Without dead ends: 674 [2025-03-03 18:19:18,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:18,288 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1252 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:18,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1369 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-03-03 18:19:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 644. [2025-03-03 18:19:18,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.4727838258164851) internal successors, (947), 643 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:18,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 947 transitions. [2025-03-03 18:19:18,298 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 947 transitions. Word has length 215 [2025-03-03 18:19:18,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:18,299 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 947 transitions. [2025-03-03 18:19:18,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 947 transitions. [2025-03-03 18:19:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 18:19:18,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:18,301 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 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 18:19:18,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:19:18,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:18,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash -633945552, now seen corresponding path program 1 times [2025-03-03 18:19:18,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:18,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438599749] [2025-03-03 18:19:18,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:18,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:18,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 18:19:18,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 18:19:18,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:18,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438599749] [2025-03-03 18:19:18,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438599749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:18,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:18,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970042376] [2025-03-03 18:19:18,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:18,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:18,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:18,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:18,985 INFO L87 Difference]: Start difference. First operand 644 states and 947 transitions. Second operand has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:19,303 INFO L93 Difference]: Finished difference Result 1048 states and 1546 transitions. [2025-03-03 18:19:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2025-03-03 18:19:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:19,305 INFO L225 Difference]: With dead ends: 1048 [2025-03-03 18:19:19,305 INFO L226 Difference]: Without dead ends: 682 [2025-03-03 18:19:19,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:19,306 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1271 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:19,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 2268 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2025-03-03 18:19:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 646. [2025-03-03 18:19:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.4713178294573643) internal successors, (949), 645 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 949 transitions. [2025-03-03 18:19:19,317 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 949 transitions. Word has length 216 [2025-03-03 18:19:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:19,317 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 949 transitions. [2025-03-03 18:19:19,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.857142857142858) internal successors, (216), 7 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 949 transitions. [2025-03-03 18:19:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 18:19:19,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:19,319 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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 18:19:19,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:19:19,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:19,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:19,319 INFO L85 PathProgramCache]: Analyzing trace with hash -258599155, now seen corresponding path program 1 times [2025-03-03 18:19:19,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:19,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477754215] [2025-03-03 18:19:19,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:19,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:19,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 18:19:19,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 18:19:19,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:19,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:19,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477754215] [2025-03-03 18:19:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477754215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:19,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:19,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:19,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010058315] [2025-03-03 18:19:19,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:19,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:19,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:19,929 INFO L87 Difference]: Start difference. First operand 646 states and 949 transitions. Second operand has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:20,254 INFO L93 Difference]: Finished difference Result 1086 states and 1602 transitions. [2025-03-03 18:19:20,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:20,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-03-03 18:19:20,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:20,256 INFO L225 Difference]: With dead ends: 1086 [2025-03-03 18:19:20,256 INFO L226 Difference]: Without dead ends: 724 [2025-03-03 18:19:20,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:20,257 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1389 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1389 SdHoareTripleChecker+Valid, 2197 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:20,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1389 Valid, 2197 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-03-03 18:19:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 648. [2025-03-03 18:19:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 647 states have (on average 1.4698608964451314) internal successors, (951), 647 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:20,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 951 transitions. [2025-03-03 18:19:20,269 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 951 transitions. Word has length 217 [2025-03-03 18:19:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:20,269 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 951 transitions. [2025-03-03 18:19:20,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 951 transitions. [2025-03-03 18:19:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 18:19:20,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:20,270 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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 18:19:20,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:19:20,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:20,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash -165639854, now seen corresponding path program 1 times [2025-03-03 18:19:20,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:20,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114922184] [2025-03-03 18:19:20,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:20,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:20,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 18:19:20,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 18:19:20,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:20,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:21,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:21,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:21,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114922184] [2025-03-03 18:19:21,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114922184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:21,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:21,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286403259] [2025-03-03 18:19:21,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:21,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:21,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:21,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:21,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:21,070 INFO L87 Difference]: Start difference. First operand 648 states and 951 transitions. Second operand has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:21,401 INFO L93 Difference]: Finished difference Result 1063 states and 1568 transitions. [2025-03-03 18:19:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-03-03 18:19:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:21,404 INFO L225 Difference]: With dead ends: 1063 [2025-03-03 18:19:21,405 INFO L226 Difference]: Without dead ends: 726 [2025-03-03 18:19:21,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:21,406 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1370 mSDsluCounter, 1813 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:21,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 2267 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-03 18:19:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 654. [2025-03-03 18:19:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 653 states have (on average 1.4686064318529861) internal successors, (959), 653 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 959 transitions. [2025-03-03 18:19:21,417 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 959 transitions. Word has length 217 [2025-03-03 18:19:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:21,417 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 959 transitions. [2025-03-03 18:19:21,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.0) internal successors, (217), 7 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 959 transitions. [2025-03-03 18:19:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 18:19:21,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:21,418 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 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 18:19:21,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:19:21,418 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:21,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:21,420 INFO L85 PathProgramCache]: Analyzing trace with hash -77217247, now seen corresponding path program 1 times [2025-03-03 18:19:21,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:21,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172559253] [2025-03-03 18:19:21,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:21,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:21,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 18:19:21,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 18:19:21,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:21,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:22,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:22,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172559253] [2025-03-03 18:19:22,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172559253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:22,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:22,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:22,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923435183] [2025-03-03 18:19:22,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:22,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:22,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:22,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:22,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:22,050 INFO L87 Difference]: Start difference. First operand 654 states and 959 transitions. Second operand has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:22,260 INFO L93 Difference]: Finished difference Result 1020 states and 1503 transitions. [2025-03-03 18:19:22,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:22,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 217 [2025-03-03 18:19:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:22,262 INFO L225 Difference]: With dead ends: 1020 [2025-03-03 18:19:22,262 INFO L226 Difference]: Without dead ends: 683 [2025-03-03 18:19:22,263 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 18:19:22,263 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 1220 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:22,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 1366 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-03-03 18:19:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2025-03-03 18:19:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.4676470588235293) internal successors, (998), 680 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:22,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 998 transitions. [2025-03-03 18:19:22,270 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 998 transitions. Word has length 217 [2025-03-03 18:19:22,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:22,270 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 998 transitions. [2025-03-03 18:19:22,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.4) internal successors, (217), 5 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 998 transitions. [2025-03-03 18:19:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 18:19:22,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:22,271 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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 18:19:22,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:19:22,272 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:22,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:22,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2056703901, now seen corresponding path program 1 times [2025-03-03 18:19:22,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:22,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712987796] [2025-03-03 18:19:22,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:22,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:22,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 18:19:22,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 18:19:22,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:22,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:22,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712987796] [2025-03-03 18:19:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712987796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:22,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:22,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:22,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087324342] [2025-03-03 18:19:22,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:22,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:22,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:22,925 INFO L87 Difference]: Start difference. First operand 681 states and 998 transitions. Second operand has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:23,197 INFO L93 Difference]: Finished difference Result 1025 states and 1509 transitions. [2025-03-03 18:19:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 218 [2025-03-03 18:19:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:23,204 INFO L225 Difference]: With dead ends: 1025 [2025-03-03 18:19:23,204 INFO L226 Difference]: Without dead ends: 688 [2025-03-03 18:19:23,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:23,205 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1229 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:23,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 2149 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-03 18:19:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 684. [2025-03-03 18:19:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.4670571010248903) internal successors, (1002), 683 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1002 transitions. [2025-03-03 18:19:23,213 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1002 transitions. Word has length 218 [2025-03-03 18:19:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:23,213 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1002 transitions. [2025-03-03 18:19:23,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.142857142857142) internal successors, (218), 7 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:23,214 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1002 transitions. [2025-03-03 18:19:23,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 18:19:23,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:23,215 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:23,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:19:23,215 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:23,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash -969653530, now seen corresponding path program 1 times [2025-03-03 18:19:23,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:23,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945777106] [2025-03-03 18:19:23,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:23,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 18:19:23,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 18:19:23,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:23,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945777106] [2025-03-03 18:19:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945777106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:23,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:23,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091388858] [2025-03-03 18:19:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:23,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:23,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:23,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:23,824 INFO L87 Difference]: Start difference. First operand 684 states and 1002 transitions. Second operand has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:24,088 INFO L93 Difference]: Finished difference Result 1067 states and 1571 transitions. [2025-03-03 18:19:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-03-03 18:19:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:24,091 INFO L225 Difference]: With dead ends: 1067 [2025-03-03 18:19:24,091 INFO L226 Difference]: Without dead ends: 730 [2025-03-03 18:19:24,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:24,092 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1351 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:24,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 2125 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-03 18:19:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 690. [2025-03-03 18:19:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 689 states have (on average 1.4658925979680697) internal successors, (1010), 689 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1010 transitions. [2025-03-03 18:19:24,099 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1010 transitions. Word has length 219 [2025-03-03 18:19:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:24,099 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1010 transitions. [2025-03-03 18:19:24,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.285714285714285) internal successors, (219), 7 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1010 transitions. [2025-03-03 18:19:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 18:19:24,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:24,100 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:24,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:19:24,101 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:24,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:24,101 INFO L85 PathProgramCache]: Analyzing trace with hash -220256263, now seen corresponding path program 1 times [2025-03-03 18:19:24,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:24,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720696690] [2025-03-03 18:19:24,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:24,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:24,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 18:19:24,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 18:19:24,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:24,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:24,863 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720696690] [2025-03-03 18:19:24,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720696690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:24,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433655945] [2025-03-03 18:19:24,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:24,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:24,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:24,865 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 18:19:24,866 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 18:19:25,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 18:19:25,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 18:19:25,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:25,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:25,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 1346 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 18:19:25,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:25,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:19:25,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433655945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:25,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:19:25,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-03 18:19:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085950770] [2025-03-03 18:19:25,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:25,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:25,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:25,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:19:25,540 INFO L87 Difference]: Start difference. First operand 690 states and 1010 transitions. Second operand has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:25,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:25,824 INFO L93 Difference]: Finished difference Result 1300 states and 1904 transitions. [2025-03-03 18:19:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:25,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-03-03 18:19:25,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:25,826 INFO L225 Difference]: With dead ends: 1300 [2025-03-03 18:19:25,826 INFO L226 Difference]: Without dead ends: 689 [2025-03-03 18:19:25,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:25,827 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 1346 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:25,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 1199 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-03 18:19:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-03-03 18:19:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.4636627906976745) internal successors, (1007), 688 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1007 transitions. [2025-03-03 18:19:25,834 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1007 transitions. Word has length 219 [2025-03-03 18:19:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1007 transitions. [2025-03-03 18:19:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.8) internal successors, (219), 5 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1007 transitions. [2025-03-03 18:19:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 18:19:25,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:25,835 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:25,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:19:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:26,036 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:26,037 INFO L85 PathProgramCache]: Analyzing trace with hash 609607542, now seen corresponding path program 1 times [2025-03-03 18:19:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246236672] [2025-03-03 18:19:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:26,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:26,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 18:19:26,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 18:19:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:26,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:26,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:26,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246236672] [2025-03-03 18:19:26,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246236672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:26,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:26,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148908297] [2025-03-03 18:19:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:26,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:26,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:26,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:26,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:26,661 INFO L87 Difference]: Start difference. First operand 689 states and 1007 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:26,856 INFO L93 Difference]: Finished difference Result 1207 states and 1766 transitions. [2025-03-03 18:19:26,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-03 18:19:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:26,858 INFO L225 Difference]: With dead ends: 1207 [2025-03-03 18:19:26,858 INFO L226 Difference]: Without dead ends: 689 [2025-03-03 18:19:26,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:26,859 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1295 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:26,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1370 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:26,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-03-03 18:19:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2025-03-03 18:19:26,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 688 states have (on average 1.4622093023255813) internal successors, (1006), 688 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:26,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1006 transitions. [2025-03-03 18:19:26,866 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1006 transitions. Word has length 220 [2025-03-03 18:19:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:26,866 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1006 transitions. [2025-03-03 18:19:26,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1006 transitions. [2025-03-03 18:19:26,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 18:19:26,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:26,867 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:26,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:19:26,867 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:26,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:26,867 INFO L85 PathProgramCache]: Analyzing trace with hash -766846933, now seen corresponding path program 1 times [2025-03-03 18:19:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:26,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991036951] [2025-03-03 18:19:26,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:26,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 18:19:27,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 18:19:27,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:27,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991036951] [2025-03-03 18:19:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991036951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:27,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:27,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:27,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899459706] [2025-03-03 18:19:27,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:27,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:27,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:27,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:27,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:27,505 INFO L87 Difference]: Start difference. First operand 689 states and 1006 transitions. Second operand has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:27,722 INFO L93 Difference]: Finished difference Result 1171 states and 1713 transitions. [2025-03-03 18:19:27,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:27,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-03 18:19:27,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:27,727 INFO L225 Difference]: With dead ends: 1171 [2025-03-03 18:19:27,727 INFO L226 Difference]: Without dead ends: 687 [2025-03-03 18:19:27,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 18:19:27,728 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1275 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:27,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 1370 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-03 18:19:27,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2025-03-03 18:19:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 1.4620991253644315) internal successors, (1003), 686 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1003 transitions. [2025-03-03 18:19:27,736 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1003 transitions. Word has length 221 [2025-03-03 18:19:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:27,736 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1003 transitions. [2025-03-03 18:19:27,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.2) internal successors, (221), 5 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1003 transitions. [2025-03-03 18:19:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 18:19:27,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:27,737 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:27,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 18:19:27,738 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:27,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1172160673, now seen corresponding path program 1 times [2025-03-03 18:19:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:27,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243090010] [2025-03-03 18:19:27,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:27,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:27,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 18:19:28,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 18:19:28,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:28,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:29,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243090010] [2025-03-03 18:19:29,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243090010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261146791] [2025-03-03 18:19:29,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:29,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:29,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:29,320 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 18:19:29,322 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 18:19:29,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 18:19:29,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 18:19:29,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:29,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:29,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 1348 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-03 18:19:29,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:30,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261146791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:19:31,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:19:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 11] total 32 [2025-03-03 18:19:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652440704] [2025-03-03 18:19:31,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:19:31,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 18:19:31,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:31,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 18:19:31,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2025-03-03 18:19:31,573 INFO L87 Difference]: Start difference. First operand 687 states and 1003 transitions. Second operand has 32 states, 32 states have (on average 20.28125) internal successors, (649), 32 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:33,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:33,196 INFO L93 Difference]: Finished difference Result 2308 states and 3381 transitions. [2025-03-03 18:19:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 18:19:33,197 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 20.28125) internal successors, (649), 32 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-03 18:19:33,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:33,200 INFO L225 Difference]: With dead ends: 2308 [2025-03-03 18:19:33,200 INFO L226 Difference]: Without dead ends: 1696 [2025-03-03 18:19:33,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=506, Invalid=2574, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 18:19:33,202 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 11262 mSDsluCounter, 7920 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11262 SdHoareTripleChecker+Valid, 8312 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:33,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11262 Valid, 8312 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:19:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2025-03-03 18:19:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1288. [2025-03-03 18:19:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 1.4615384615384615) internal successors, (1881), 1287 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1881 transitions. [2025-03-03 18:19:33,213 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1881 transitions. Word has length 221 [2025-03-03 18:19:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:33,213 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1881 transitions. [2025-03-03 18:19:33,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 20.28125) internal successors, (649), 32 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:33,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1881 transitions. [2025-03-03 18:19:33,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 18:19:33,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:33,215 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:33,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 18:19:33,419 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,SelfDestructingSolverStorable22 [2025-03-03 18:19:33,419 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:33,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1193713469, now seen corresponding path program 1 times [2025-03-03 18:19:33,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:33,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281633462] [2025-03-03 18:19:33,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:33,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:33,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 18:19:33,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 18:19:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:33,711 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:33,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:33,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281633462] [2025-03-03 18:19:33,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281633462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:33,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:33,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615360991] [2025-03-03 18:19:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:33,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:33,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:33,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:33,713 INFO L87 Difference]: Start difference. First operand 1288 states and 1881 transitions. Second operand has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:33,874 INFO L93 Difference]: Finished difference Result 1935 states and 2826 transitions. [2025-03-03 18:19:33,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:33,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-03 18:19:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:33,877 INFO L225 Difference]: With dead ends: 1935 [2025-03-03 18:19:33,877 INFO L226 Difference]: Without dead ends: 1321 [2025-03-03 18:19:33,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:33,878 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1405 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:33,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 1373 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:19:33,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-03 18:19:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1285. [2025-03-03 18:19:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2025-03-03 18:19:33,888 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 222 [2025-03-03 18:19:33,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:33,888 INFO L471 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2025-03-03 18:19:33,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2025-03-03 18:19:33,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 18:19:33,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:33,890 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:19:33,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 18:19:33,890 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:33,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:33,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1152856216, now seen corresponding path program 1 times [2025-03-03 18:19:33,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607882557] [2025-03-03 18:19:33,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:33,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:33,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 18:19:33,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 18:19:33,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:33,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607882557] [2025-03-03 18:19:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607882557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:34,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:19:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351016611] [2025-03-03 18:19:34,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:34,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:19:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:34,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:19:34,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:19:34,257 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:34,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:34,519 INFO L93 Difference]: Finished difference Result 1632 states and 2390 transitions. [2025-03-03 18:19:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:34,520 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-03-03 18:19:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:34,522 INFO L225 Difference]: With dead ends: 1632 [2025-03-03 18:19:34,522 INFO L226 Difference]: Without dead ends: 1017 [2025-03-03 18:19:34,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:19:34,523 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1375 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 1822 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.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:34,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 1822 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:34,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2025-03-03 18:19:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1007. [2025-03-03 18:19:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 1006 states have (on average 1.4681908548707754) internal successors, (1477), 1006 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1477 transitions. [2025-03-03 18:19:34,532 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1477 transitions. Word has length 222 [2025-03-03 18:19:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:34,532 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1477 transitions. [2025-03-03 18:19:34,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1477 transitions. [2025-03-03 18:19:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 18:19:34,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:34,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:34,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:19:34,534 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:34,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:34,535 INFO L85 PathProgramCache]: Analyzing trace with hash 215745753, now seen corresponding path program 1 times [2025-03-03 18:19:34,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:34,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439596685] [2025-03-03 18:19:34,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:34,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 18:19:36,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 18:19:36,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:36,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:37,408 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:37,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:37,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439596685] [2025-03-03 18:19:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439596685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:37,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:37,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 18:19:37,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774373278] [2025-03-03 18:19:37,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:37,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 18:19:37,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:37,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 18:19:37,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:19:37,410 INFO L87 Difference]: Start difference. First operand 1007 states and 1477 transitions. Second operand has 9 states, 9 states have (on average 43.22222222222222) internal successors, (389), 9 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:38,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:38,019 INFO L93 Difference]: Finished difference Result 3489 states and 5179 transitions. [2025-03-03 18:19:38,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 18:19:38,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 43.22222222222222) internal successors, (389), 9 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 389 [2025-03-03 18:19:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:38,025 INFO L225 Difference]: With dead ends: 3489 [2025-03-03 18:19:38,025 INFO L226 Difference]: Without dead ends: 2828 [2025-03-03 18:19:38,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-03-03 18:19:38,026 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 1721 mSDsluCounter, 4068 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:38,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 4835 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:19:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2025-03-03 18:19:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 1658. [2025-03-03 18:19:38,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.475558237779119) internal successors, (2445), 1657 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2445 transitions. [2025-03-03 18:19:38,046 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2445 transitions. Word has length 389 [2025-03-03 18:19:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:38,046 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2445 transitions. [2025-03-03 18:19:38,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 43.22222222222222) internal successors, (389), 9 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2445 transitions. [2025-03-03 18:19:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-03 18:19:38,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:38,049 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:19:38,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 18:19:38,049 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:38,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:38,050 INFO L85 PathProgramCache]: Analyzing trace with hash -708330518, now seen corresponding path program 1 times [2025-03-03 18:19:38,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:38,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087635720] [2025-03-03 18:19:38,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:38,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 18:19:40,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 18:19:40,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:40,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 174 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 18:19:40,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087635720] [2025-03-03 18:19:40,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087635720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279062686] [2025-03-03 18:19:40,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:40,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:40,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:40,776 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 18:19:40,777 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 18:19:41,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 18:19:41,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 18:19:41,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:41,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 2478 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 18:19:41,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 141 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:42,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 141 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279062686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:19:43,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:19:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 16] total 34 [2025-03-03 18:19:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275128381] [2025-03-03 18:19:43,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:19:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 18:19:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:43,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 18:19:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:19:43,916 INFO L87 Difference]: Start difference. First operand 1658 states and 2445 transitions. Second operand has 34 states, 34 states have (on average 26.41176470588235) internal successors, (898), 34 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:47,886 INFO L93 Difference]: Finished difference Result 7509 states and 11173 transitions. [2025-03-03 18:19:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-03 18:19:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 26.41176470588235) internal successors, (898), 34 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2025-03-03 18:19:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:47,901 INFO L225 Difference]: With dead ends: 7509 [2025-03-03 18:19:47,901 INFO L226 Difference]: Without dead ends: 6060 [2025-03-03 18:19:47,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 753 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1449, Invalid=6741, Unknown=0, NotChecked=0, Total=8190 [2025-03-03 18:19:47,904 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 14932 mSDsluCounter, 13304 mSDsCounter, 0 mSdLazyCounter, 5615 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14932 SdHoareTripleChecker+Valid, 14200 SdHoareTripleChecker+Invalid, 5641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 5615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:47,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14932 Valid, 14200 Invalid, 5641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 5615 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 18:19:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2025-03-03 18:19:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 2085. [2025-03-03 18:19:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.4673704414587332) internal successors, (3058), 2084 states have internal predecessors, (3058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3058 transitions. [2025-03-03 18:19:47,932 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3058 transitions. Word has length 390 [2025-03-03 18:19:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:47,933 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3058 transitions. [2025-03-03 18:19:47,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 26.41176470588235) internal successors, (898), 34 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3058 transitions. [2025-03-03 18:19:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-03 18:19:47,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:47,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:19:47,947 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 18:19:48,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:48,136 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:48,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:48,136 INFO L85 PathProgramCache]: Analyzing trace with hash 888957560, now seen corresponding path program 1 times [2025-03-03 18:19:48,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:48,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957578722] [2025-03-03 18:19:48,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:48,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 18:19:49,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 18:19:49,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:49,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 176 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 18:19:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957578722] [2025-03-03 18:19:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957578722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917990286] [2025-03-03 18:19:50,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:50,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:50,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:50,183 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 18:19:50,184 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 18:19:50,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 18:19:51,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 18:19:51,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:51,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:51,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 2478 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-03 18:19:51,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 161 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:51,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:53,386 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 159 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:53,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917990286] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:19:53,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:19:53,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 18] total 36 [2025-03-03 18:19:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361706586] [2025-03-03 18:19:53,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:19:53,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 18:19:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:53,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 18:19:53,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1082, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 18:19:53,389 INFO L87 Difference]: Start difference. First operand 2085 states and 3058 transitions. Second operand has 36 states, 36 states have (on average 28.38888888888889) internal successors, (1022), 36 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:57,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:57,845 INFO L93 Difference]: Finished difference Result 6629 states and 9804 transitions. [2025-03-03 18:19:57,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-03 18:19:57,846 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 28.38888888888889) internal successors, (1022), 36 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 390 [2025-03-03 18:19:57,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:57,852 INFO L225 Difference]: With dead ends: 6629 [2025-03-03 18:19:57,852 INFO L226 Difference]: Without dead ends: 5057 [2025-03-03 18:19:57,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 757 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=925, Invalid=6557, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 18:19:57,854 INFO L435 NwaCegarLoop]: 1691 mSDtfsCounter, 10091 mSDsluCounter, 22512 mSDsCounter, 0 mSdLazyCounter, 8937 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10091 SdHoareTripleChecker+Valid, 24203 SdHoareTripleChecker+Invalid, 8960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 8937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:57,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10091 Valid, 24203 Invalid, 8960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 8937 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-03 18:19:57,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2025-03-03 18:19:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 2420. [2025-03-03 18:19:57,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2419 states have (on average 1.4601074824307565) internal successors, (3532), 2419 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3532 transitions. [2025-03-03 18:19:57,876 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3532 transitions. Word has length 390 [2025-03-03 18:19:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:57,877 INFO L471 AbstractCegarLoop]: Abstraction has 2420 states and 3532 transitions. [2025-03-03 18:19:57,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 28.38888888888889) internal successors, (1022), 36 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:19:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3532 transitions. [2025-03-03 18:19:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-03 18:19:57,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:57,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:19:57,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 18:19:58,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 18:19:58,084 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:58,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2113055979, now seen corresponding path program 1 times [2025-03-03 18:19:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469704284] [2025-03-03 18:19:58,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:58,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:58,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 18:19:59,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 18:19:59,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:20:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 162 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:20:01,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:20:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469704284] [2025-03-03 18:20:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469704284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:20:01,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811979513] [2025-03-03 18:20:01,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:20:01,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:20:01,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:20:01,159 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 18:20:01,160 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 18:20:01,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 18:20:02,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 18:20:02,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:20:02,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:20:02,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 2484 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-03 18:20:02,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:20:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 93 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:20:02,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:20:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 93 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:20:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811979513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:20:04,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:20:04,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 16] total 39 [2025-03-03 18:20:04,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832980086] [2025-03-03 18:20:04,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:20:04,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 18:20:04,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:20:04,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 18:20:04,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1315, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 18:20:04,744 INFO L87 Difference]: Start difference. First operand 2420 states and 3532 transitions. Second operand has 39 states, 39 states have (on average 25.794871794871796) internal successors, (1006), 39 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:11,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:20:11,182 INFO L93 Difference]: Finished difference Result 9950 states and 14688 transitions. [2025-03-03 18:20:11,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-03 18:20:11,183 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 25.794871794871796) internal successors, (1006), 39 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2025-03-03 18:20:11,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:20:11,195 INFO L225 Difference]: With dead ends: 9950 [2025-03-03 18:20:11,195 INFO L226 Difference]: Without dead ends: 8170 [2025-03-03 18:20:11,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 756 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3772 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1956, Invalid=10476, Unknown=0, NotChecked=0, Total=12432 [2025-03-03 18:20:11,201 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 19376 mSDsluCounter, 30928 mSDsCounter, 0 mSdLazyCounter, 11240 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19376 SdHoareTripleChecker+Valid, 32435 SdHoareTripleChecker+Invalid, 11289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 11240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:20:11,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19376 Valid, 32435 Invalid, 11289 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [49 Valid, 11240 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 18:20:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8170 states. [2025-03-03 18:20:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8170 to 4800. [2025-03-03 18:20:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4800 states, 4799 states have (on average 1.4642633882058762) internal successors, (7027), 4799 states have internal predecessors, (7027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:11,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4800 states to 4800 states and 7027 transitions. [2025-03-03 18:20:11,257 INFO L78 Accepts]: Start accepts. Automaton has 4800 states and 7027 transitions. Word has length 392 [2025-03-03 18:20:11,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:20:11,257 INFO L471 AbstractCegarLoop]: Abstraction has 4800 states and 7027 transitions. [2025-03-03 18:20:11,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 25.794871794871796) internal successors, (1006), 39 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 4800 states and 7027 transitions. [2025-03-03 18:20:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-03-03 18:20:11,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:20:11,260 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:20:11,272 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 18:20:11,460 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,SelfDestructingSolverStorable28 [2025-03-03 18:20:11,461 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:20:11,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:20:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2124398566, now seen corresponding path program 1 times [2025-03-03 18:20:11,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:20:11,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982505011] [2025-03-03 18:20:11,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:20:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:20:11,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-03-03 18:20:13,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-03-03 18:20:13,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:20:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:20:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 18:20:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:20:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982505011] [2025-03-03 18:20:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982505011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:20:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:20:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:20:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472460599] [2025-03-03 18:20:14,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:20:14,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:20:14,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:20:14,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:20:14,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:20:14,112 INFO L87 Difference]: Start difference. First operand 4800 states and 7027 transitions. Second operand has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:14,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:20:14,286 INFO L93 Difference]: Finished difference Result 9263 states and 13578 transitions. [2025-03-03 18:20:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:20:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 394 [2025-03-03 18:20:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:20:14,298 INFO L225 Difference]: With dead ends: 9263 [2025-03-03 18:20:14,298 INFO L226 Difference]: Without dead ends: 4835 [2025-03-03 18:20:14,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:20:14,303 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 1 mSDsluCounter, 1852 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:20:14,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2318 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:20:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4835 states. [2025-03-03 18:20:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4835 to 4835. [2025-03-03 18:20:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4835 states, 4834 states have (on average 1.4623500206868019) internal successors, (7069), 4834 states have internal predecessors, (7069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4835 states to 4835 states and 7069 transitions. [2025-03-03 18:20:14,345 INFO L78 Accepts]: Start accepts. Automaton has 4835 states and 7069 transitions. Word has length 394 [2025-03-03 18:20:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:20:14,346 INFO L471 AbstractCegarLoop]: Abstraction has 4835 states and 7069 transitions. [2025-03-03 18:20:14,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.333333333333336) internal successors, (380), 6 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4835 states and 7069 transitions. [2025-03-03 18:20:14,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-03-03 18:20:14,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:20:14,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:20:14,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 18:20:14,349 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:20:14,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:20:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1230659, now seen corresponding path program 1 times [2025-03-03 18:20:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:20:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146127397] [2025-03-03 18:20:14,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:20:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:20:14,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-03 18:20:16,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-03 18:20:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:20:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:20:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 178 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 18:20:16,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:20:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146127397] [2025-03-03 18:20:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146127397] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:20:16,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135753120] [2025-03-03 18:20:16,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:20:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:20:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:20:16,795 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 18:20:16,796 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 18:20:17,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-03-03 18:20:17,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-03-03 18:20:17,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:20:17,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:20:17,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 18:20:17,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:20:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 171 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:20:18,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:20:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 176 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:20:18,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135753120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:20:18,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:20:18,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10] total 22 [2025-03-03 18:20:18,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902141249] [2025-03-03 18:20:18,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:20:18,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 18:20:18,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:20:18,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 18:20:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:20:18,952 INFO L87 Difference]: Start difference. First operand 4835 states and 7069 transitions. Second operand has 22 states, 22 states have (on average 39.18181818181818) internal successors, (862), 22 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:20:20,494 INFO L93 Difference]: Finished difference Result 8931 states and 13102 transitions. [2025-03-03 18:20:20,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 18:20:20,494 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 39.18181818181818) internal successors, (862), 22 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 395 [2025-03-03 18:20:20,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:20:20,502 INFO L225 Difference]: With dead ends: 8931 [2025-03-03 18:20:20,502 INFO L226 Difference]: Without dead ends: 6549 [2025-03-03 18:20:20,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 815 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=1373, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 18:20:20,505 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 3075 mSDsluCounter, 8479 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3075 SdHoareTripleChecker+Valid, 9487 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:20:20,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3075 Valid, 9487 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3918 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 18:20:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2025-03-03 18:20:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 5142. [2025-03-03 18:20:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5142 states, 5141 states have (on average 1.4604162614277378) internal successors, (7508), 5141 states have internal predecessors, (7508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:20,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5142 states to 5142 states and 7508 transitions. [2025-03-03 18:20:20,555 INFO L78 Accepts]: Start accepts. Automaton has 5142 states and 7508 transitions. Word has length 395 [2025-03-03 18:20:20,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:20:20,555 INFO L471 AbstractCegarLoop]: Abstraction has 5142 states and 7508 transitions. [2025-03-03 18:20:20,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 39.18181818181818) internal successors, (862), 22 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:20:20,555 INFO L276 IsEmpty]: Start isEmpty. Operand 5142 states and 7508 transitions. [2025-03-03 18:20:20,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2025-03-03 18:20:20,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:20:20,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 18:20:20,571 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 18:20:20,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:20:20,759 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:20:20,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:20:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1539775662, now seen corresponding path program 1 times [2025-03-03 18:20:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:20:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355936726] [2025-03-03 18:20:20,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:20:20,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:20:20,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 397 statements into 1 equivalence classes. [2025-03-03 18:20:22,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 397 of 397 statements. [2025-03-03 18:20:22,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:20:22,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat