./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem06_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/eca-rers2012/Problem06_label12.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3c3dbbc31a7259c4d799bc77685e2e779742dea8e05ba402c7ff85d4793c53b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:13:01,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:13:01,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:13:01,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:13:01,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:13:01,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:13:01,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:13:01,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:13:01,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:13:01,186 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:13:01,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:13:01,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:13:01,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:13:01,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:13:01,187 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:13:01,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:13:01,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:13:01,188 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:13:01,188 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:13:01,189 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:13:01,189 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:13:01,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3c3dbbc31a7259c4d799bc77685e2e779742dea8e05ba402c7ff85d4793c53b [2025-01-08 23:13:01,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:13:01,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:13:01,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:13:01,411 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:13:01,411 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:13:01,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem06_label12.c [2025-01-08 23:13:02,557 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9b3abfd3/fc82fa429589409ca6b30eef467b310f/FLAG22c362a2f [2025-01-08 23:13:03,080 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:13:03,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem06_label12.c [2025-01-08 23:13:03,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9b3abfd3/fc82fa429589409ca6b30eef467b310f/FLAG22c362a2f [2025-01-08 23:13:03,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c9b3abfd3/fc82fa429589409ca6b30eef467b310f [2025-01-08 23:13:03,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:13:03,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:13:03,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:13:03,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:13:03,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:13:03,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:13:03" (1/1) ... [2025-01-08 23:13:03,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:03, skipping insertion in model container [2025-01-08 23:13:03,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:13:03" (1/1) ... [2025-01-08 23:13:03,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:13:04,069 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/eca-rers2012/Problem06_label12.c[330310,330323] [2025-01-08 23:13:04,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:13:04,101 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:13:04,538 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/eca-rers2012/Problem06_label12.c[330310,330323] [2025-01-08 23:13:04,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:13:04,579 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:13:04,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04 WrapperNode [2025-01-08 23:13:04,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:13:04,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:13:04,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:13:04,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:13:04,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:04,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:04,876 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 10175 [2025-01-08 23:13:04,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:13:04,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:13:04,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:13:04,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:13:04,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:04,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:04,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,007 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-01-08 23:13:05,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:13:05,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:13:05,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:13:05,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:13:05,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (1/1) ... [2025-01-08 23:13:05,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:13:05,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:13:05,286 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-01-08 23:13:05,289 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-01-08 23:13:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:13:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:13:05,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:13:05,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:13:05,384 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:13:05,385 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:13:10,480 INFO L? ?]: Removed 929 outVars from TransFormulas that were not future-live. [2025-01-08 23:13:10,480 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:13:10,517 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:13:10,518 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:13:10,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:13:10 BoogieIcfgContainer [2025-01-08 23:13:10,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:13:10,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:13:10,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:13:10,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:13:10,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:13:03" (1/3) ... [2025-01-08 23:13:10,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c9b0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:13:10, skipping insertion in model container [2025-01-08 23:13:10,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:13:04" (2/3) ... [2025-01-08 23:13:10,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c9b0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:13:10, skipping insertion in model container [2025-01-08 23:13:10,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:13:10" (3/3) ... [2025-01-08 23:13:10,526 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem06_label12.c [2025-01-08 23:13:10,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:13:10,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem06_label12.c that has 1 procedures, 1290 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:13:10,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:13:10,606 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;@4a64375, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:13:10,607 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:13:10,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 1290 states, 1288 states have (on average 1.8563664596273293) internal successors, (2391), 1289 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2025-01-08 23:13:10,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:10,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:10,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:10,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2006754175, now seen corresponding path program 1 times [2025-01-08 23:13:10,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:10,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899953759] [2025-01-08 23:13:10,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:10,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:10,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 930 statements into 1 equivalence classes. [2025-01-08 23:13:11,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 930 of 930 statements. [2025-01-08 23:13:11,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:11,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:12,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:13:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899953759] [2025-01-08 23:13:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899953759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:12,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:12,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499019378] [2025-01-08 23:13:12,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:12,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:12,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:12,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:12,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:12,848 INFO L87 Difference]: Start difference. First operand has 1290 states, 1288 states have (on average 1.8563664596273293) internal successors, (2391), 1289 states have internal predecessors, (2391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 310.0) internal successors, (930), 2 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:16,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:16,434 INFO L93 Difference]: Finished difference Result 3644 states and 6856 transitions. [2025-01-08 23:13:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:13:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 2 states have internal predecessors, (930), 0 states have call successors, (0), 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 930 [2025-01-08 23:13:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:16,464 INFO L225 Difference]: With dead ends: 3644 [2025-01-08 23:13:16,464 INFO L226 Difference]: Without dead ends: 2290 [2025-01-08 23:13:16,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:16,473 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 361 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 3216 mSolverCounterSat, 886 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 4102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 3216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:16,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1047 Invalid, 4102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 3216 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:13:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2025-01-08 23:13:16,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2273. [2025-01-08 23:13:16,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 2272 states have (on average 1.664612676056338) internal successors, (3782), 2272 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 3782 transitions. [2025-01-08 23:13:16,588 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 3782 transitions. Word has length 930 [2025-01-08 23:13:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:16,590 INFO L471 AbstractCegarLoop]: Abstraction has 2273 states and 3782 transitions. [2025-01-08 23:13:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 2 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 3782 transitions. [2025-01-08 23:13:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 939 [2025-01-08 23:13:16,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:16,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:16,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:13:16,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:16,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1410253220, now seen corresponding path program 1 times [2025-01-08 23:13:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106513528] [2025-01-08 23:13:16,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:16,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 938 statements into 1 equivalence classes. [2025-01-08 23:13:16,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 938 of 938 statements. [2025-01-08 23:13:16,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:16,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:13:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106513528] [2025-01-08 23:13:17,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106513528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:17,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:17,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:17,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482659099] [2025-01-08 23:13:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:17,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:17,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:17,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:17,455 INFO L87 Difference]: Start difference. First operand 2273 states and 3782 transitions. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 2 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:21,237 INFO L93 Difference]: Finished difference Result 6592 states and 11028 transitions. [2025-01-08 23:13:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:13:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 2 states have internal predecessors, (938), 0 states have call successors, (0), 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 938 [2025-01-08 23:13:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:21,252 INFO L225 Difference]: With dead ends: 6592 [2025-01-08 23:13:21,252 INFO L226 Difference]: Without dead ends: 4321 [2025-01-08 23:13:21,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:21,257 INFO L435 NwaCegarLoop]: 1053 mSDtfsCounter, 1364 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2733 mSolverCounterSat, 1257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1257 IncrementalHoareTripleChecker+Valid, 2733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:21,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1364 Valid, 1196 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1257 Valid, 2733 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-01-08 23:13:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2025-01-08 23:13:21,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4309. [2025-01-08 23:13:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4309 states, 4308 states have (on average 1.5304085422469824) internal successors, (6593), 4308 states have internal predecessors, (6593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4309 states to 4309 states and 6593 transitions. [2025-01-08 23:13:21,327 INFO L78 Accepts]: Start accepts. Automaton has 4309 states and 6593 transitions. Word has length 938 [2025-01-08 23:13:21,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:21,327 INFO L471 AbstractCegarLoop]: Abstraction has 4309 states and 6593 transitions. [2025-01-08 23:13:21,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 2 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 4309 states and 6593 transitions. [2025-01-08 23:13:21,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2025-01-08 23:13:21,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:21,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:21,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:13:21,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:21,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1951722047, now seen corresponding path program 1 times [2025-01-08 23:13:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:21,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327754474] [2025-01-08 23:13:21,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:21,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 946 statements into 1 equivalence classes. [2025-01-08 23:13:21,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 946 of 946 statements. [2025-01-08 23:13:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:13:22,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327754474] [2025-01-08 23:13:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327754474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:22,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:22,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070151793] [2025-01-08 23:13:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:22,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:22,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:22,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:22,165 INFO L87 Difference]: Start difference. First operand 4309 states and 6593 transitions. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 2 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:25,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:25,880 INFO L93 Difference]: Finished difference Result 12682 states and 19450 transitions. [2025-01-08 23:13:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:13:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 2 states have internal predecessors, (946), 0 states have call successors, (0), 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 946 [2025-01-08 23:13:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:25,903 INFO L225 Difference]: With dead ends: 12682 [2025-01-08 23:13:25,903 INFO L226 Difference]: Without dead ends: 8375 [2025-01-08 23:13:25,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:25,911 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 1260 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 3095 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 3095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:25,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1031 Invalid, 4021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 3095 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:13:25,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8375 states. [2025-01-08 23:13:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8375 to 8349. [2025-01-08 23:13:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8349 states, 8348 states have (on average 1.4103977000479158) internal successors, (11774), 8348 states have internal predecessors, (11774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8349 states to 8349 states and 11774 transitions. [2025-01-08 23:13:26,015 INFO L78 Accepts]: Start accepts. Automaton has 8349 states and 11774 transitions. Word has length 946 [2025-01-08 23:13:26,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:26,016 INFO L471 AbstractCegarLoop]: Abstraction has 8349 states and 11774 transitions. [2025-01-08 23:13:26,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 2 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 8349 states and 11774 transitions. [2025-01-08 23:13:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-01-08 23:13:26,030 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:26,031 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:26,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:13:26,032 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:26,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:26,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1530133787, now seen corresponding path program 1 times [2025-01-08 23:13:26,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:26,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240721898] [2025-01-08 23:13:26,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:26,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:26,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-01-08 23:13:26,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-01-08 23:13:26,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:26,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 23:13:27,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:27,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240721898] [2025-01-08 23:13:27,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240721898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:27,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:27,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:27,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205667101] [2025-01-08 23:13:27,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:27,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:27,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:27,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:27,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:27,535 INFO L87 Difference]: Start difference. First operand 8349 states and 11774 transitions. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 2 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:30,813 INFO L93 Difference]: Finished difference Result 24776 states and 34970 transitions. [2025-01-08 23:13:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:13:30,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 2 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 967 [2025-01-08 23:13:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:30,848 INFO L225 Difference]: With dead ends: 24776 [2025-01-08 23:13:30,848 INFO L226 Difference]: Without dead ends: 16429 [2025-01-08 23:13:30,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:30,919 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 1325 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 4233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:30,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1508 Invalid, 4233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:13:30,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16429 states. [2025-01-08 23:13:31,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16429 to 16412. [2025-01-08 23:13:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16412 states, 16411 states have (on average 1.3325208701480715) internal successors, (21868), 16411 states have internal predecessors, (21868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16412 states to 16412 states and 21868 transitions. [2025-01-08 23:13:31,110 INFO L78 Accepts]: Start accepts. Automaton has 16412 states and 21868 transitions. Word has length 967 [2025-01-08 23:13:31,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:31,111 INFO L471 AbstractCegarLoop]: Abstraction has 16412 states and 21868 transitions. [2025-01-08 23:13:31,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 2 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16412 states and 21868 transitions. [2025-01-08 23:13:31,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1012 [2025-01-08 23:13:31,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:31,137 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:31,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:13:31,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:31,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1983123334, now seen corresponding path program 1 times [2025-01-08 23:13:31,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:31,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90637453] [2025-01-08 23:13:31,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:31,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:31,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1011 statements into 1 equivalence classes. [2025-01-08 23:13:31,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1011 of 1011 statements. [2025-01-08 23:13:31,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:31,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 23:13:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:31,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90637453] [2025-01-08 23:13:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90637453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:31,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977895091] [2025-01-08 23:13:31,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:31,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:31,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:31,953 INFO L87 Difference]: Start difference. First operand 16412 states and 21868 transitions. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 2 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:34,813 INFO L93 Difference]: Finished difference Result 40893 states and 53748 transitions. [2025-01-08 23:13:34,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:13:34,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 2 states have internal predecessors, (976), 0 states have call successors, (0), 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 1011 [2025-01-08 23:13:34,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:34,853 INFO L225 Difference]: With dead ends: 40893 [2025-01-08 23:13:34,853 INFO L226 Difference]: Without dead ends: 24483 [2025-01-08 23:13:34,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:34,870 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 1307 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 3638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:34,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1010 Invalid, 3638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 3429 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:13:34,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24483 states. [2025-01-08 23:13:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24483 to 24466. [2025-01-08 23:13:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24466 states, 24465 states have (on average 1.2998569384835479) internal successors, (31801), 24465 states have internal predecessors, (31801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24466 states to 24466 states and 31801 transitions. [2025-01-08 23:13:35,122 INFO L78 Accepts]: Start accepts. Automaton has 24466 states and 31801 transitions. Word has length 1011 [2025-01-08 23:13:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:35,122 INFO L471 AbstractCegarLoop]: Abstraction has 24466 states and 31801 transitions. [2025-01-08 23:13:35,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 2 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24466 states and 31801 transitions. [2025-01-08 23:13:35,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2025-01-08 23:13:35,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:35,155 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:35,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:13:35,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:35,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:35,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1282206471, now seen corresponding path program 1 times [2025-01-08 23:13:35,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:35,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974357745] [2025-01-08 23:13:35,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:35,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1012 statements into 1 equivalence classes. [2025-01-08 23:13:35,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1012 of 1012 statements. [2025-01-08 23:13:35,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:35,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:13:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974357745] [2025-01-08 23:13:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974357745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780629492] [2025-01-08 23:13:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:35,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:35,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:35,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:35,897 INFO L87 Difference]: Start difference. First operand 24466 states and 31801 transitions. Second operand has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 2 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:39,071 INFO L93 Difference]: Finished difference Result 72867 states and 94682 transitions. [2025-01-08 23:13:39,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:13:39,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 2 states have internal predecessors, (1012), 0 states have call successors, (0), 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 1012 [2025-01-08 23:13:39,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:39,153 INFO L225 Difference]: With dead ends: 72867 [2025-01-08 23:13:39,153 INFO L226 Difference]: Without dead ends: 48403 [2025-01-08 23:13:39,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:39,183 INFO L435 NwaCegarLoop]: 1145 mSDtfsCounter, 1074 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 991 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 4066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 991 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:39,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1329 Invalid, 4066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [991 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:13:39,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48403 states. [2025-01-08 23:13:39,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48403 to 48368. [2025-01-08 23:13:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48368 states, 48367 states have (on average 1.2238716480244796) internal successors, (59195), 48367 states have internal predecessors, (59195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48368 states to 48368 states and 59195 transitions. [2025-01-08 23:13:39,694 INFO L78 Accepts]: Start accepts. Automaton has 48368 states and 59195 transitions. Word has length 1012 [2025-01-08 23:13:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:39,694 INFO L471 AbstractCegarLoop]: Abstraction has 48368 states and 59195 transitions. [2025-01-08 23:13:39,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.3333333333333) internal successors, (1012), 2 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 48368 states and 59195 transitions. [2025-01-08 23:13:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1034 [2025-01-08 23:13:39,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:39,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:39,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:13:39,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:39,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:39,739 INFO L85 PathProgramCache]: Analyzing trace with hash 819166497, now seen corresponding path program 1 times [2025-01-08 23:13:39,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:39,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771408019] [2025-01-08 23:13:39,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:39,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:39,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1033 statements into 1 equivalence classes. [2025-01-08 23:13:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1033 of 1033 statements. [2025-01-08 23:13:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:40,818 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:13:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771408019] [2025-01-08 23:13:40,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771408019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:40,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:40,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:13:40,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692168840] [2025-01-08 23:13:40,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:40,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:13:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:40,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:13:40,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:13:40,820 INFO L87 Difference]: Start difference. First operand 48368 states and 59195 transitions. Second operand has 4 states, 4 states have (on average 258.25) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:45,632 INFO L93 Difference]: Finished difference Result 150536 states and 186785 transitions. [2025-01-08 23:13:45,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:13:45,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 258.25) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 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 1033 [2025-01-08 23:13:45,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:45,781 INFO L225 Difference]: With dead ends: 150536 [2025-01-08 23:13:45,781 INFO L226 Difference]: Without dead ends: 102170 [2025-01-08 23:13:45,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:13:45,823 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 2351 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 6445 mSolverCounterSat, 1580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2351 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 8025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1580 IncrementalHoareTripleChecker+Valid, 6445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:45,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2351 Valid, 1325 Invalid, 8025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1580 Valid, 6445 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-08 23:13:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102170 states. [2025-01-08 23:13:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102170 to 102086. [2025-01-08 23:13:46,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102086 states, 102085 states have (on average 1.1694078464025077) internal successors, (119379), 102085 states have internal predecessors, (119379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102086 states to 102086 states and 119379 transitions. [2025-01-08 23:13:46,685 INFO L78 Accepts]: Start accepts. Automaton has 102086 states and 119379 transitions. Word has length 1033 [2025-01-08 23:13:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:46,685 INFO L471 AbstractCegarLoop]: Abstraction has 102086 states and 119379 transitions. [2025-01-08 23:13:46,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 258.25) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 102086 states and 119379 transitions. [2025-01-08 23:13:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1046 [2025-01-08 23:13:46,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:46,937 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:46,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:13:46,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:46,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:46,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1003147322, now seen corresponding path program 1 times [2025-01-08 23:13:46,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:46,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153187571] [2025-01-08 23:13:46,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:46,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:47,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1045 statements into 1 equivalence classes. [2025-01-08 23:13:47,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1045 of 1045 statements. [2025-01-08 23:13:47,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:47,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-08 23:13:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:48,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153187571] [2025-01-08 23:13:48,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153187571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:48,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:48,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:13:48,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393415950] [2025-01-08 23:13:48,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:48,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:13:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:48,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:13:48,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:13:48,020 INFO L87 Difference]: Start difference. First operand 102086 states and 119379 transitions. Second operand has 4 states, 4 states have (on average 252.25) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:52,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:13:52,868 INFO L93 Difference]: Finished difference Result 339650 states and 392304 transitions. [2025-01-08 23:13:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:13:52,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 252.25) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 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 1045 [2025-01-08 23:13:52,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:13:53,150 INFO L225 Difference]: With dead ends: 339650 [2025-01-08 23:13:53,150 INFO L226 Difference]: Without dead ends: 237566 [2025-01-08 23:13:53,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:13:53,378 INFO L435 NwaCegarLoop]: 1131 mSDtfsCounter, 3691 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4890 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3691 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 5583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 4890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:13:53,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3691 Valid, 1373 Invalid, 5583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 4890 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-08 23:13:53,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237566 states. [2025-01-08 23:13:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237566 to 237524. [2025-01-08 23:13:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237524 states, 237523 states have (on average 1.1471352247992825) internal successors, (272471), 237523 states have internal predecessors, (272471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237524 states to 237524 states and 272471 transitions. [2025-01-08 23:13:56,132 INFO L78 Accepts]: Start accepts. Automaton has 237524 states and 272471 transitions. Word has length 1045 [2025-01-08 23:13:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:13:56,133 INFO L471 AbstractCegarLoop]: Abstraction has 237524 states and 272471 transitions. [2025-01-08 23:13:56,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.25) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:13:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 237524 states and 272471 transitions. [2025-01-08 23:13:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1050 [2025-01-08 23:13:56,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:13:56,386 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:13:56,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:13:56,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:13:56,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:13:56,387 INFO L85 PathProgramCache]: Analyzing trace with hash 602676213, now seen corresponding path program 1 times [2025-01-08 23:13:56,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:13:56,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340823767] [2025-01-08 23:13:56,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:13:56,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:13:56,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1049 statements into 1 equivalence classes. [2025-01-08 23:13:56,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1049 of 1049 statements. [2025-01-08 23:13:56,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:13:56,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:13:57,227 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-08 23:13:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:13:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340823767] [2025-01-08 23:13:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340823767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:13:57,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:13:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:13:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45746651] [2025-01-08 23:13:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:13:57,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:13:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:13:57,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:13:57,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:13:57,229 INFO L87 Difference]: Start difference. First operand 237524 states and 272471 transitions. Second operand has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 2 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:14:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:14:01,764 INFO L93 Difference]: Finished difference Result 683217 states and 778872 transitions. [2025-01-08 23:14:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:14:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 2 states have internal predecessors, (995), 0 states have call successors, (0), 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 1049 [2025-01-08 23:14:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:14:02,389 INFO L225 Difference]: With dead ends: 683217 [2025-01-08 23:14:02,389 INFO L226 Difference]: Without dead ends: 445695 [2025-01-08 23:14:02,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:14:02,492 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 1341 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 3506 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 3694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 3506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:14:02,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1121 Invalid, 3694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 3506 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:14:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445695 states. [2025-01-08 23:14:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445695 to 445657. [2025-01-08 23:14:06,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445657 states, 445656 states have (on average 1.135579909167609) internal successors, (506078), 445656 states have internal predecessors, (506078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:14:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445657 states to 445657 states and 506078 transitions. [2025-01-08 23:14:07,478 INFO L78 Accepts]: Start accepts. Automaton has 445657 states and 506078 transitions. Word has length 1049 [2025-01-08 23:14:07,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:14:07,478 INFO L471 AbstractCegarLoop]: Abstraction has 445657 states and 506078 transitions. [2025-01-08 23:14:07,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.6666666666667) internal successors, (995), 2 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:14:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 445657 states and 506078 transitions. [2025-01-08 23:14:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1054 [2025-01-08 23:14:07,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:14:07,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:14:07,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:14:07,829 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:14:07,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:14:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1866184016, now seen corresponding path program 1 times [2025-01-08 23:14:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:14:07,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59271427] [2025-01-08 23:14:07,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:14:07,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:14:07,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1053 statements into 1 equivalence classes. [2025-01-08 23:14:08,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1053 of 1053 statements. [2025-01-08 23:14:08,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:14:08,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:14:08,993 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:14:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:14:08,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59271427] [2025-01-08 23:14:08,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59271427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:14:08,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:14:08,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:14:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521126754] [2025-01-08 23:14:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:14:08,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:14:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:14:08,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:14:08,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:14:08,996 INFO L87 Difference]: Start difference. First operand 445657 states and 506078 transitions. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 2 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:14:14,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:14:14,852 INFO L93 Difference]: Finished difference Result 1142319 states and 1308615 transitions. [2025-01-08 23:14:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:14:14,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 2 states have internal predecessors, (1053), 0 states have call successors, (0), 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 1053 [2025-01-08 23:14:14,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:14:16,486 INFO L225 Difference]: With dead ends: 1142319 [2025-01-08 23:14:16,486 INFO L226 Difference]: Without dead ends: 696664 [2025-01-08 23:14:16,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:14:16,613 INFO L435 NwaCegarLoop]: 1348 mSDtfsCounter, 1012 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 3858 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 4552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 3858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:14:16,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1496 Invalid, 4552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 3858 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:14:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696664 states. [2025-01-08 23:14:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696664 to 696364. [2025-01-08 23:14:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696364 states, 696363 states have (on average 1.131091111963157) internal successors, (787650), 696363 states have internal predecessors, (787650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)