./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9e75acc5dea77a52694df76103c51840072f3a9cdbcfeb4df332aef49d637e9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:00:20,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:00:20,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:00:20,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:00:20,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:00:20,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:00:20,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:00:20,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:00:20,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:00:20,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:00:20,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:00:20,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:00:20,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:00:20,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:00:20,903 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:00:20,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:00:20,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:00:20,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:00:20,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:00:20,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:20,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:00:20,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:00:20,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:00:20,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:00:20,907 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e75acc5dea77a52694df76103c51840072f3a9cdbcfeb4df332aef49d637e9f [2025-02-08 00:00:21,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:00:21,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:00:21,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:00:21,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:00:21,213 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:00:21,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2025-02-08 00:00:22,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5463225cd/7dfad7eb8c9e44f6bb17ded38d30d54c/FLAGce5db6a30 [2025-02-08 00:00:23,002 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:00:23,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c [2025-02-08 00:00:23,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5463225cd/7dfad7eb8c9e44f6bb17ded38d30d54c/FLAGce5db6a30 [2025-02-08 00:00:23,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5463225cd/7dfad7eb8c9e44f6bb17ded38d30d54c [2025-02-08 00:00:23,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:00:23,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:00:23,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:23,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:00:23,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:00:23,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:23,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635dd45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23, skipping insertion in model container [2025-02-08 00:00:23,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:23,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:00:23,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c[1256,1269] [2025-02-08 00:00:23,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:23,642 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:00:23,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_state_machine.c[1256,1269] [2025-02-08 00:00:23,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:23,781 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:00:23,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23 WrapperNode [2025-02-08 00:00:23,782 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:23,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:23,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:00:23,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:00:23,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:23,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:23,987 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1678 [2025-02-08 00:00:23,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:23,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:00:23,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:00:23,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:00:23,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:23,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,133 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-08 00:00:24,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:00:24,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:00:24,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:00:24,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:00:24,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (1/1) ... [2025-02-08 00:00:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:24,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:00:24,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:00:24,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:00:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:00:24,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:00:24,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:00:24,705 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:00:24,707 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:00:26,557 INFO L? ?]: Removed 1066 outVars from TransFormulas that were not future-live. [2025-02-08 00:00:26,557 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:00:26,664 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:00:26,669 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:00:26,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:26 BoogieIcfgContainer [2025-02-08 00:00:26,672 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:00:26,675 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:00:26,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:00:26,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:00:26,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:00:23" (1/3) ... [2025-02-08 00:00:26,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d65d255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:26, skipping insertion in model container [2025-02-08 00:00:26,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:23" (2/3) ... [2025-02-08 00:00:26,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d65d255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:26, skipping insertion in model container [2025-02-08 00:00:26,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:26" (3/3) ... [2025-02-08 00:00:26,720 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_state_machine.c [2025-02-08 00:00:26,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:00:26,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_state_machine.c that has 1 procedures, 496 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:00:26,837 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:00:26,851 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;@55b66b16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:00:26,853 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:00:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 496 states, 494 states have (on average 1.5) internal successors, (741), 495 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 00:00:26,866 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:26,867 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:26,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:26,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1291783755, now seen corresponding path program 1 times [2025-02-08 00:00:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576321183] [2025-02-08 00:00:26,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:26,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:26,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 00:00:27,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 00:00:27,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:27,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:27,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576321183] [2025-02-08 00:00:27,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576321183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:27,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:27,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:27,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43377166] [2025-02-08 00:00:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:27,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:27,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:27,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:27,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:27,571 INFO L87 Difference]: Start difference. First operand has 496 states, 494 states have (on average 1.5) internal successors, (741), 495 states have internal predecessors, (741), 0 states have call successors, (0), 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 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:28,004 INFO L93 Difference]: Finished difference Result 943 states and 1411 transitions. [2025-02-08 00:00:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:28,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-08 00:00:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:28,021 INFO L225 Difference]: With dead ends: 943 [2025-02-08 00:00:28,022 INFO L226 Difference]: Without dead ends: 496 [2025-02-08 00:00:28,026 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-02-08 00:00:28,032 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:28,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1837 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-02-08 00:00:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-02-08 00:00:28,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.494949494949495) internal successors, (740), 495 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 740 transitions. [2025-02-08 00:00:28,103 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 740 transitions. Word has length 32 [2025-02-08 00:00:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:28,103 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 740 transitions. [2025-02-08 00:00:28,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 740 transitions. [2025-02-08 00:00:28,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 00:00:28,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:28,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:28,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:00:28,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:28,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:28,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1385910842, now seen corresponding path program 1 times [2025-02-08 00:00:28,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:28,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227089814] [2025-02-08 00:00:28,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:28,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:28,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 00:00:28,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 00:00:28,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:28,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:28,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:28,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227089814] [2025-02-08 00:00:28,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227089814] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:28,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:28,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747345448] [2025-02-08 00:00:28,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:28,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:28,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:28,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:28,340 INFO L87 Difference]: Start difference. First operand 496 states and 740 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:28,644 INFO L93 Difference]: Finished difference Result 945 states and 1410 transitions. [2025-02-08 00:00:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:28,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-08 00:00:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:28,647 INFO L225 Difference]: With dead ends: 945 [2025-02-08 00:00:28,647 INFO L226 Difference]: Without dead ends: 498 [2025-02-08 00:00:28,649 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-02-08 00:00:28,649 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 0 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:28,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1834 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-08 00:00:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2025-02-08 00:00:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 497 states have (on average 1.4929577464788732) internal successors, (742), 497 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 742 transitions. [2025-02-08 00:00:28,677 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 742 transitions. Word has length 33 [2025-02-08 00:00:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:28,677 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 742 transitions. [2025-02-08 00:00:28,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 742 transitions. [2025-02-08 00:00:28,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 00:00:28,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:28,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:28,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:00:28,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:28,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1917946832, now seen corresponding path program 1 times [2025-02-08 00:00:28,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:28,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915090763] [2025-02-08 00:00:28,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:28,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:28,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 00:00:28,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 00:00:28,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:28,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915090763] [2025-02-08 00:00:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915090763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:29,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:29,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256865691] [2025-02-08 00:00:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:29,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:29,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:29,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:29,022 INFO L87 Difference]: Start difference. First operand 498 states and 742 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:29,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:29,458 INFO L93 Difference]: Finished difference Result 1354 states and 2019 transitions. [2025-02-08 00:00:29,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:29,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-08 00:00:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:29,463 INFO L225 Difference]: With dead ends: 1354 [2025-02-08 00:00:29,464 INFO L226 Difference]: Without dead ends: 905 [2025-02-08 00:00:29,465 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-02-08 00:00:29,468 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 1927 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1927 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:29,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1927 Valid, 1800 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:29,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-02-08 00:00:29,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 500. [2025-02-08 00:00:29,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.4909819639278556) internal successors, (744), 499 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 744 transitions. [2025-02-08 00:00:29,497 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 744 transitions. Word has length 34 [2025-02-08 00:00:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:29,497 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 744 transitions. [2025-02-08 00:00:29,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 744 transitions. [2025-02-08 00:00:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-08 00:00:29,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:29,512 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:29,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:00:29,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:29,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2009735526, now seen corresponding path program 1 times [2025-02-08 00:00:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:29,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724952989] [2025-02-08 00:00:29,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:29,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-08 00:00:31,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-08 00:00:31,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:31,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:33,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:33,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724952989] [2025-02-08 00:00:33,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724952989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:33,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:33,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:00:33,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030776533] [2025-02-08 00:00:33,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:33,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:00:33,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:33,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:00:33,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:00:33,438 INFO L87 Difference]: Start difference. First operand 500 states and 744 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:34,145 INFO L93 Difference]: Finished difference Result 1338 states and 1994 transitions. [2025-02-08 00:00:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:00:34,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-02-08 00:00:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:34,151 INFO L225 Difference]: With dead ends: 1338 [2025-02-08 00:00:34,151 INFO L226 Difference]: Without dead ends: 889 [2025-02-08 00:00:34,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-02-08 00:00:34,153 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1874 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 3585 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:34,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 3585 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:00:34,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-02-08 00:00:34,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 528. [2025-02-08 00:00:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.4857685009487667) internal successors, (783), 527 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:34,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 783 transitions. [2025-02-08 00:00:34,169 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 783 transitions. Word has length 257 [2025-02-08 00:00:34,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:34,170 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 783 transitions. [2025-02-08 00:00:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 8 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:34,170 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 783 transitions. [2025-02-08 00:00:34,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-08 00:00:34,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:34,174 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:34,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:00:34,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:34,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1250897308, now seen corresponding path program 1 times [2025-02-08 00:00:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:34,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564812930] [2025-02-08 00:00:34,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:34,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-08 00:00:34,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-08 00:00:34,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:34,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:35,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:35,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564812930] [2025-02-08 00:00:35,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564812930] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:35,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:35,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:35,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124424314] [2025-02-08 00:00:35,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:35,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:35,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:35,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:35,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:35,279 INFO L87 Difference]: Start difference. First operand 528 states and 783 transitions. Second operand has 6 states, 6 states have (on average 43.0) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:35,696 INFO L93 Difference]: Finished difference Result 1389 states and 2069 transitions. [2025-02-08 00:00:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:35,697 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-02-08 00:00:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:35,702 INFO L225 Difference]: With dead ends: 1389 [2025-02-08 00:00:35,702 INFO L226 Difference]: Without dead ends: 940 [2025-02-08 00:00:35,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:35,704 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2606 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2606 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:35,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2606 Valid, 1794 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-02-08 00:00:35,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 535. [2025-02-08 00:00:35,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 1.4812734082397003) internal successors, (791), 534 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 791 transitions. [2025-02-08 00:00:35,729 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 791 transitions. Word has length 258 [2025-02-08 00:00:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:35,730 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 791 transitions. [2025-02-08 00:00:35,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.0) internal successors, (258), 5 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,730 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 791 transitions. [2025-02-08 00:00:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-08 00:00:35,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:35,734 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:35,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:00:35,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:35,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:35,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1648433257, now seen corresponding path program 1 times [2025-02-08 00:00:35,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:35,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605290066] [2025-02-08 00:00:35,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:35,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:35,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-08 00:00:37,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-08 00:00:37,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:37,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:37,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:37,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605290066] [2025-02-08 00:00:37,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605290066] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:37,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:37,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:00:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482226408] [2025-02-08 00:00:37,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:37,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:00:37,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:37,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:00:37,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:37,851 INFO L87 Difference]: Start difference. First operand 535 states and 791 transitions. Second operand has 8 states, 8 states have (on average 32.25) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:38,523 INFO L93 Difference]: Finished difference Result 1354 states and 2012 transitions. [2025-02-08 00:00:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:00:38,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2025-02-08 00:00:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:38,528 INFO L225 Difference]: With dead ends: 1354 [2025-02-08 00:00:38,528 INFO L226 Difference]: Without dead ends: 889 [2025-02-08 00:00:38,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:00:38,530 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1884 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 3586 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:38,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 3586 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:00:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-02-08 00:00:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 528. [2025-02-08 00:00:38,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.4800759013282732) internal successors, (780), 527 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 780 transitions. [2025-02-08 00:00:38,557 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 780 transitions. Word has length 258 [2025-02-08 00:00:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:38,558 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 780 transitions. [2025-02-08 00:00:38,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 780 transitions. [2025-02-08 00:00:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-02-08 00:00:38,561 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:38,562 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:38,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:00:38,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:38,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 174893289, now seen corresponding path program 1 times [2025-02-08 00:00:38,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:38,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491308922] [2025-02-08 00:00:38,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:38,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:38,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-02-08 00:00:39,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-02-08 00:00:39,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:39,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:41,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:41,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491308922] [2025-02-08 00:00:41,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491308922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:41,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:41,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912393262] [2025-02-08 00:00:41,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:41,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:41,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:41,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:41,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:41,298 INFO L87 Difference]: Start difference. First operand 528 states and 780 transitions. Second operand has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:41,762 INFO L93 Difference]: Finished difference Result 1322 states and 1966 transitions. [2025-02-08 00:00:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:41,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-02-08 00:00:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:41,768 INFO L225 Difference]: With dead ends: 1322 [2025-02-08 00:00:41,768 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:41,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:41,770 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 2260 mSDsluCounter, 1171 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:41,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 1758 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 694. [2025-02-08 00:00:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.4834054834054835) internal successors, (1028), 693 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1028 transitions. [2025-02-08 00:00:41,793 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1028 transitions. Word has length 259 [2025-02-08 00:00:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:41,794 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1028 transitions. [2025-02-08 00:00:41,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.166666666666664) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:41,795 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1028 transitions. [2025-02-08 00:00:41,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-02-08 00:00:41,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:41,799 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:41,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:00:41,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:41,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:41,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1108463220, now seen corresponding path program 1 times [2025-02-08 00:00:41,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:41,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823745510] [2025-02-08 00:00:41,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:41,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:41,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-02-08 00:00:42,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-02-08 00:00:42,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:42,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:43,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823745510] [2025-02-08 00:00:43,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823745510] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:43,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:43,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:43,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040498110] [2025-02-08 00:00:43,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:43,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:43,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:43,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:43,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:43,653 INFO L87 Difference]: Start difference. First operand 694 states and 1028 transitions. Second operand has 5 states, 5 states have (on average 52.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:44,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:44,064 INFO L93 Difference]: Finished difference Result 1424 states and 2117 transitions. [2025-02-08 00:00:44,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:44,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 260 [2025-02-08 00:00:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:44,070 INFO L225 Difference]: With dead ends: 1424 [2025-02-08 00:00:44,070 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:44,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-08 00:00:44,072 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1767 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:44,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 1793 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:44,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 694. [2025-02-08 00:00:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.4805194805194806) internal successors, (1026), 693 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1026 transitions. [2025-02-08 00:00:44,094 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1026 transitions. Word has length 260 [2025-02-08 00:00:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:44,095 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1026 transitions. [2025-02-08 00:00:44,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1026 transitions. [2025-02-08 00:00:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-02-08 00:00:44,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:44,100 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:44,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:00:44,100 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:44,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1319496281, now seen corresponding path program 1 times [2025-02-08 00:00:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:44,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060225304] [2025-02-08 00:00:44,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:44,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:44,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 00:00:45,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 00:00:45,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:45,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:45,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:45,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060225304] [2025-02-08 00:00:45,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060225304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:45,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398674779] [2025-02-08 00:00:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:45,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:45,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:45,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:45,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:45,927 INFO L87 Difference]: Start difference. First operand 694 states and 1026 transitions. Second operand has 5 states, 5 states have (on average 52.4) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:46,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:46,360 INFO L93 Difference]: Finished difference Result 1356 states and 2013 transitions. [2025-02-08 00:00:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:46,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-02-08 00:00:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:46,364 INFO L225 Difference]: With dead ends: 1356 [2025-02-08 00:00:46,365 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:46,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-08 00:00:46,368 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1729 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:46,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1792 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:46,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 694. [2025-02-08 00:00:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 693 states have (on average 1.479076479076479) internal successors, (1025), 693 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1025 transitions. [2025-02-08 00:00:46,387 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1025 transitions. Word has length 262 [2025-02-08 00:00:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 1025 transitions. [2025-02-08 00:00:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 4 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1025 transitions. [2025-02-08 00:00:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-02-08 00:00:46,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:46,392 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:46,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:00:46,392 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:46,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1862517289, now seen corresponding path program 1 times [2025-02-08 00:00:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033118949] [2025-02-08 00:00:46,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:46,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 00:00:47,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 00:00:47,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:47,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:48,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:48,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033118949] [2025-02-08 00:00:48,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033118949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963920477] [2025-02-08 00:00:48,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:48,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:48,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:48,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:48,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:48,445 INFO L87 Difference]: Start difference. First operand 694 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:48,895 INFO L93 Difference]: Finished difference Result 1322 states and 1962 transitions. [2025-02-08 00:00:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2025-02-08 00:00:48,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:48,900 INFO L225 Difference]: With dead ends: 1322 [2025-02-08 00:00:48,900 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:48,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:48,902 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2244 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2244 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:48,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2244 Valid, 1793 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:48,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 695. [2025-02-08 00:00:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.478386167146974) internal successors, (1026), 694 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1026 transitions. [2025-02-08 00:00:48,921 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1026 transitions. Word has length 263 [2025-02-08 00:00:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:48,921 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1026 transitions. [2025-02-08 00:00:48,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 5 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1026 transitions. [2025-02-08 00:00:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-02-08 00:00:48,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:48,925 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:48,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:00:48,926 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:48,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1408851482, now seen corresponding path program 1 times [2025-02-08 00:00:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:48,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964673846] [2025-02-08 00:00:48,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:48,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:49,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-02-08 00:00:50,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-02-08 00:00:50,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:50,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:51,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964673846] [2025-02-08 00:00:51,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964673846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:51,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:51,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 00:00:51,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823819146] [2025-02-08 00:00:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:51,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 00:00:51,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:51,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 00:00:51,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:51,211 INFO L87 Difference]: Start difference. First operand 695 states and 1026 transitions. Second operand has 11 states, 11 states have (on average 24.0) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:52,211 INFO L93 Difference]: Finished difference Result 1485 states and 2201 transitions. [2025-02-08 00:00:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:00:52,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 24.0) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2025-02-08 00:00:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:52,216 INFO L225 Difference]: With dead ends: 1485 [2025-02-08 00:00:52,216 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:52,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-02-08 00:00:52,218 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1805 mSDsluCounter, 4086 mSDsCounter, 0 mSdLazyCounter, 1231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 4672 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:52,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1805 Valid, 4672 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1231 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:00:52,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 695. [2025-02-08 00:00:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 694 states have (on average 1.4769452449567724) internal successors, (1025), 694 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1025 transitions. [2025-02-08 00:00:52,237 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1025 transitions. Word has length 264 [2025-02-08 00:00:52,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:52,238 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1025 transitions. [2025-02-08 00:00:52,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.0) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1025 transitions. [2025-02-08 00:00:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-02-08 00:00:52,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:52,243 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:52,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:00:52,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:52,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1569961296, now seen corresponding path program 1 times [2025-02-08 00:00:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:52,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948025159] [2025-02-08 00:00:52,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:52,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-02-08 00:00:53,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-02-08 00:00:53,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:53,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948025159] [2025-02-08 00:00:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948025159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:54,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:54,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:54,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214574678] [2025-02-08 00:00:54,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:54,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:54,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:54,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:54,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:54,095 INFO L87 Difference]: Start difference. First operand 695 states and 1025 transitions. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:54,521 INFO L93 Difference]: Finished difference Result 1322 states and 1960 transitions. [2025-02-08 00:00:54,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:54,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2025-02-08 00:00:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:54,526 INFO L225 Difference]: With dead ends: 1322 [2025-02-08 00:00:54,526 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:54,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-08 00:00:54,528 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1665 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:54,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 1792 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:54,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 766. [2025-02-08 00:00:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 765 states have (on average 1.477124183006536) internal successors, (1130), 765 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1130 transitions. [2025-02-08 00:00:54,546 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1130 transitions. Word has length 265 [2025-02-08 00:00:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:54,547 INFO L471 AbstractCegarLoop]: Abstraction has 766 states and 1130 transitions. [2025-02-08 00:00:54,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1130 transitions. [2025-02-08 00:00:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-08 00:00:54,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:54,551 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:54,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:00:54,551 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2095564513, now seen corresponding path program 1 times [2025-02-08 00:00:54,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454949920] [2025-02-08 00:00:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:54,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-08 00:00:55,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-08 00:00:55,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:55,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:55,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454949920] [2025-02-08 00:00:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454949920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920907357] [2025-02-08 00:00:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:55,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:55,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:55,924 INFO L87 Difference]: Start difference. First operand 766 states and 1130 transitions. Second operand has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:56,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:56,458 INFO L93 Difference]: Finished difference Result 1386 states and 2055 transitions. [2025-02-08 00:00:56,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:56,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2025-02-08 00:00:56,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:56,463 INFO L225 Difference]: With dead ends: 1386 [2025-02-08 00:00:56,463 INFO L226 Difference]: Without dead ends: 937 [2025-02-08 00:00:56,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-02-08 00:00:56,465 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1853 mSDsluCounter, 2220 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1853 SdHoareTripleChecker+Valid, 2816 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:56,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1853 Valid, 2816 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:00:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-08 00:00:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 769. [2025-02-08 00:00:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 768 states have (on average 1.4765625) internal successors, (1134), 768 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1134 transitions. [2025-02-08 00:00:56,483 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1134 transitions. Word has length 266 [2025-02-08 00:00:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:56,485 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1134 transitions. [2025-02-08 00:00:56,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.0) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1134 transitions. [2025-02-08 00:00:56,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-08 00:00:56,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:56,487 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:56,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:00:56,488 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:56,489 INFO L85 PathProgramCache]: Analyzing trace with hash -82809483, now seen corresponding path program 1 times [2025-02-08 00:00:56,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:56,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983936553] [2025-02-08 00:00:56,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:56,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:56,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-08 00:00:57,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-08 00:00:57,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:57,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983936553] [2025-02-08 00:00:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983936553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:57,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:57,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:57,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625138365] [2025-02-08 00:00:57,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:57,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:57,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:57,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:57,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:57,972 INFO L87 Difference]: Start difference. First operand 769 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:58,421 INFO L93 Difference]: Finished difference Result 1324 states and 1961 transitions. [2025-02-08 00:00:58,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2025-02-08 00:00:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:58,425 INFO L225 Difference]: With dead ends: 1324 [2025-02-08 00:00:58,425 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:00:58,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:58,427 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1796 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 2392 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.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:58,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 2392 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:00:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:00:58,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-02-08 00:00:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4765013054830287) internal successors, (1131), 766 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1131 transitions. [2025-02-08 00:00:58,445 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1131 transitions. Word has length 267 [2025-02-08 00:00:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:58,445 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1131 transitions. [2025-02-08 00:00:58,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1131 transitions. [2025-02-08 00:00:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-02-08 00:00:58,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:58,447 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:58,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:00:58,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:58,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash 908195603, now seen corresponding path program 1 times [2025-02-08 00:00:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:58,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340978298] [2025-02-08 00:00:58,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:58,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-02-08 00:00:59,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-02-08 00:00:59,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340978298] [2025-02-08 00:00:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340978298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:59,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:59,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856028840] [2025-02-08 00:00:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:59,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:59,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:59,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:59,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:59,790 INFO L87 Difference]: Start difference. First operand 767 states and 1131 transitions. Second operand has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:00,256 INFO L93 Difference]: Finished difference Result 1429 states and 2115 transitions. [2025-02-08 00:01:00,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:00,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 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 267 [2025-02-08 00:01:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:00,260 INFO L225 Difference]: With dead ends: 1429 [2025-02-08 00:01:00,260 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:01:00,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:00,261 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1794 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 2392 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.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:00,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1794 Valid, 2392 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:00,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:01:00,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-02-08 00:01:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.475195822454308) internal successors, (1130), 766 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1130 transitions. [2025-02-08 00:01:00,275 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1130 transitions. Word has length 267 [2025-02-08 00:01:00,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:00,275 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1130 transitions. [2025-02-08 00:01:00,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.5) internal successors, (267), 5 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1130 transitions. [2025-02-08 00:01:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-08 00:01:00,278 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:00,278 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:00,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:01:00,278 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:00,279 INFO L85 PathProgramCache]: Analyzing trace with hash -100406976, now seen corresponding path program 1 times [2025-02-08 00:01:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702770402] [2025-02-08 00:01:00,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:00,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:00,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-08 00:01:01,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-08 00:01:01,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:01,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:02,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:02,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702770402] [2025-02-08 00:01:02,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702770402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:02,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:02,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:01:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037731196] [2025-02-08 00:01:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:02,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:02,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:02,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:02,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:02,276 INFO L87 Difference]: Start difference. First operand 767 states and 1130 transitions. Second operand has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:02,674 INFO L93 Difference]: Finished difference Result 1357 states and 2008 transitions. [2025-02-08 00:01:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-02-08 00:01:02,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:02,678 INFO L225 Difference]: With dead ends: 1357 [2025-02-08 00:01:02,678 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:01:02,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:02,681 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1793 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:02,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2391 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:02,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:01:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-02-08 00:01:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4738903394255876) internal successors, (1129), 766 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1129 transitions. [2025-02-08 00:01:02,697 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1129 transitions. Word has length 268 [2025-02-08 00:01:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:02,697 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1129 transitions. [2025-02-08 00:01:02,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.666666666666664) internal successors, (268), 5 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1129 transitions. [2025-02-08 00:01:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-02-08 00:01:02,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:02,699 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:01:02,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 484688296, now seen corresponding path program 1 times [2025-02-08 00:01:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529590864] [2025-02-08 00:01:02,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:02,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:02,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-08 00:01:03,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 00:01:03,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:03,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:04,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:04,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:04,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529590864] [2025-02-08 00:01:04,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529590864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:04,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:04,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:01:04,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818091109] [2025-02-08 00:01:04,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:04,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:04,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:04,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:04,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:04,049 INFO L87 Difference]: Start difference. First operand 767 states and 1129 transitions. Second operand has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:04,434 INFO L93 Difference]: Finished difference Result 1357 states and 2007 transitions. [2025-02-08 00:01:04,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:04,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 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 269 [2025-02-08 00:01:04,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:04,437 INFO L225 Difference]: With dead ends: 1357 [2025-02-08 00:01:04,437 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:01:04,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:04,438 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2204 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 1793 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:04,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 1793 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:01:04,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 767. [2025-02-08 00:01:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4725848563968669) internal successors, (1128), 766 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1128 transitions. [2025-02-08 00:01:04,451 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1128 transitions. Word has length 269 [2025-02-08 00:01:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:04,451 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1128 transitions. [2025-02-08 00:01:04,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.833333333333336) internal successors, (269), 5 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1128 transitions. [2025-02-08 00:01:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2025-02-08 00:01:04,453 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:04,453 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:04,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 00:01:04,454 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:04,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1357571006, now seen corresponding path program 1 times [2025-02-08 00:01:04,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:04,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995524444] [2025-02-08 00:01:04,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:04,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 270 statements into 1 equivalence classes. [2025-02-08 00:01:05,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 270 of 270 statements. [2025-02-08 00:01:05,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:05,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:06,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:06,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995524444] [2025-02-08 00:01:06,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995524444] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:06,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:06,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:01:06,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362351657] [2025-02-08 00:01:06,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:06,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:01:06,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:06,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:01:06,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:01:06,029 INFO L87 Difference]: Start difference. First operand 767 states and 1128 transitions. Second operand has 5 states, 5 states have (on average 54.0) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:06,420 INFO L93 Difference]: Finished difference Result 1641 states and 2419 transitions. [2025-02-08 00:01:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:06,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 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 270 [2025-02-08 00:01:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:06,424 INFO L225 Difference]: With dead ends: 1641 [2025-02-08 00:01:06,424 INFO L226 Difference]: Without dead ends: 933 [2025-02-08 00:01:06,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-08 00:01:06,426 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 1975 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:06,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 1797 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-08 00:01:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 767. [2025-02-08 00:01:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4712793733681462) internal successors, (1127), 766 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:06,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1127 transitions. [2025-02-08 00:01:06,443 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1127 transitions. Word has length 270 [2025-02-08 00:01:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:06,444 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1127 transitions. [2025-02-08 00:01:06,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.0) internal successors, (270), 4 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1127 transitions. [2025-02-08 00:01:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-08 00:01:06,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:06,447 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:06,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:01:06,447 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:06,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:06,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1294475407, now seen corresponding path program 1 times [2025-02-08 00:01:06,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541016391] [2025-02-08 00:01:06,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:06,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:06,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-08 00:01:07,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-08 00:01:07,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:07,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:07,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541016391] [2025-02-08 00:01:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541016391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:01:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722742302] [2025-02-08 00:01:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:07,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:01:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:07,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:01:07,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:01:07,761 INFO L87 Difference]: Start difference. First operand 767 states and 1127 transitions. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:08,039 INFO L93 Difference]: Finished difference Result 1641 states and 2418 transitions. [2025-02-08 00:01:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:08,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-02-08 00:01:08,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:08,042 INFO L225 Difference]: With dead ends: 1641 [2025-02-08 00:01:08,042 INFO L226 Difference]: Without dead ends: 933 [2025-02-08 00:01:08,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:08,043 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1340 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:08,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1807 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-02-08 00:01:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 767. [2025-02-08 00:01:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.4699738903394255) internal successors, (1126), 766 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1126 transitions. [2025-02-08 00:01:08,054 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1126 transitions. Word has length 271 [2025-02-08 00:01:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:08,054 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1126 transitions. [2025-02-08 00:01:08,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 4 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1126 transitions. [2025-02-08 00:01:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-02-08 00:01:08,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:08,057 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 00:01:08,058 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:08,059 INFO L85 PathProgramCache]: Analyzing trace with hash 547310605, now seen corresponding path program 1 times [2025-02-08 00:01:08,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:08,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917005395] [2025-02-08 00:01:08,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:08,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:08,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-02-08 00:01:09,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-02-08 00:01:09,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:09,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:09,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:09,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:09,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917005395] [2025-02-08 00:01:09,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917005395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:09,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:09,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:01:09,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20984991] [2025-02-08 00:01:09,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:09,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:09,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:09,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:09,753 INFO L87 Difference]: Start difference. First operand 767 states and 1126 transitions. Second operand has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:10,094 INFO L93 Difference]: Finished difference Result 1322 states and 1953 transitions. [2025-02-08 00:01:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:10,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-02-08 00:01:10,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:10,098 INFO L225 Difference]: With dead ends: 1322 [2025-02-08 00:01:10,098 INFO L226 Difference]: Without dead ends: 873 [2025-02-08 00:01:10,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:10,100 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1783 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:10,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 2391 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-08 00:01:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 802. [2025-02-08 00:01:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 1.4694132334581773) internal successors, (1177), 801 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1177 transitions. [2025-02-08 00:01:10,111 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1177 transitions. Word has length 272 [2025-02-08 00:01:10,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:10,111 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1177 transitions. [2025-02-08 00:01:10,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.333333333333336) internal successors, (272), 5 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1177 transitions. [2025-02-08 00:01:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-08 00:01:10,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:10,113 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:10,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:01:10,114 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 118802287, now seen corresponding path program 1 times [2025-02-08 00:01:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:10,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509366900] [2025-02-08 00:01:10,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:10,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-08 00:01:10,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-08 00:01:10,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509366900] [2025-02-08 00:01:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509366900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:11,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:01:11,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078550895] [2025-02-08 00:01:11,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:11,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:01:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:11,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:01:11,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:01:11,253 INFO L87 Difference]: Start difference. First operand 802 states and 1177 transitions. Second operand has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:11,649 INFO L93 Difference]: Finished difference Result 1386 states and 2048 transitions. [2025-02-08 00:01:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:01:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-02-08 00:01:11,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:11,654 INFO L225 Difference]: With dead ends: 1386 [2025-02-08 00:01:11,654 INFO L226 Difference]: Without dead ends: 937 [2025-02-08 00:01:11,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-02-08 00:01:11,656 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1813 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 2976 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:11,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 2976 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-08 00:01:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 805. [2025-02-08 00:01:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 804 states have (on average 1.4689054726368158) internal successors, (1181), 804 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1181 transitions. [2025-02-08 00:01:11,673 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1181 transitions. Word has length 273 [2025-02-08 00:01:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:11,674 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1181 transitions. [2025-02-08 00:01:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.0) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1181 transitions. [2025-02-08 00:01:11,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-08 00:01:11,677 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:11,677 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:11,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:01:11,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:11,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:11,679 INFO L85 PathProgramCache]: Analyzing trace with hash -367432238, now seen corresponding path program 1 times [2025-02-08 00:01:11,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:11,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407173900] [2025-02-08 00:01:11,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:11,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:11,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-08 00:01:12,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-08 00:01:12,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:12,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:13,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407173900] [2025-02-08 00:01:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407173900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:13,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:01:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192654452] [2025-02-08 00:01:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:13,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:01:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:13,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:01:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:01:13,145 INFO L87 Difference]: Start difference. First operand 805 states and 1181 transitions. Second operand has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:13,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:13,532 INFO L93 Difference]: Finished difference Result 1336 states and 1972 transitions. [2025-02-08 00:01:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:01:13,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-08 00:01:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:13,536 INFO L225 Difference]: With dead ends: 1336 [2025-02-08 00:01:13,536 INFO L226 Difference]: Without dead ends: 887 [2025-02-08 00:01:13,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-02-08 00:01:13,541 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1654 mSDsluCounter, 2384 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1654 SdHoareTripleChecker+Valid, 2982 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:13,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1654 Valid, 2982 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2025-02-08 00:01:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 811. [2025-02-08 00:01:13,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 810 states have (on average 1.4679012345679012) internal successors, (1189), 810 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1189 transitions. [2025-02-08 00:01:13,554 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1189 transitions. Word has length 274 [2025-02-08 00:01:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:13,555 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1189 transitions. [2025-02-08 00:01:13,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.142857142857146) internal successors, (274), 6 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:13,555 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1189 transitions. [2025-02-08 00:01:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-02-08 00:01:13,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:13,557 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:13,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:01:13,557 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1873461464, now seen corresponding path program 1 times [2025-02-08 00:01:13,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:13,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930185596] [2025-02-08 00:01:13,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-02-08 00:01:14,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-02-08 00:01:14,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930185596] [2025-02-08 00:01:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930185596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:15,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:15,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:01:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198134458] [2025-02-08 00:01:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:15,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:15,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:15,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:15,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:15,333 INFO L87 Difference]: Start difference. First operand 811 states and 1189 transitions. Second operand has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:15,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:15,624 INFO L93 Difference]: Finished difference Result 1326 states and 1956 transitions. [2025-02-08 00:01:15,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:15,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 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 274 [2025-02-08 00:01:15,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:15,627 INFO L225 Difference]: With dead ends: 1326 [2025-02-08 00:01:15,627 INFO L226 Difference]: Without dead ends: 877 [2025-02-08 00:01:15,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:15,628 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 2129 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:15,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 1792 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-02-08 00:01:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 842. [2025-02-08 00:01:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 1.4673008323424495) internal successors, (1234), 841 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1234 transitions. [2025-02-08 00:01:15,639 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1234 transitions. Word has length 274 [2025-02-08 00:01:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:15,640 INFO L471 AbstractCegarLoop]: Abstraction has 842 states and 1234 transitions. [2025-02-08 00:01:15,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.666666666666664) internal successors, (274), 5 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1234 transitions. [2025-02-08 00:01:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-08 00:01:15,641 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:15,642 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:15,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:01:15,642 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:15,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1063037617, now seen corresponding path program 1 times [2025-02-08 00:01:15,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:15,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893177792] [2025-02-08 00:01:15,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:15,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:15,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-08 00:01:16,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-08 00:01:16,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:16,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:17,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:17,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893177792] [2025-02-08 00:01:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893177792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:17,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:01:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109367285] [2025-02-08 00:01:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:01:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:17,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:01:17,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:17,349 INFO L87 Difference]: Start difference. First operand 842 states and 1234 transitions. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:17,938 INFO L93 Difference]: Finished difference Result 1390 states and 2051 transitions. [2025-02-08 00:01:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:01:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-02-08 00:01:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:17,941 INFO L225 Difference]: With dead ends: 1390 [2025-02-08 00:01:17,941 INFO L226 Difference]: Without dead ends: 941 [2025-02-08 00:01:17,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:01:17,942 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1957 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 3576 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:17,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1957 Valid, 3576 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:01:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2025-02-08 00:01:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 845. [2025-02-08 00:01:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.466824644549763) internal successors, (1238), 844 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1238 transitions. [2025-02-08 00:01:17,953 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1238 transitions. Word has length 275 [2025-02-08 00:01:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1238 transitions. [2025-02-08 00:01:17,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 7 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1238 transitions. [2025-02-08 00:01:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-08 00:01:17,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:17,956 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:17,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:01:17,956 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:17,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:17,957 INFO L85 PathProgramCache]: Analyzing trace with hash -2109966147, now seen corresponding path program 1 times [2025-02-08 00:01:17,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:17,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857983687] [2025-02-08 00:01:17,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-08 00:01:18,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-08 00:01:18,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:18,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:19,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:19,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:19,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857983687] [2025-02-08 00:01:19,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857983687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:19,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:19,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:01:19,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564253593] [2025-02-08 00:01:19,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:19,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:01:19,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:19,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:01:19,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:19,701 INFO L87 Difference]: Start difference. First operand 845 states and 1238 transitions. Second operand has 8 states, 8 states have (on average 34.5) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:20,161 INFO L93 Difference]: Finished difference Result 1340 states and 1975 transitions. [2025-02-08 00:01:20,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:01:20,162 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-08 00:01:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:20,165 INFO L225 Difference]: With dead ends: 1340 [2025-02-08 00:01:20,165 INFO L226 Difference]: Without dead ends: 891 [2025-02-08 00:01:20,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:01:20,167 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1259 mSDsluCounter, 2985 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 3583 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:20,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 3583 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-02-08 00:01:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 851. [2025-02-08 00:01:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.4658823529411764) internal successors, (1246), 850 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1246 transitions. [2025-02-08 00:01:20,179 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1246 transitions. Word has length 276 [2025-02-08 00:01:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:20,179 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1246 transitions. [2025-02-08 00:01:20,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.5) internal successors, (276), 7 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1246 transitions. [2025-02-08 00:01:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-08 00:01:20,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:20,182 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:20,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 00:01:20,182 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:20,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1043080615, now seen corresponding path program 1 times [2025-02-08 00:01:20,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:20,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767457296] [2025-02-08 00:01:20,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:20,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-08 00:01:20,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-08 00:01:20,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:20,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767457296] [2025-02-08 00:01:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767457296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:21,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:21,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:01:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216822293] [2025-02-08 00:01:21,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:01:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:21,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:01:21,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:01:21,356 INFO L87 Difference]: Start difference. First operand 851 states and 1246 transitions. Second operand has 5 states, 5 states have (on average 55.2) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:21,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:21,637 INFO L93 Difference]: Finished difference Result 1333 states and 1964 transitions. [2025-02-08 00:01:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-02-08 00:01:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:21,640 INFO L225 Difference]: With dead ends: 1333 [2025-02-08 00:01:21,640 INFO L226 Difference]: Without dead ends: 884 [2025-02-08 00:01:21,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-08 00:01:21,641 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1588 mSDsluCounter, 1191 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1588 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:21,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1588 Valid, 1789 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:01:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-02-08 00:01:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 882. [2025-02-08 00:01:21,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 1.4653802497162316) internal successors, (1291), 881 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1291 transitions. [2025-02-08 00:01:21,650 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1291 transitions. Word has length 276 [2025-02-08 00:01:21,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:21,651 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1291 transitions. [2025-02-08 00:01:21,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.2) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:21,651 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1291 transitions. [2025-02-08 00:01:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-02-08 00:01:21,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:21,652 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:21,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 00:01:21,652 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:21,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:21,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1494343599, now seen corresponding path program 1 times [2025-02-08 00:01:21,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:21,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289159519] [2025-02-08 00:01:21,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:21,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-02-08 00:01:22,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-02-08 00:01:22,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:22,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:23,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289159519] [2025-02-08 00:01:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289159519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:01:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368754901] [2025-02-08 00:01:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:23,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:01:23,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:23,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:01:23,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:23,456 INFO L87 Difference]: Start difference. First operand 882 states and 1291 transitions. Second operand has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:23,863 INFO L93 Difference]: Finished difference Result 1394 states and 2054 transitions. [2025-02-08 00:01:23,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:01:23,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2025-02-08 00:01:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:23,865 INFO L225 Difference]: With dead ends: 1394 [2025-02-08 00:01:23,865 INFO L226 Difference]: Without dead ends: 945 [2025-02-08 00:01:23,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:01:23,866 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2374 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:23,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 2798 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-02-08 00:01:23,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 885. [2025-02-08 00:01:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4649321266968325) internal successors, (1295), 884 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1295 transitions. [2025-02-08 00:01:23,878 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1295 transitions. Word has length 277 [2025-02-08 00:01:23,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:23,878 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1295 transitions. [2025-02-08 00:01:23,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.625) internal successors, (277), 7 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,878 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1295 transitions. [2025-02-08 00:01:23,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-08 00:01:23,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:23,879 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:23,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 00:01:23,880 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:23,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash 127990444, now seen corresponding path program 1 times [2025-02-08 00:01:23,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:23,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808878934] [2025-02-08 00:01:23,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:23,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:23,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-08 00:01:24,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-08 00:01:24,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:24,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:25,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808878934] [2025-02-08 00:01:25,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808878934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:25,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:25,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:01:25,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352829966] [2025-02-08 00:01:25,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:25,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:01:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:25,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:01:25,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:01:25,083 INFO L87 Difference]: Start difference. First operand 885 states and 1295 transitions. Second operand has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:25,490 INFO L93 Difference]: Finished difference Result 1344 states and 1978 transitions. [2025-02-08 00:01:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:01:25,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-02-08 00:01:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:25,493 INFO L225 Difference]: With dead ends: 1344 [2025-02-08 00:01:25,493 INFO L226 Difference]: Without dead ends: 895 [2025-02-08 00:01:25,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-02-08 00:01:25,494 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 1605 mSDsluCounter, 2381 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:25,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 2979 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-02-08 00:01:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 891. [2025-02-08 00:01:25,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.4640449438202248) internal successors, (1303), 890 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1303 transitions. [2025-02-08 00:01:25,505 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1303 transitions. Word has length 278 [2025-02-08 00:01:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:25,505 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1303 transitions. [2025-02-08 00:01:25,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.714285714285715) internal successors, (278), 6 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:25,505 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1303 transitions. [2025-02-08 00:01:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-08 00:01:25,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:25,507 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:25,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 00:01:25,508 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:25,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 450720252, now seen corresponding path program 1 times [2025-02-08 00:01:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:25,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92839626] [2025-02-08 00:01:25,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:25,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:25,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-08 00:01:26,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-08 00:01:26,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:26,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92839626] [2025-02-08 00:01:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92839626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:01:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41883594] [2025-02-08 00:01:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:27,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:01:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:27,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:01:27,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:27,466 INFO L87 Difference]: Start difference. First operand 891 states and 1303 transitions. Second operand has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:27,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:27,899 INFO L93 Difference]: Finished difference Result 1749 states and 2566 transitions. [2025-02-08 00:01:27,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:27,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-02-08 00:01:27,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:27,903 INFO L225 Difference]: With dead ends: 1749 [2025-02-08 00:01:27,903 INFO L226 Difference]: Without dead ends: 945 [2025-02-08 00:01:27,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:01:27,905 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2554 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:27,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2554 Valid, 1798 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2025-02-08 00:01:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 891. [2025-02-08 00:01:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.4617977528089887) internal successors, (1301), 890 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1301 transitions. [2025-02-08 00:01:27,922 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1301 transitions. Word has length 278 [2025-02-08 00:01:27,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:27,922 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1301 transitions. [2025-02-08 00:01:27,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.333333333333336) internal successors, (278), 5 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1301 transitions. [2025-02-08 00:01:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-02-08 00:01:27,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:27,924 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:27,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 00:01:27,924 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:27,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -797967916, now seen corresponding path program 1 times [2025-02-08 00:01:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462972039] [2025-02-08 00:01:27,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:27,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:27,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-08 00:01:29,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-08 00:01:29,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat