./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label31.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/Problem18_label31.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 48e151e171192faba98bea76b0a05f258efede2f42bdf4a8243efed731650338 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:19:21,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:19:21,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:19:21,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:19:21,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:19:22,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:19:22,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:19:22,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:19:22,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:19:22,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:19:22,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:19:22,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:19:22,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:19:22,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:19:22,011 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:19:22,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:19:22,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:19:22,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:19:22,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:19:22,013 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:19:22,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:19:22,013 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:19:22,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:19:22,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:19:22,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:19:22,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:19:22,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:19:22,014 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:19:22,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:19:22,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:19:22,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:19:22,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:19:22,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:19:22,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:19:22,015 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 -> 48e151e171192faba98bea76b0a05f258efede2f42bdf4a8243efed731650338 [2025-01-09 00:19:22,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:19:22,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:19:22,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:19:22,308 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:19:22,308 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:19:22,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label31.c [2025-01-09 00:19:23,716 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d5ffbbba/7fb157a8830b4ee7a0f4f55351c7fc52/FLAGd788e7407 [2025-01-09 00:19:24,203 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:19:24,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label31.c [2025-01-09 00:19:24,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d5ffbbba/7fb157a8830b4ee7a0f4f55351c7fc52/FLAGd788e7407 [2025-01-09 00:19:24,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d5ffbbba/7fb157a8830b4ee7a0f4f55351c7fc52 [2025-01-09 00:19:24,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:19:24,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:19:24,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:19:24,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:19:24,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:19:24,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:19:24" (1/1) ... [2025-01-09 00:19:24,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5867cfd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:24, skipping insertion in model container [2025-01-09 00:19:24,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:19:24" (1/1) ... [2025-01-09 00:19:24,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:19:24,550 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/Problem18_label31.c[1896,1909] [2025-01-09 00:19:25,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:19:25,057 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:19:25,068 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/Problem18_label31.c[1896,1909] [2025-01-09 00:19:25,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:19:25,360 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:19:25,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25 WrapperNode [2025-01-09 00:19:25,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:19:25,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:19:25,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:19:25,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:19:25,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,633 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-01-09 00:19:25,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:19:25,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:19:25,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:19:25,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:19:25,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,752 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-09 00:19:25,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,879 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:19:25,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:19:25,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:19:25,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:19:25,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (1/1) ... [2025-01-09 00:19:25,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:19:25,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:19:25,996 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-09 00:19:26,001 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-09 00:19:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:19:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:19:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:19:26,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:19:26,095 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:19:26,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:19:29,843 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-01-09 00:19:29,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:19:29,873 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:19:29,873 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:19:29,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:19:29 BoogieIcfgContainer [2025-01-09 00:19:29,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:19:29,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:19:29,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:19:29,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:19:29,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:19:24" (1/3) ... [2025-01-09 00:19:29,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa43181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:19:29, skipping insertion in model container [2025-01-09 00:19:29,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:19:25" (2/3) ... [2025-01-09 00:19:29,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa43181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:19:29, skipping insertion in model container [2025-01-09 00:19:29,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:19:29" (3/3) ... [2025-01-09 00:19:29,885 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label31.c [2025-01-09 00:19:29,898 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:19:29,899 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label31.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:19:29,970 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:19:29,979 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;@7b738882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:19:29,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:19:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 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-09 00:19:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 00:19:29,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:29,990 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:19:29,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:29,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1346991276, now seen corresponding path program 1 times [2025-01-09 00:19:30,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:30,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594054044] [2025-01-09 00:19:30,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:30,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:30,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 00:19:30,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 00:19:30,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:30,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:30,265 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-09 00:19:30,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:30,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594054044] [2025-01-09 00:19:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594054044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:30,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:30,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453468600] [2025-01-09 00:19:30,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:19:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:30,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:19:30,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:19:30,296 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-09 00:19:34,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:34,947 INFO L93 Difference]: Finished difference Result 2910 states and 5656 transitions. [2025-01-09 00:19:34,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:19:34,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2025-01-09 00:19:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:34,967 INFO L225 Difference]: With dead ends: 2910 [2025-01-09 00:19:34,968 INFO L226 Difference]: Without dead ends: 2080 [2025-01-09 00:19:34,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:19:34,976 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2204 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3390 mSolverCounterSat, 1773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2204 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1773 IncrementalHoareTripleChecker+Valid, 3390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:34,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2204 Valid, 168 Invalid, 5163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1773 Valid, 3390 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 00:19:34,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-01-09 00:19:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2074. [2025-01-09 00:19:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2074 states, 2073 states have (on average 1.5561987457790643) internal successors, (3226), 2073 states have internal predecessors, (3226), 0 states have call successors, (0), 0 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-09 00:19:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 3226 transitions. [2025-01-09 00:19:35,093 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 3226 transitions. Word has length 15 [2025-01-09 00:19:35,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:35,094 INFO L471 AbstractCegarLoop]: Abstraction has 2074 states and 3226 transitions. [2025-01-09 00:19:35,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-09 00:19:35,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 3226 transitions. [2025-01-09 00:19:35,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 00:19:35,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:35,098 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:35,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:19:35,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:35,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:35,099 INFO L85 PathProgramCache]: Analyzing trace with hash 306473131, now seen corresponding path program 1 times [2025-01-09 00:19:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:35,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546868810] [2025-01-09 00:19:35,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:35,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:35,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 00:19:35,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 00:19:35,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:35,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 00:19:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546868810] [2025-01-09 00:19:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546868810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:35,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:35,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140518571] [2025-01-09 00:19:35,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:19:35,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:35,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:19:35,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:19:35,932 INFO L87 Difference]: Start difference. First operand 2074 states and 3226 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-09 00:19:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:40,049 INFO L93 Difference]: Finished difference Result 6906 states and 10879 transitions. [2025-01-09 00:19:40,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:19:40,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 175 [2025-01-09 00:19:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:40,068 INFO L225 Difference]: With dead ends: 6906 [2025-01-09 00:19:40,069 INFO L226 Difference]: Without dead ends: 4834 [2025-01-09 00:19:40,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:19:40,073 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 1923 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4331 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 4331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:40,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 623 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [628 Valid, 4331 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:19:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2025-01-09 00:19:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2025-01-09 00:19:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.3405744629495535) internal successors, (5554), 4143 states have internal predecessors, (5554), 0 states have call successors, (0), 0 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-09 00:19:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5554 transitions. [2025-01-09 00:19:40,165 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5554 transitions. Word has length 175 [2025-01-09 00:19:40,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:40,166 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5554 transitions. [2025-01-09 00:19:40,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 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-09 00:19:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5554 transitions. [2025-01-09 00:19:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-01-09 00:19:40,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:40,171 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:19:40,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:19:40,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:40,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash -15219681, now seen corresponding path program 1 times [2025-01-09 00:19:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:40,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791595299] [2025-01-09 00:19:40,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:40,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-01-09 00:19:40,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-01-09 00:19:40,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:40,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:19:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791595299] [2025-01-09 00:19:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791595299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:40,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:40,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:40,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596935724] [2025-01-09 00:19:40,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:40,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:19:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:40,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:19:40,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:19:40,674 INFO L87 Difference]: Start difference. First operand 4144 states and 5554 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:43,322 INFO L93 Difference]: Finished difference Result 10409 states and 13871 transitions. [2025-01-09 00:19:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:19:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-01-09 00:19:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:43,346 INFO L225 Difference]: With dead ends: 10409 [2025-01-09 00:19:43,346 INFO L226 Difference]: Without dead ends: 6214 [2025-01-09 00:19:43,353 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-09 00:19:43,354 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:43,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 637 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-09 00:19:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6214 states. [2025-01-09 00:19:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6214 to 5524. [2025-01-09 00:19:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5523 states have (on average 1.196089082020641) internal successors, (6606), 5523 states have internal predecessors, (6606), 0 states have call successors, (0), 0 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-09 00:19:43,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6606 transitions. [2025-01-09 00:19:43,454 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 6606 transitions. Word has length 265 [2025-01-09 00:19:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:43,454 INFO L471 AbstractCegarLoop]: Abstraction has 5524 states and 6606 transitions. [2025-01-09 00:19:43,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:19:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 6606 transitions. [2025-01-09 00:19:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2025-01-09 00:19:43,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:43,501 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:19:43,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:19:43,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:43,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -398936529, now seen corresponding path program 1 times [2025-01-09 00:19:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910409901] [2025-01-09 00:19:43,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:43,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 897 statements into 1 equivalence classes. [2025-01-09 00:19:43,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 897 of 897 statements. [2025-01-09 00:19:43,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:43,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-09 00:19:44,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:44,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910409901] [2025-01-09 00:19:44,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910409901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:44,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:19:44,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607811844] [2025-01-09 00:19:44,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:44,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:44,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:44,386 INFO L87 Difference]: Start difference. First operand 5524 states and 6606 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-09 00:19:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:46,456 INFO L93 Difference]: Finished difference Result 12426 states and 14971 transitions. [2025-01-09 00:19:46,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:46,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 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 897 [2025-01-09 00:19:46,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:46,475 INFO L225 Difference]: With dead ends: 12426 [2025-01-09 00:19:46,475 INFO L226 Difference]: Without dead ends: 6904 [2025-01-09 00:19:46,482 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-09 00:19:46,482 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 249 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 687 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 687 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:46,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 77 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [687 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:19:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2025-01-09 00:19:46,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6904. [2025-01-09 00:19:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.192814718238447) internal successors, (8234), 6903 states have internal predecessors, (8234), 0 states have call successors, (0), 0 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-09 00:19:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8234 transitions. [2025-01-09 00:19:46,598 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8234 transitions. Word has length 897 [2025-01-09 00:19:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:46,599 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8234 transitions. [2025-01-09 00:19:46,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-09 00:19:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8234 transitions. [2025-01-09 00:19:46,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 920 [2025-01-09 00:19:46,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:46,627 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:19:46,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:19:46,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:46,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash -250054906, now seen corresponding path program 1 times [2025-01-09 00:19:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182033601] [2025-01-09 00:19:46,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:46,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 919 statements into 1 equivalence classes. [2025-01-09 00:19:46,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 919 of 919 statements. [2025-01-09 00:19:46,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:46,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 515 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 00:19:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182033601] [2025-01-09 00:19:47,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182033601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:47,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:47,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:19:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438787956] [2025-01-09 00:19:47,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:47,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:47,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:47,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:47,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:47,661 INFO L87 Difference]: Start difference. First operand 6904 states and 8234 transitions. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-09 00:19:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:49,674 INFO L93 Difference]: Finished difference Result 16566 states and 20399 transitions. [2025-01-09 00:19:49,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 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 919 [2025-01-09 00:19:49,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:49,703 INFO L225 Difference]: With dead ends: 16566 [2025-01-09 00:19:49,703 INFO L226 Difference]: Without dead ends: 9664 [2025-01-09 00:19:49,711 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-09 00:19:49,712 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 226 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:49,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 389 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:19:49,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9664 states. [2025-01-09 00:19:49,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9664 to 8974. [2025-01-09 00:19:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8974 states, 8973 states have (on average 1.1651621531260448) internal successors, (10455), 8973 states have internal predecessors, (10455), 0 states have call successors, (0), 0 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-09 00:19:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8974 states to 8974 states and 10455 transitions. [2025-01-09 00:19:49,850 INFO L78 Accepts]: Start accepts. Automaton has 8974 states and 10455 transitions. Word has length 919 [2025-01-09 00:19:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:49,853 INFO L471 AbstractCegarLoop]: Abstraction has 8974 states and 10455 transitions. [2025-01-09 00:19:49,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-09 00:19:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8974 states and 10455 transitions. [2025-01-09 00:19:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 984 [2025-01-09 00:19:49,865 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:49,866 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:19:49,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:19:49,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:49,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1018362359, now seen corresponding path program 1 times [2025-01-09 00:19:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407661781] [2025-01-09 00:19:49,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 983 statements into 1 equivalence classes. [2025-01-09 00:19:50,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 983 of 983 statements. [2025-01-09 00:19:50,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:50,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2025-01-09 00:19:50,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:50,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407661781] [2025-01-09 00:19:50,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407661781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:50,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:50,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:50,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015908931] [2025-01-09 00:19:50,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:50,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:50,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:50,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:50,719 INFO L87 Difference]: Start difference. First operand 8974 states and 10455 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-09 00:19:52,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:52,673 INFO L93 Difference]: Finished difference Result 22776 states and 26964 transitions. [2025-01-09 00:19:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 983 [2025-01-09 00:19:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:52,709 INFO L225 Difference]: With dead ends: 22776 [2025-01-09 00:19:52,710 INFO L226 Difference]: Without dead ends: 13804 [2025-01-09 00:19:52,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:52,721 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 682 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 2359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:52,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1131 Invalid, 2359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 1874 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:19:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13804 states. [2025-01-09 00:19:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 13114. [2025-01-09 00:19:52,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13114 states, 13113 states have (on average 1.1490124304125677) internal successors, (15067), 13113 states have internal predecessors, (15067), 0 states have call successors, (0), 0 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-09 00:19:52,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13114 states to 13114 states and 15067 transitions. [2025-01-09 00:19:52,940 INFO L78 Accepts]: Start accepts. Automaton has 13114 states and 15067 transitions. Word has length 983 [2025-01-09 00:19:52,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:52,941 INFO L471 AbstractCegarLoop]: Abstraction has 13114 states and 15067 transitions. [2025-01-09 00:19:52,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-09 00:19:52,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13114 states and 15067 transitions. [2025-01-09 00:19:52,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1001 [2025-01-09 00:19:52,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:52,952 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:19:52,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:19:52,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1206191036, now seen corresponding path program 1 times [2025-01-09 00:19:52,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:52,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549662873] [2025-01-09 00:19:52,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:53,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1000 statements into 1 equivalence classes. [2025-01-09 00:19:53,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1000 of 1000 statements. [2025-01-09 00:19:53,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:53,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-01-09 00:19:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549662873] [2025-01-09 00:19:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549662873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:53,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:53,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:53,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920216175] [2025-01-09 00:19:53,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:53,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:53,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:53,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:53,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:53,636 INFO L87 Difference]: Start difference. First operand 13114 states and 15067 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-09 00:19:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:55,871 INFO L93 Difference]: Finished difference Result 32436 states and 37807 transitions. [2025-01-09 00:19:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 1000 [2025-01-09 00:19:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:55,911 INFO L225 Difference]: With dead ends: 32436 [2025-01-09 00:19:55,912 INFO L226 Difference]: Without dead ends: 19324 [2025-01-09 00:19:55,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:55,925 INFO L435 NwaCegarLoop]: 1128 mSDtfsCounter, 678 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2081 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 2081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:55,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1135 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 2081 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:19:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19324 states. [2025-01-09 00:19:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19324 to 18634. [2025-01-09 00:19:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18634 states, 18633 states have (on average 1.1388933612408094) internal successors, (21221), 18633 states have internal predecessors, (21221), 0 states have call successors, (0), 0 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-09 00:19:56,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18634 states to 18634 states and 21221 transitions. [2025-01-09 00:19:56,116 INFO L78 Accepts]: Start accepts. Automaton has 18634 states and 21221 transitions. Word has length 1000 [2025-01-09 00:19:56,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:56,117 INFO L471 AbstractCegarLoop]: Abstraction has 18634 states and 21221 transitions. [2025-01-09 00:19:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-09 00:19:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18634 states and 21221 transitions. [2025-01-09 00:19:56,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1020 [2025-01-09 00:19:56,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:56,128 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:19:56,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:19:56,128 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:56,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:56,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1748814831, now seen corresponding path program 1 times [2025-01-09 00:19:56,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:56,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632514930] [2025-01-09 00:19:56,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:56,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:56,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1019 statements into 1 equivalence classes. [2025-01-09 00:19:56,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1019 of 1019 statements. [2025-01-09 00:19:56,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:56,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:19:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-01-09 00:19:56,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:19:56,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632514930] [2025-01-09 00:19:56,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632514930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:19:56,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:19:56,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:19:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945444000] [2025-01-09 00:19:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:19:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:19:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:19:56,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:19:56,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:56,946 INFO L87 Difference]: Start difference. First operand 18634 states and 21221 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-09 00:19:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:19:58,863 INFO L93 Difference]: Finished difference Result 42096 states and 48351 transitions. [2025-01-09 00:19:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:19:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 1019 [2025-01-09 00:19:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:19:58,897 INFO L225 Difference]: With dead ends: 42096 [2025-01-09 00:19:58,897 INFO L226 Difference]: Without dead ends: 23464 [2025-01-09 00:19:58,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:19:58,911 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 679 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:19:58,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 447 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:19:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2025-01-09 00:19:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 22774. [2025-01-09 00:19:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22774 states, 22773 states have (on average 1.1340183550696) internal successors, (25825), 22773 states have internal predecessors, (25825), 0 states have call successors, (0), 0 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-09 00:19:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22774 states to 22774 states and 25825 transitions. [2025-01-09 00:19:59,149 INFO L78 Accepts]: Start accepts. Automaton has 22774 states and 25825 transitions. Word has length 1019 [2025-01-09 00:19:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:19:59,151 INFO L471 AbstractCegarLoop]: Abstraction has 22774 states and 25825 transitions. [2025-01-09 00:19:59,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-09 00:19:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 22774 states and 25825 transitions. [2025-01-09 00:19:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2025-01-09 00:19:59,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:19:59,162 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:19:59,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:19:59,162 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:19:59,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:19:59,163 INFO L85 PathProgramCache]: Analyzing trace with hash 713649950, now seen corresponding path program 1 times [2025-01-09 00:19:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:19:59,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212653472] [2025-01-09 00:19:59,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:19:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:19:59,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1037 statements into 1 equivalence classes. [2025-01-09 00:19:59,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1037 of 1037 statements. [2025-01-09 00:19:59,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:19:59,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 853 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-01-09 00:20:00,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212653472] [2025-01-09 00:20:00,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212653472] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:00,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:00,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443743852] [2025-01-09 00:20:00,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:00,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:00,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:00,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:00,187 INFO L87 Difference]: Start difference. First operand 22774 states and 25825 transitions. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-09 00:20:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:02,062 INFO L93 Difference]: Finished difference Result 51756 states and 59194 transitions. [2025-01-09 00:20:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 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 1037 [2025-01-09 00:20:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:02,119 INFO L225 Difference]: With dead ends: 51756 [2025-01-09 00:20:02,120 INFO L226 Difference]: Without dead ends: 28984 [2025-01-09 00:20:02,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:02,141 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 576 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:02,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1012 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:20:02,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28984 states. [2025-01-09 00:20:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28984 to 28984. [2025-01-09 00:20:02,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28984 states, 28983 states have (on average 1.1240727322913433) internal successors, (32579), 28983 states have internal predecessors, (32579), 0 states have call successors, (0), 0 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-09 00:20:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28984 states to 28984 states and 32579 transitions. [2025-01-09 00:20:02,453 INFO L78 Accepts]: Start accepts. Automaton has 28984 states and 32579 transitions. Word has length 1037 [2025-01-09 00:20:02,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:02,454 INFO L471 AbstractCegarLoop]: Abstraction has 28984 states and 32579 transitions. [2025-01-09 00:20:02,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 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-09 00:20:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 28984 states and 32579 transitions. [2025-01-09 00:20:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1115 [2025-01-09 00:20:02,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:02,467 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:02,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:20:02,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:02,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1141954886, now seen corresponding path program 1 times [2025-01-09 00:20:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329675781] [2025-01-09 00:20:02,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:02,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1114 statements into 1 equivalence classes. [2025-01-09 00:20:02,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1114 of 1114 statements. [2025-01-09 00:20:02,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:02,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-01-09 00:20:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:03,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329675781] [2025-01-09 00:20:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329675781] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470006325] [2025-01-09 00:20:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:03,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:03,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:03,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:03,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:03,317 INFO L87 Difference]: Start difference. First operand 28984 states and 32579 transitions. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 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-09 00:20:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:05,147 INFO L93 Difference]: Finished difference Result 66246 states and 74486 transitions. [2025-01-09 00:20:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:05,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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 1114 [2025-01-09 00:20:05,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:05,190 INFO L225 Difference]: With dead ends: 66246 [2025-01-09 00:20:05,190 INFO L226 Difference]: Without dead ends: 32434 [2025-01-09 00:20:05,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:05,218 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 638 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1705 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:05,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1097 Invalid, 2146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1705 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:20:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32434 states. [2025-01-09 00:20:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32434 to 31744. [2025-01-09 00:20:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31744 states, 31743 states have (on average 1.0743786031566014) internal successors, (34104), 31743 states have internal predecessors, (34104), 0 states have call successors, (0), 0 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-09 00:20:05,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31744 states to 31744 states and 34104 transitions. [2025-01-09 00:20:05,652 INFO L78 Accepts]: Start accepts. Automaton has 31744 states and 34104 transitions. Word has length 1114 [2025-01-09 00:20:05,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:05,653 INFO L471 AbstractCegarLoop]: Abstraction has 31744 states and 34104 transitions. [2025-01-09 00:20:05,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 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-09 00:20:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 31744 states and 34104 transitions. [2025-01-09 00:20:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2025-01-09 00:20:05,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:05,666 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:05,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:20:05,666 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:05,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:05,667 INFO L85 PathProgramCache]: Analyzing trace with hash -478349685, now seen corresponding path program 1 times [2025-01-09 00:20:05,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10057880] [2025-01-09 00:20:05,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:05,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-01-09 00:20:05,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-01-09 00:20:05,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:05,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1227 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 1163 trivial. 0 not checked. [2025-01-09 00:20:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10057880] [2025-01-09 00:20:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10057880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:06,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39728907] [2025-01-09 00:20:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:06,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:06,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:06,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:06,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:06,223 INFO L87 Difference]: Start difference. First operand 31744 states and 34104 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-09 00:20:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:07,883 INFO L93 Difference]: Finished difference Result 76596 states and 82826 transitions. [2025-01-09 00:20:07,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:07,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1125 [2025-01-09 00:20:07,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:07,928 INFO L225 Difference]: With dead ends: 76596 [2025-01-09 00:20:07,929 INFO L226 Difference]: Without dead ends: 44854 [2025-01-09 00:20:07,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:07,951 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 688 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:07,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 978 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:20:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-01-09 00:20:08,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 44854. [2025-01-09 00:20:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44854 states, 44853 states have (on average 1.0682674514525228) internal successors, (47915), 44853 states have internal predecessors, (47915), 0 states have call successors, (0), 0 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-09 00:20:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44854 states to 44854 states and 47915 transitions. [2025-01-09 00:20:08,390 INFO L78 Accepts]: Start accepts. Automaton has 44854 states and 47915 transitions. Word has length 1125 [2025-01-09 00:20:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:08,391 INFO L471 AbstractCegarLoop]: Abstraction has 44854 states and 47915 transitions. [2025-01-09 00:20:08,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-09 00:20:08,391 INFO L276 IsEmpty]: Start isEmpty. Operand 44854 states and 47915 transitions. [2025-01-09 00:20:08,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1163 [2025-01-09 00:20:08,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:08,404 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:20:08,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:20:08,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:08,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash 996152801, now seen corresponding path program 1 times [2025-01-09 00:20:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555582759] [2025-01-09 00:20:08,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:08,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1162 statements into 1 equivalence classes. [2025-01-09 00:20:08,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1162 of 1162 statements. [2025-01-09 00:20:08,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:08,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 807 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-01-09 00:20:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555582759] [2025-01-09 00:20:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555582759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:09,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415489656] [2025-01-09 00:20:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:09,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:20:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:09,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:20:09,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:20:09,565 INFO L87 Difference]: Start difference. First operand 44854 states and 47915 transitions. Second operand has 4 states, 4 states have (on average 211.75) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 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-09 00:20:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:12,051 INFO L93 Difference]: Finished difference Result 89706 states and 95828 transitions. [2025-01-09 00:20:12,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:20:12,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 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 1162 [2025-01-09 00:20:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:12,097 INFO L225 Difference]: With dead ends: 89706 [2025-01-09 00:20:12,097 INFO L226 Difference]: Without dead ends: 44854 [2025-01-09 00:20:12,124 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-09 00:20:12,124 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 812 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:12,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 86 Invalid, 3060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:20:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-01-09 00:20:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 44854. [2025-01-09 00:20:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44854 states, 44853 states have (on average 1.0681113860834281) internal successors, (47908), 44853 states have internal predecessors, (47908), 0 states have call successors, (0), 0 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-09 00:20:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44854 states to 44854 states and 47908 transitions. [2025-01-09 00:20:12,627 INFO L78 Accepts]: Start accepts. Automaton has 44854 states and 47908 transitions. Word has length 1162 [2025-01-09 00:20:12,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:12,628 INFO L471 AbstractCegarLoop]: Abstraction has 44854 states and 47908 transitions. [2025-01-09 00:20:12,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.75) internal successors, (847), 3 states have internal predecessors, (847), 0 states have call successors, (0), 0 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-09 00:20:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 44854 states and 47908 transitions. [2025-01-09 00:20:12,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2025-01-09 00:20:12,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:12,647 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:12,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:20:12,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:12,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:12,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1969570039, now seen corresponding path program 1 times [2025-01-09 00:20:12,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:12,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438619786] [2025-01-09 00:20:12,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:12,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:12,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1197 statements into 1 equivalence classes. [2025-01-09 00:20:12,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1197 of 1197 statements. [2025-01-09 00:20:12,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:12,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 1044 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2025-01-09 00:20:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438619786] [2025-01-09 00:20:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438619786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12347192] [2025-01-09 00:20:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:13,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:13,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:13,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:13,155 INFO L87 Difference]: Start difference. First operand 44854 states and 47908 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 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-09 00:20:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:14,816 INFO L93 Difference]: Finished difference Result 89016 states and 95120 transitions. [2025-01-09 00:20:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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 1197 [2025-01-09 00:20:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:14,859 INFO L225 Difference]: With dead ends: 89016 [2025-01-09 00:20:14,859 INFO L226 Difference]: Without dead ends: 44164 [2025-01-09 00:20:14,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:14,886 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 587 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:14,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 952 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:20:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44164 states. [2025-01-09 00:20:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44164 to 44164. [2025-01-09 00:20:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.0584199442972624) internal successors, (46743), 44163 states have internal predecessors, (46743), 0 states have call successors, (0), 0 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-09 00:20:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 46743 transitions. [2025-01-09 00:20:15,249 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 46743 transitions. Word has length 1197 [2025-01-09 00:20:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:15,250 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 46743 transitions. [2025-01-09 00:20:15,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 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-09 00:20:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 46743 transitions. [2025-01-09 00:20:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2025-01-09 00:20:15,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:15,262 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:15,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:20:15,262 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:15,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:15,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1108563606, now seen corresponding path program 1 times [2025-01-09 00:20:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16867211] [2025-01-09 00:20:15,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:15,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1227 statements into 1 equivalence classes. [2025-01-09 00:20:15,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1227 of 1227 statements. [2025-01-09 00:20:15,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:15,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 447 proven. 898 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 00:20:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16867211] [2025-01-09 00:20:16,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16867211] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:20:16,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293449943] [2025-01-09 00:20:16,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:16,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:20:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:20:16,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:20:16,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:20:17,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1227 statements into 1 equivalence classes. [2025-01-09 00:20:17,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1227 of 1227 statements. [2025-01-09 00:20:17,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:17,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:17,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:20:17,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:20:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 762 trivial. 0 not checked. [2025-01-09 00:20:17,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:20:17,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293449943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:17,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:20:17,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:20:17,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516644652] [2025-01-09 00:20:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:17,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:17,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:17,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:17,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:20:17,547 INFO L87 Difference]: Start difference. First operand 44164 states and 46743 transitions. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:19,132 INFO L93 Difference]: Finished difference Result 88326 states and 93484 transitions. [2025-01-09 00:20:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1227 [2025-01-09 00:20:19,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:19,194 INFO L225 Difference]: With dead ends: 88326 [2025-01-09 00:20:19,194 INFO L226 Difference]: Without dead ends: 44164 [2025-01-09 00:20:19,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1233 GetRequests, 1227 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:20:19,224 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 533 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:19,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 76 Invalid, 1911 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [236 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:20:19,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44164 states. [2025-01-09 00:20:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44164 to 44164. [2025-01-09 00:20:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44164 states, 44163 states have (on average 1.0461472273169847) internal successors, (46201), 44163 states have internal predecessors, (46201), 0 states have call successors, (0), 0 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-09 00:20:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44164 states to 44164 states and 46201 transitions. [2025-01-09 00:20:19,577 INFO L78 Accepts]: Start accepts. Automaton has 44164 states and 46201 transitions. Word has length 1227 [2025-01-09 00:20:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:19,578 INFO L471 AbstractCegarLoop]: Abstraction has 44164 states and 46201 transitions. [2025-01-09 00:20:19,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 44164 states and 46201 transitions. [2025-01-09 00:20:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1230 [2025-01-09 00:20:19,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:19,589 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:19,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:20:19,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 00:20:19,790 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:19,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2125046799, now seen corresponding path program 1 times [2025-01-09 00:20:19,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:19,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266283935] [2025-01-09 00:20:19,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:19,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:19,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1229 statements into 1 equivalence classes. [2025-01-09 00:20:19,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1229 of 1229 statements. [2025-01-09 00:20:19,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:19,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 330 proven. 694 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2025-01-09 00:20:21,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:21,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266283935] [2025-01-09 00:20:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266283935] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:20:21,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323081947] [2025-01-09 00:20:21,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:21,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:20:21,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:20:21,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:20:21,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:20:21,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1229 statements into 1 equivalence classes. [2025-01-09 00:20:21,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1229 of 1229 statements. [2025-01-09 00:20:21,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:21,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:21,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:20:21,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:20:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 1002 trivial. 0 not checked. [2025-01-09 00:20:21,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:20:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323081947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:21,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:20:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:20:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071457007] [2025-01-09 00:20:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:21,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:21,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:21,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:21,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:20:21,649 INFO L87 Difference]: Start difference. First operand 44164 states and 46201 transitions. Second operand has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 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-09 00:20:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:23,236 INFO L93 Difference]: Finished difference Result 91086 states and 95190 transitions. [2025-01-09 00:20:23,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:23,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 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 1229 [2025-01-09 00:20:23,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:23,277 INFO L225 Difference]: With dead ends: 91086 [2025-01-09 00:20:23,278 INFO L226 Difference]: Without dead ends: 44164 [2025-01-09 00:20:23,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1234 GetRequests, 1229 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:20:23,305 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 627 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:23,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 871 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:20:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44164 states. [2025-01-09 00:20:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44164 to 42784. [2025-01-09 00:20:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42784 states, 42783 states have (on average 1.033798471355445) internal successors, (44229), 42783 states have internal predecessors, (44229), 0 states have call successors, (0), 0 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-09 00:20:23,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 44229 transitions. [2025-01-09 00:20:23,716 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 44229 transitions. Word has length 1229 [2025-01-09 00:20:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:23,717 INFO L471 AbstractCegarLoop]: Abstraction has 42784 states and 44229 transitions. [2025-01-09 00:20:23,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 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-09 00:20:23,717 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 44229 transitions. [2025-01-09 00:20:23,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1242 [2025-01-09 00:20:23,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:23,728 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:20:23,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:20:23,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 00:20:23,928 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:23,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1094342995, now seen corresponding path program 1 times [2025-01-09 00:20:23,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:23,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597677903] [2025-01-09 00:20:23,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:24,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1241 statements into 1 equivalence classes. [2025-01-09 00:20:24,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1241 of 1241 statements. [2025-01-09 00:20:24,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:24,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 683 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-01-09 00:20:24,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:24,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597677903] [2025-01-09 00:20:24,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597677903] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:24,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234104242] [2025-01-09 00:20:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:24,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:24,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:24,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:24,428 INFO L87 Difference]: Start difference. First operand 42784 states and 44229 transitions. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:25,999 INFO L93 Difference]: Finished difference Result 84876 states and 87765 transitions. [2025-01-09 00:20:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:26,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1241 [2025-01-09 00:20:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:26,045 INFO L225 Difference]: With dead ends: 84876 [2025-01-09 00:20:26,045 INFO L226 Difference]: Without dead ends: 42784 [2025-01-09 00:20:26,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:26,070 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 521 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:26,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 848 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:20:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42784 states. [2025-01-09 00:20:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42784 to 42094. [2025-01-09 00:20:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42094 states, 42093 states have (on average 1.0228779131922172) internal successors, (43056), 42093 states have internal predecessors, (43056), 0 states have call successors, (0), 0 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-09 00:20:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42094 states to 42094 states and 43056 transitions. [2025-01-09 00:20:26,612 INFO L78 Accepts]: Start accepts. Automaton has 42094 states and 43056 transitions. Word has length 1241 [2025-01-09 00:20:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:26,613 INFO L471 AbstractCegarLoop]: Abstraction has 42094 states and 43056 transitions. [2025-01-09 00:20:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:20:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 42094 states and 43056 transitions. [2025-01-09 00:20:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1312 [2025-01-09 00:20:26,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:26,627 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:26,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:20:26,627 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:26,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash -635140979, now seen corresponding path program 1 times [2025-01-09 00:20:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783803620] [2025-01-09 00:20:26,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:26,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1311 statements into 1 equivalence classes. [2025-01-09 00:20:26,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1311 of 1311 statements. [2025-01-09 00:20:26,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:26,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2025-01-09 00:20:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783803620] [2025-01-09 00:20:27,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783803620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687021248] [2025-01-09 00:20:27,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:27,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:27,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:27,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:27,150 INFO L87 Difference]: Start difference. First operand 42094 states and 43056 transitions. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-09 00:20:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:28,824 INFO L93 Difference]: Finished difference Result 84876 states and 86806 transitions. [2025-01-09 00:20:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 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 1311 [2025-01-09 00:20:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:28,865 INFO L225 Difference]: With dead ends: 84876 [2025-01-09 00:20:28,866 INFO L226 Difference]: Without dead ends: 42784 [2025-01-09 00:20:28,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:28,890 INFO L435 NwaCegarLoop]: 937 mSDtfsCounter, 605 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:28,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 944 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:20:28,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42784 states. [2025-01-09 00:20:29,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42784 to 41404. [2025-01-09 00:20:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41404 states, 41403 states have (on average 1.0179214066613531) internal successors, (42145), 41403 states have internal predecessors, (42145), 0 states have call successors, (0), 0 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-09 00:20:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41404 states to 41404 states and 42145 transitions. [2025-01-09 00:20:29,309 INFO L78 Accepts]: Start accepts. Automaton has 41404 states and 42145 transitions. Word has length 1311 [2025-01-09 00:20:29,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:29,309 INFO L471 AbstractCegarLoop]: Abstraction has 41404 states and 42145 transitions. [2025-01-09 00:20:29,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 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-09 00:20:29,310 INFO L276 IsEmpty]: Start isEmpty. Operand 41404 states and 42145 transitions. [2025-01-09 00:20:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1627 [2025-01-09 00:20:29,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:29,335 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:20:29,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:20:29,335 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1732611284, now seen corresponding path program 1 times [2025-01-09 00:20:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:29,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549738816] [2025-01-09 00:20:29,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:29,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1626 statements into 1 equivalence classes. [2025-01-09 00:20:29,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1626 of 1626 statements. [2025-01-09 00:20:29,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:29,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:30,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 2490 trivial. 0 not checked. [2025-01-09 00:20:30,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:30,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549738816] [2025-01-09 00:20:30,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549738816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:30,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:30,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:30,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019585877] [2025-01-09 00:20:30,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:30,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:30,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:30,267 INFO L87 Difference]: Start difference. First operand 41404 states and 42145 transitions. Second operand has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-09 00:20:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:32,102 INFO L93 Difference]: Finished difference Result 100056 states and 101967 transitions. [2025-01-09 00:20:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:32,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 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 1626 [2025-01-09 00:20:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:32,168 INFO L225 Difference]: With dead ends: 100056 [2025-01-09 00:20:32,169 INFO L226 Difference]: Without dead ends: 58654 [2025-01-09 00:20:32,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:32,199 INFO L435 NwaCegarLoop]: 978 mSDtfsCounter, 687 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:32,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 985 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:20:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58654 states. [2025-01-09 00:20:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58654 to 57964. [2025-01-09 00:20:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57964 states, 57963 states have (on average 1.0157514276348705) internal successors, (58876), 57963 states have internal predecessors, (58876), 0 states have call successors, (0), 0 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-09 00:20:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57964 states to 57964 states and 58876 transitions. [2025-01-09 00:20:32,860 INFO L78 Accepts]: Start accepts. Automaton has 57964 states and 58876 transitions. Word has length 1626 [2025-01-09 00:20:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:32,861 INFO L471 AbstractCegarLoop]: Abstraction has 57964 states and 58876 transitions. [2025-01-09 00:20:32,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-09 00:20:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 57964 states and 58876 transitions. [2025-01-09 00:20:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1701 [2025-01-09 00:20:33,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:33,059 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:33,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:20:33,059 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:33,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 971813659, now seen corresponding path program 1 times [2025-01-09 00:20:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:33,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158289417] [2025-01-09 00:20:33,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:33,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1700 statements into 1 equivalence classes. [2025-01-09 00:20:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1700 of 1700 statements. [2025-01-09 00:20:33,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:33,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:20:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 1867 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-01-09 00:20:34,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:20:34,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158289417] [2025-01-09 00:20:34,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158289417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:20:34,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:20:34,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:20:34,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363745306] [2025-01-09 00:20:34,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:20:34,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:20:34,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:20:34,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:20:34,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:34,236 INFO L87 Difference]: Start difference. First operand 57964 states and 58876 transitions. Second operand has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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-09 00:20:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:20:36,142 INFO L93 Difference]: Finished difference Result 140766 states and 143175 transitions. [2025-01-09 00:20:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:20:36,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 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 1700 [2025-01-09 00:20:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:20:36,221 INFO L225 Difference]: With dead ends: 140766 [2025-01-09 00:20:36,221 INFO L226 Difference]: Without dead ends: 83494 [2025-01-09 00:20:36,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:20:36,256 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 614 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:20:36,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 252 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:20:36,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83494 states. [2025-01-09 00:20:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83494 to 82804. [2025-01-09 00:20:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82804 states, 82803 states have (on average 1.0154221465405844) internal successors, (84080), 82803 states have internal predecessors, (84080), 0 states have call successors, (0), 0 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-09 00:20:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82804 states to 82804 states and 84080 transitions. [2025-01-09 00:20:36,989 INFO L78 Accepts]: Start accepts. Automaton has 82804 states and 84080 transitions. Word has length 1700 [2025-01-09 00:20:36,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:20:36,990 INFO L471 AbstractCegarLoop]: Abstraction has 82804 states and 84080 transitions. [2025-01-09 00:20:36,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 358.6666666666667) internal successors, (1076), 3 states have internal predecessors, (1076), 0 states have call successors, (0), 0 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-09 00:20:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 82804 states and 84080 transitions. [2025-01-09 00:20:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2025-01-09 00:20:37,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:20:37,192 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:20:37,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:20:37,192 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:20:37,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:20:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1368444307, now seen corresponding path program 1 times [2025-01-09 00:20:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:20:37,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156334707] [2025-01-09 00:20:37,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:20:37,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:20:37,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1860 statements into 1 equivalence classes. [2025-01-09 00:20:37,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1860 of 1860 statements. [2025-01-09 00:20:37,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:20:37,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat