./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem15_label04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7526302199d1f3bb6abcb37def785df856d340db371e981c5460527e95177be0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:07:36,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:07:36,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:07:36,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:07:36,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:07:36,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:07:36,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:07:36,467 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:07:36,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:07:36,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:07:36,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:07:36,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:07:36,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:07:36,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:07:36,469 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:07:36,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:07:36,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:07:36,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:36,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:07:36,471 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:07:36,472 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7526302199d1f3bb6abcb37def785df856d340db371e981c5460527e95177be0 [2025-03-16 15:07:36,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:07:36,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:07:36,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:07:36,701 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:07:36,701 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:07:36,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label04.c [2025-03-16 15:07:37,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcefca7fd/a31c57b5e01b4880a4bff1f7d9eb7cd6/FLAG518e5576e [2025-03-16 15:07:38,173 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:07:38,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label04.c [2025-03-16 15:07:38,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcefca7fd/a31c57b5e01b4880a4bff1f7d9eb7cd6/FLAG518e5576e [2025-03-16 15:07:38,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcefca7fd/a31c57b5e01b4880a4bff1f7d9eb7cd6 [2025-03-16 15:07:38,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:07:38,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:07:38,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:38,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:07:38,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:07:38,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:38,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7b4e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38, skipping insertion in model container [2025-03-16 15:07:38,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:38,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:07:38,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label04.c[3915,3928] [2025-03-16 15:07:38,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:38,612 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:07:38,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label04.c[3915,3928] [2025-03-16 15:07:38,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:38,756 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:07:38,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38 WrapperNode [2025-03-16 15:07:38,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:38,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:38,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:07:38,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:07:38,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:38,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:38,918 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-03-16 15:07:38,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:38,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:07:38,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:07:38,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:07:38,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:38,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:38,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,039 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:07:39,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:07:39,145 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:07:39,145 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:07:39,145 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:07:39,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (1/1) ... [2025-03-16 15:07:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:39,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:07:39,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:07:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:07:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:07:39,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:07:39,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:07:39,234 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:07:39,235 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:07:41,003 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-03-16 15:07:41,084 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-03-16 15:07:41,084 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:07:41,104 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:07:41,104 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:07:41,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:41 BoogieIcfgContainer [2025-03-16 15:07:41,104 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:07:41,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:07:41,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:07:41,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:07:41,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:07:38" (1/3) ... [2025-03-16 15:07:41,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31747256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:41, skipping insertion in model container [2025-03-16 15:07:41,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:38" (2/3) ... [2025-03-16 15:07:41,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31747256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:41, skipping insertion in model container [2025-03-16 15:07:41,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:41" (3/3) ... [2025-03-16 15:07:41,112 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label04.c [2025-03-16 15:07:41,126 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:07:41,127 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label04.c that has 1 procedures, 363 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:07:41,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:07:41,206 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;@29d4b2fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:07:41,207 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:07:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 15:07:41,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:41,217 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:41,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:41,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1340588803, now seen corresponding path program 1 times [2025-03-16 15:07:41,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:41,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917879459] [2025-03-16 15:07:41,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:41,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 15:07:41,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 15:07:41,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:41,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:41,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:41,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917879459] [2025-03-16 15:07:41,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917879459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:41,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:41,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:41,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814526148] [2025-03-16 15:07:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:07:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:41,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:07:41,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:41,352 INFO L87 Difference]: Start difference. First operand has 363 states, 361 states have (on average 1.9058171745152355) internal successors, (688), 362 states have internal predecessors, (688), 0 states have call successors, (0), 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 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:41,386 INFO L93 Difference]: Finished difference Result 725 states and 1375 transitions. [2025-03-16 15:07:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:07:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 15:07:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:41,396 INFO L225 Difference]: With dead ends: 725 [2025-03-16 15:07:41,396 INFO L226 Difference]: Without dead ends: 360 [2025-03-16 15:07:41,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:41,401 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:41,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:07:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-16 15:07:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-16 15:07:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2025-03-16 15:07:41,441 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 30 [2025-03-16 15:07:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:41,441 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2025-03-16 15:07:41,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2025-03-16 15:07:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-16 15:07:41,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:41,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:41,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:07:41,445 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:41,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:41,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2024899169, now seen corresponding path program 1 times [2025-03-16 15:07:41,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:41,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443207466] [2025-03-16 15:07:41,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:41,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-16 15:07:41,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-16 15:07:41,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:41,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:41,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443207466] [2025-03-16 15:07:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443207466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:41,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:41,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093412520] [2025-03-16 15:07:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:41,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:41,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:41,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:41,599 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:42,876 INFO L93 Difference]: Finished difference Result 1025 states and 1788 transitions. [2025-03-16 15:07:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:42,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-16 15:07:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:42,880 INFO L225 Difference]: With dead ends: 1025 [2025-03-16 15:07:42,880 INFO L226 Difference]: Without dead ends: 666 [2025-03-16 15:07:42,883 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-03-16 15:07:42,885 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 297 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:42,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:07:42,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-16 15:07:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 664. [2025-03-16 15:07:42,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 1.4796380090497738) internal successors, (981), 663 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2025-03-16 15:07:42,919 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 30 [2025-03-16 15:07:42,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:42,919 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2025-03-16 15:07:42,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,919 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2025-03-16 15:07:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:07:42,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:42,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:07:42,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:42,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -701794021, now seen corresponding path program 1 times [2025-03-16 15:07:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286002603] [2025-03-16 15:07:42,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:42,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:07:42,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:07:42,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:42,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:43,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286002603] [2025-03-16 15:07:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286002603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:43,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067969577] [2025-03-16 15:07:43,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:43,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:43,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:43,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:43,133 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:44,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:44,503 INFO L93 Difference]: Finished difference Result 1954 states and 2893 transitions. [2025-03-16 15:07:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:44,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 15:07:44,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:44,508 INFO L225 Difference]: With dead ends: 1954 [2025-03-16 15:07:44,508 INFO L226 Difference]: Without dead ends: 1291 [2025-03-16 15:07:44,508 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-03-16 15:07:44,509 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:44,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 324 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:07:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-03-16 15:07:44,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1281. [2025-03-16 15:07:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39921875) internal successors, (1791), 1280 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:44,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1791 transitions. [2025-03-16 15:07:44,530 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1791 transitions. Word has length 105 [2025-03-16 15:07:44,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:44,531 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1791 transitions. [2025-03-16 15:07:44,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:44,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1791 transitions. [2025-03-16 15:07:44,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 15:07:44,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:44,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:44,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:44,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -427125275, now seen corresponding path program 1 times [2025-03-16 15:07:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776845622] [2025-03-16 15:07:44,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:44,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 15:07:44,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 15:07:44,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:44,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776845622] [2025-03-16 15:07:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776845622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:44,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802597260] [2025-03-16 15:07:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:44,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:44,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:44,689 INFO L87 Difference]: Start difference. First operand 1281 states and 1791 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:45,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:45,773 INFO L93 Difference]: Finished difference Result 3765 states and 5263 transitions. [2025-03-16 15:07:45,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 15:07:45,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:45,780 INFO L225 Difference]: With dead ends: 3765 [2025-03-16 15:07:45,781 INFO L226 Difference]: Without dead ends: 2485 [2025-03-16 15:07:45,782 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-03-16 15:07:45,783 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 271 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:45,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:07:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2485 states. [2025-03-16 15:07:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2485 to 2181. [2025-03-16 15:07:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2181 states, 2180 states have (on average 1.2825688073394494) internal successors, (2796), 2180 states have internal predecessors, (2796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2796 transitions. [2025-03-16 15:07:45,816 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2796 transitions. Word has length 109 [2025-03-16 15:07:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:45,816 INFO L471 AbstractCegarLoop]: Abstraction has 2181 states and 2796 transitions. [2025-03-16 15:07:45,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2796 transitions. [2025-03-16 15:07:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 15:07:45,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:45,821 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:45,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:07:45,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:45,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1448366700, now seen corresponding path program 1 times [2025-03-16 15:07:45,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:45,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415258223] [2025-03-16 15:07:45,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:45,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:45,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 15:07:45,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 15:07:45,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:45,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:46,040 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:46,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:46,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415258223] [2025-03-16 15:07:46,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415258223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:46,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:46,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:46,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837187192] [2025-03-16 15:07:46,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:46,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:46,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:46,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:46,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:46,042 INFO L87 Difference]: Start difference. First operand 2181 states and 2796 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:47,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:47,434 INFO L93 Difference]: Finished difference Result 5566 states and 7271 transitions. [2025-03-16 15:07:47,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 15:07:47,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:47,444 INFO L225 Difference]: With dead ends: 5566 [2025-03-16 15:07:47,444 INFO L226 Difference]: Without dead ends: 3386 [2025-03-16 15:07:47,447 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-03-16 15:07:47,448 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 297 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:47,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 612 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:07:47,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-03-16 15:07:47,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3384. [2025-03-16 15:07:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 3383 states have (on average 1.2166715932604197) internal successors, (4116), 3383 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4116 transitions. [2025-03-16 15:07:47,496 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4116 transitions. Word has length 226 [2025-03-16 15:07:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:47,497 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 4116 transitions. [2025-03-16 15:07:47,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4116 transitions. [2025-03-16 15:07:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 15:07:47,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:47,500 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:47,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:07:47,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:47,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1588803416, now seen corresponding path program 1 times [2025-03-16 15:07:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383352237] [2025-03-16 15:07:47,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:47,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 15:07:47,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 15:07:47,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:47,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:07:47,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:47,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383352237] [2025-03-16 15:07:47,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383352237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:47,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:47,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:47,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378960120] [2025-03-16 15:07:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:47,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:47,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:47,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:47,779 INFO L87 Difference]: Start difference. First operand 3384 states and 4116 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:48,922 INFO L93 Difference]: Finished difference Result 8869 states and 10892 transitions. [2025-03-16 15:07:48,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:48,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 300 [2025-03-16 15:07:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:48,935 INFO L225 Difference]: With dead ends: 8869 [2025-03-16 15:07:48,935 INFO L226 Difference]: Without dead ends: 5486 [2025-03-16 15:07:48,938 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-03-16 15:07:48,940 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 43 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:48,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 315 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:07:48,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5486 states. [2025-03-16 15:07:48,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5486 to 5483. [2025-03-16 15:07:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 5482 states have (on average 1.175665815395841) internal successors, (6445), 5482 states have internal predecessors, (6445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 6445 transitions. [2025-03-16 15:07:49,009 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 6445 transitions. Word has length 300 [2025-03-16 15:07:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:49,009 INFO L471 AbstractCegarLoop]: Abstraction has 5483 states and 6445 transitions. [2025-03-16 15:07:49,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 6445 transitions. [2025-03-16 15:07:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-16 15:07:49,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:49,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:49,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:07:49,013 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:49,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1345441454, now seen corresponding path program 1 times [2025-03-16 15:07:49,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:49,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944783143] [2025-03-16 15:07:49,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:49,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:49,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-16 15:07:49,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-16 15:07:49,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:49,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:49,314 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:07:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944783143] [2025-03-16 15:07:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944783143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:49,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:49,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:49,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764396385] [2025-03-16 15:07:49,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:49,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:49,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:49,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:49,316 INFO L87 Difference]: Start difference. First operand 5483 states and 6445 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:50,484 INFO L93 Difference]: Finished difference Result 13064 states and 15604 transitions. [2025-03-16 15:07:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 376 [2025-03-16 15:07:50,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:50,500 INFO L225 Difference]: With dead ends: 13064 [2025-03-16 15:07:50,500 INFO L226 Difference]: Without dead ends: 7582 [2025-03-16 15:07:50,505 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-03-16 15:07:50,506 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 296 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:50,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 639 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:07:50,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7582 states. [2025-03-16 15:07:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7582 to 6984. [2025-03-16 15:07:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6984 states, 6983 states have (on average 1.1542317055706717) internal successors, (8060), 6983 states have internal predecessors, (8060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6984 states to 6984 states and 8060 transitions. [2025-03-16 15:07:50,612 INFO L78 Accepts]: Start accepts. Automaton has 6984 states and 8060 transitions. Word has length 376 [2025-03-16 15:07:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:50,612 INFO L471 AbstractCegarLoop]: Abstraction has 6984 states and 8060 transitions. [2025-03-16 15:07:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6984 states and 8060 transitions. [2025-03-16 15:07:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-16 15:07:50,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:50,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:50,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:07:50,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:50,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:50,618 INFO L85 PathProgramCache]: Analyzing trace with hash -205173121, now seen corresponding path program 1 times [2025-03-16 15:07:50,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:50,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032782530] [2025-03-16 15:07:50,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:50,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-16 15:07:50,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-16 15:07:50,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:50,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 15:07:50,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:50,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032782530] [2025-03-16 15:07:50,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032782530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:50,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:50,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532170255] [2025-03-16 15:07:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:50,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:50,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:50,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:50,923 INFO L87 Difference]: Start difference. First operand 6984 states and 8060 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:52,081 INFO L93 Difference]: Finished difference Result 16658 states and 19426 transitions. [2025-03-16 15:07:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 391 [2025-03-16 15:07:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:52,101 INFO L225 Difference]: With dead ends: 16658 [2025-03-16 15:07:52,102 INFO L226 Difference]: Without dead ends: 9675 [2025-03-16 15:07:52,107 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-03-16 15:07:52,108 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 284 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:52,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 314 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:07:52,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9675 states. [2025-03-16 15:07:52,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9675 to 6380. [2025-03-16 15:07:52,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6380 states, 6379 states have (on average 1.1638187803730993) internal successors, (7424), 6379 states have internal predecessors, (7424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6380 states to 6380 states and 7424 transitions. [2025-03-16 15:07:52,186 INFO L78 Accepts]: Start accepts. Automaton has 6380 states and 7424 transitions. Word has length 391 [2025-03-16 15:07:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:52,187 INFO L471 AbstractCegarLoop]: Abstraction has 6380 states and 7424 transitions. [2025-03-16 15:07:52,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6380 states and 7424 transitions. [2025-03-16 15:07:52,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-03-16 15:07:52,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:52,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:07:52,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2072673997, now seen corresponding path program 1 times [2025-03-16 15:07:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374543622] [2025-03-16 15:07:52,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:52,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-03-16 15:07:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-03-16 15:07:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:52,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374543622] [2025-03-16 15:07:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374543622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:52,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068885451] [2025-03-16 15:07:52,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:52,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:52,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:52,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:52,435 INFO L87 Difference]: Start difference. First operand 6380 states and 7424 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:53,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:53,623 INFO L93 Difference]: Finished difference Result 14559 states and 17232 transitions. [2025-03-16 15:07:53,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:53,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 393 [2025-03-16 15:07:53,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:53,635 INFO L225 Difference]: With dead ends: 14559 [2025-03-16 15:07:53,635 INFO L226 Difference]: Without dead ends: 8180 [2025-03-16 15:07:53,639 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-03-16 15:07:53,640 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 248 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:53,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 627 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:07:53,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8180 states. [2025-03-16 15:07:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8180 to 7577. [2025-03-16 15:07:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.1498152059134108) internal successors, (8711), 7576 states have internal predecessors, (8711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8711 transitions. [2025-03-16 15:07:53,702 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8711 transitions. Word has length 393 [2025-03-16 15:07:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:53,703 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8711 transitions. [2025-03-16 15:07:53,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8711 transitions. [2025-03-16 15:07:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2025-03-16 15:07:53,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:53,706 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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] [2025-03-16 15:07:53,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:07:53,707 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:53,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1405096850, now seen corresponding path program 1 times [2025-03-16 15:07:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:53,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379259785] [2025-03-16 15:07:53,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:53,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 420 statements into 1 equivalence classes. [2025-03-16 15:07:53,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 420 of 420 statements. [2025-03-16 15:07:53,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:53,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-16 15:07:54,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:54,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379259785] [2025-03-16 15:07:54,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379259785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:54,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:54,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:54,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448369664] [2025-03-16 15:07:54,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:54,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:54,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:54,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:54,119 INFO L87 Difference]: Start difference. First operand 7577 states and 8711 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:54,971 INFO L93 Difference]: Finished difference Result 15452 states and 17732 transitions. [2025-03-16 15:07:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:54,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 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 420 [2025-03-16 15:07:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:54,986 INFO L225 Difference]: With dead ends: 15452 [2025-03-16 15:07:54,986 INFO L226 Difference]: Without dead ends: 7876 [2025-03-16 15:07:54,992 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-03-16 15:07:54,992 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:54,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 353 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:07:54,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2025-03-16 15:07:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 7876. [2025-03-16 15:07:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7876 states, 7875 states have (on average 1.1448888888888888) internal successors, (9016), 7875 states have internal predecessors, (9016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7876 states to 7876 states and 9016 transitions. [2025-03-16 15:07:55,050 INFO L78 Accepts]: Start accepts. Automaton has 7876 states and 9016 transitions. Word has length 420 [2025-03-16 15:07:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:55,051 INFO L471 AbstractCegarLoop]: Abstraction has 7876 states and 9016 transitions. [2025-03-16 15:07:55,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand 7876 states and 9016 transitions. [2025-03-16 15:07:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-16 15:07:55,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:55,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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] [2025-03-16 15:07:55,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:07:55,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:55,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:55,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1993791910, now seen corresponding path program 1 times [2025-03-16 15:07:55,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:55,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497867531] [2025-03-16 15:07:55,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:55,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:55,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-16 15:07:55,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-16 15:07:55,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-03-16 15:07:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497867531] [2025-03-16 15:07:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497867531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:55,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:55,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:55,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133060209] [2025-03-16 15:07:55,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:55,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:55,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:55,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:55,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:55,278 INFO L87 Difference]: Start difference. First operand 7876 states and 9016 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:56,350 INFO L93 Difference]: Finished difference Result 17843 states and 20683 transitions. [2025-03-16 15:07:56,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:56,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 494 [2025-03-16 15:07:56,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:56,363 INFO L225 Difference]: With dead ends: 17843 [2025-03-16 15:07:56,363 INFO L226 Difference]: Without dead ends: 10267 [2025-03-16 15:07:56,370 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-03-16 15:07:56,370 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 384 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:56,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 444 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:07:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2025-03-16 15:07:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 10267. [2025-03-16 15:07:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10267 states, 10266 states have (on average 1.146990064289889) internal successors, (11775), 10266 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10267 states to 10267 states and 11775 transitions. [2025-03-16 15:07:56,459 INFO L78 Accepts]: Start accepts. Automaton has 10267 states and 11775 transitions. Word has length 494 [2025-03-16 15:07:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:56,459 INFO L471 AbstractCegarLoop]: Abstraction has 10267 states and 11775 transitions. [2025-03-16 15:07:56,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:56,460 INFO L276 IsEmpty]: Start isEmpty. Operand 10267 states and 11775 transitions. [2025-03-16 15:07:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-03-16 15:07:56,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:56,463 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:56,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:07:56,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:56,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1812778971, now seen corresponding path program 1 times [2025-03-16 15:07:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966485716] [2025-03-16 15:07:56,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:56,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:56,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-03-16 15:07:56,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-03-16 15:07:56,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:56,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-16 15:07:56,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966485716] [2025-03-16 15:07:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966485716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:56,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:56,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659982575] [2025-03-16 15:07:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:56,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:56,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:56,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:56,874 INFO L87 Difference]: Start difference. First operand 10267 states and 11775 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:58,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:58,085 INFO L93 Difference]: Finished difference Result 25032 states and 28939 transitions. [2025-03-16 15:07:58,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:58,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 518 [2025-03-16 15:07:58,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:58,102 INFO L225 Difference]: With dead ends: 25032 [2025-03-16 15:07:58,102 INFO L226 Difference]: Without dead ends: 15065 [2025-03-16 15:07:58,113 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-03-16 15:07:58,113 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:58,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:07:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15065 states. [2025-03-16 15:07:58,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15065 to 14456. [2025-03-16 15:07:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14456 states, 14455 states have (on average 1.1329643721895537) internal successors, (16377), 14455 states have internal predecessors, (16377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14456 states to 14456 states and 16377 transitions. [2025-03-16 15:07:58,247 INFO L78 Accepts]: Start accepts. Automaton has 14456 states and 16377 transitions. Word has length 518 [2025-03-16 15:07:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:58,248 INFO L471 AbstractCegarLoop]: Abstraction has 14456 states and 16377 transitions. [2025-03-16 15:07:58,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14456 states and 16377 transitions. [2025-03-16 15:07:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2025-03-16 15:07:58,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:58,254 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:58,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:07:58,255 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:58,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2112193133, now seen corresponding path program 1 times [2025-03-16 15:07:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328867009] [2025-03-16 15:07:58,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:58,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-16 15:07:58,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-16 15:07:58,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:58,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:58,714 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 554 proven. 39 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-16 15:07:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328867009] [2025-03-16 15:07:58,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328867009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:58,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89352157] [2025-03-16 15:07:58,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:58,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:58,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:58,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:58,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:07:58,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 585 statements into 1 equivalence classes. [2025-03-16 15:07:58,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 585 of 585 statements. [2025-03-16 15:07:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:58,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 15:07:58,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 554 proven. 39 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-16 15:07:59,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 554 proven. 39 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-16 15:08:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89352157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:08:00,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:08:00,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-16 15:08:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296624046] [2025-03-16 15:08:00,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:08:00,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 15:08:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:00,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 15:08:00,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:08:00,142 INFO L87 Difference]: Start difference. First operand 14456 states and 16377 transitions. Second operand has 9 states, 9 states have (on average 80.44444444444444) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:04,078 INFO L93 Difference]: Finished difference Result 36946 states and 41591 transitions. [2025-03-16 15:08:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 15:08:04,078 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.44444444444444) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 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 585 [2025-03-16 15:08:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:04,094 INFO L225 Difference]: With dead ends: 36946 [2025-03-16 15:08:04,094 INFO L226 Difference]: Without dead ends: 17148 [2025-03-16 15:08:04,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1179 GetRequests, 1165 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:08:04,106 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 3101 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4786 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3101 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 5495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 4786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:04,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3101 Valid, 200 Invalid, 5495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 4786 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-16 15:08:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17148 states. [2025-03-16 15:08:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17148 to 12660. [2025-03-16 15:08:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12660 states, 12659 states have (on average 1.0695157595386682) internal successors, (13539), 12659 states have internal predecessors, (13539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12660 states to 12660 states and 13539 transitions. [2025-03-16 15:08:04,220 INFO L78 Accepts]: Start accepts. Automaton has 12660 states and 13539 transitions. Word has length 585 [2025-03-16 15:08:04,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:04,221 INFO L471 AbstractCegarLoop]: Abstraction has 12660 states and 13539 transitions. [2025-03-16 15:08:04,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.44444444444444) internal successors, (724), 8 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 12660 states and 13539 transitions. [2025-03-16 15:08:04,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2025-03-16 15:08:04,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:04,226 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:04,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:08:04,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 15:08:04,428 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:04,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1660689934, now seen corresponding path program 1 times [2025-03-16 15:08:04,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:04,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455093339] [2025-03-16 15:08:04,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:04,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes. [2025-03-16 15:08:04,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements. [2025-03-16 15:08:04,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-16 15:08:04,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455093339] [2025-03-16 15:08:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455093339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738221684] [2025-03-16 15:08:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:04,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:04,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:04,671 INFO L87 Difference]: Start difference. First operand 12660 states and 13539 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:05,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:05,295 INFO L93 Difference]: Finished difference Result 25317 states and 27087 transitions. [2025-03-16 15:08:05,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:05,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 610 [2025-03-16 15:08:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:05,307 INFO L225 Difference]: With dead ends: 25317 [2025-03-16 15:08:05,307 INFO L226 Difference]: Without dead ends: 12957 [2025-03-16 15:08:05,314 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-03-16 15:08:05,315 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 436 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:05,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 68 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12957 states. [2025-03-16 15:08:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12957 to 12658. [2025-03-16 15:08:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12658 states, 12657 states have (on average 1.0693687287666904) internal successors, (13535), 12657 states have internal predecessors, (13535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12658 states to 12658 states and 13535 transitions. [2025-03-16 15:08:05,414 INFO L78 Accepts]: Start accepts. Automaton has 12658 states and 13535 transitions. Word has length 610 [2025-03-16 15:08:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:05,415 INFO L471 AbstractCegarLoop]: Abstraction has 12658 states and 13535 transitions. [2025-03-16 15:08:05,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:05,415 INFO L276 IsEmpty]: Start isEmpty. Operand 12658 states and 13535 transitions. [2025-03-16 15:08:05,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-03-16 15:08:05,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:05,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:05,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:08:05,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:05,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:05,422 INFO L85 PathProgramCache]: Analyzing trace with hash -521304622, now seen corresponding path program 1 times [2025-03-16 15:08:05,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:05,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363619975] [2025-03-16 15:08:05,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:05,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:05,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-03-16 15:08:05,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-03-16 15:08:05,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:05,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-16 15:08:05,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:05,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363619975] [2025-03-16 15:08:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363619975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:05,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825500436] [2025-03-16 15:08:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:05,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:05,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:05,962 INFO L87 Difference]: Start difference. First operand 12658 states and 13535 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:06,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:06,578 INFO L93 Difference]: Finished difference Result 25321 states and 27076 transitions. [2025-03-16 15:08:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:06,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 631 [2025-03-16 15:08:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:06,588 INFO L225 Difference]: With dead ends: 25321 [2025-03-16 15:08:06,589 INFO L226 Difference]: Without dead ends: 12664 [2025-03-16 15:08:06,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03-16 15:08:06,595 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 343 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:06,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 137 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12664 states. [2025-03-16 15:08:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12664 to 12060. [2025-03-16 15:08:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12060 states, 12059 states have (on average 1.0557260137656521) internal successors, (12731), 12059 states have internal predecessors, (12731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:06,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12060 states to 12060 states and 12731 transitions. [2025-03-16 15:08:06,679 INFO L78 Accepts]: Start accepts. Automaton has 12060 states and 12731 transitions. Word has length 631 [2025-03-16 15:08:06,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:06,679 INFO L471 AbstractCegarLoop]: Abstraction has 12060 states and 12731 transitions. [2025-03-16 15:08:06,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:06,679 INFO L276 IsEmpty]: Start isEmpty. Operand 12060 states and 12731 transitions. [2025-03-16 15:08:06,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2025-03-16 15:08:06,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:06,685 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:06,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:08:06,685 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:06,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:06,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1248982168, now seen corresponding path program 1 times [2025-03-16 15:08:06,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:06,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638092759] [2025-03-16 15:08:06,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:06,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:06,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 655 statements into 1 equivalence classes. [2025-03-16 15:08:06,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 655 of 655 statements. [2025-03-16 15:08:06,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:06,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 546 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-03-16 15:08:06,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:06,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638092759] [2025-03-16 15:08:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638092759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:06,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:06,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656967251] [2025-03-16 15:08:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:06,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:06,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:06,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:06,985 INFO L87 Difference]: Start difference. First operand 12060 states and 12731 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:07,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:07,875 INFO L93 Difference]: Finished difference Result 27106 states and 28670 transitions. [2025-03-16 15:08:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 655 [2025-03-16 15:08:07,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:07,890 INFO L225 Difference]: With dead ends: 27106 [2025-03-16 15:08:07,890 INFO L226 Difference]: Without dead ends: 15047 [2025-03-16 15:08:07,899 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-03-16 15:08:07,899 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 304 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:07,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 182 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:07,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15047 states. [2025-03-16 15:08:08,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15047 to 14149. [2025-03-16 15:08:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14149 states, 14148 states have (on average 1.0499717274526434) internal successors, (14855), 14148 states have internal predecessors, (14855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 14855 transitions. [2025-03-16 15:08:08,070 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 14855 transitions. Word has length 655 [2025-03-16 15:08:08,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:08,071 INFO L471 AbstractCegarLoop]: Abstraction has 14149 states and 14855 transitions. [2025-03-16 15:08:08,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 14855 transitions. [2025-03-16 15:08:08,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2025-03-16 15:08:08,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:08,080 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:08,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:08:08,080 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:08,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 919136090, now seen corresponding path program 1 times [2025-03-16 15:08:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584914023] [2025-03-16 15:08:08,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:08,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-16 15:08:08,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-16 15:08:08,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:08,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 530 proven. 190 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 15:08:08,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:08,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584914023] [2025-03-16 15:08:08,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584914023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:08,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159340057] [2025-03-16 15:08:08,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:08,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:08,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:08,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:08,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:08:08,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 662 statements into 1 equivalence classes. [2025-03-16 15:08:08,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 662 of 662 statements. [2025-03-16 15:08:08,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:08,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:08,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:08,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-16 15:08:09,105 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:09,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159340057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:09,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:09,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217068546] [2025-03-16 15:08:09,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:09,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:09,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:09,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:09,107 INFO L87 Difference]: Start difference. First operand 14149 states and 14855 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:09,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:09,974 INFO L93 Difference]: Finished difference Result 32805 states and 34514 transitions. [2025-03-16 15:08:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:09,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 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 662 [2025-03-16 15:08:09,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:09,992 INFO L225 Difference]: With dead ends: 32805 [2025-03-16 15:08:09,992 INFO L226 Difference]: Without dead ends: 18657 [2025-03-16 15:08:10,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:10,003 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 309 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:10,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 480 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18657 states. [2025-03-16 15:08:10,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18657 to 18646. [2025-03-16 15:08:10,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18646 states, 18645 states have (on average 1.0490211853043712) internal successors, (19559), 18645 states have internal predecessors, (19559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18646 states to 18646 states and 19559 transitions. [2025-03-16 15:08:10,172 INFO L78 Accepts]: Start accepts. Automaton has 18646 states and 19559 transitions. Word has length 662 [2025-03-16 15:08:10,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:10,173 INFO L471 AbstractCegarLoop]: Abstraction has 18646 states and 19559 transitions. [2025-03-16 15:08:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18646 states and 19559 transitions. [2025-03-16 15:08:10,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-03-16 15:08:10,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:10,179 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:10,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:08:10,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 15:08:10,380 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:10,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1364982149, now seen corresponding path program 1 times [2025-03-16 15:08:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:10,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892062377] [2025-03-16 15:08:10,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:10,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:10,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-03-16 15:08:10,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-03-16 15:08:10,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:10,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 15:08:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:10,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892062377] [2025-03-16 15:08:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892062377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:10,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462483320] [2025-03-16 15:08:10,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:10,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:10,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:10,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:10,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:10,715 INFO L87 Difference]: Start difference. First operand 18646 states and 19559 transitions. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:11,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:11,584 INFO L93 Difference]: Finished difference Result 42972 states and 45191 transitions. [2025-03-16 15:08:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 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 696 [2025-03-16 15:08:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:11,607 INFO L225 Difference]: With dead ends: 42972 [2025-03-16 15:08:11,607 INFO L226 Difference]: Without dead ends: 24327 [2025-03-16 15:08:11,620 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-03-16 15:08:11,621 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:11,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 158 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:11,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24327 states. [2025-03-16 15:08:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24327 to 22832. [2025-03-16 15:08:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22832 states, 22831 states have (on average 1.0479611055144322) internal successors, (23926), 22831 states have internal predecessors, (23926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22832 states to 22832 states and 23926 transitions. [2025-03-16 15:08:11,775 INFO L78 Accepts]: Start accepts. Automaton has 22832 states and 23926 transitions. Word has length 696 [2025-03-16 15:08:11,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:11,775 INFO L471 AbstractCegarLoop]: Abstraction has 22832 states and 23926 transitions. [2025-03-16 15:08:11,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 22832 states and 23926 transitions. [2025-03-16 15:08:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-03-16 15:08:11,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:11,782 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:11,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:08:11,782 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:11,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:11,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2120942033, now seen corresponding path program 1 times [2025-03-16 15:08:11,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:11,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216104648] [2025-03-16 15:08:11,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:11,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:11,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-16 15:08:11,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-16 15:08:11,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:11,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2025-03-16 15:08:12,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:12,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216104648] [2025-03-16 15:08:12,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216104648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:12,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:12,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468297238] [2025-03-16 15:08:12,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:12,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:12,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:12,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:12,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:12,230 INFO L87 Difference]: Start difference. First operand 22832 states and 23926 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:13,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:13,081 INFO L93 Difference]: Finished difference Result 45969 states and 48159 transitions. [2025-03-16 15:08:13,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:13,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 712 [2025-03-16 15:08:13,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:13,103 INFO L225 Difference]: With dead ends: 45969 [2025-03-16 15:08:13,103 INFO L226 Difference]: Without dead ends: 23138 [2025-03-16 15:08:13,114 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-03-16 15:08:13,115 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 293 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:13,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 527 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:08:13,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23138 states. [2025-03-16 15:08:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23138 to 22532. [2025-03-16 15:08:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22532 states, 22531 states have (on average 1.0469575251875194) internal successors, (23589), 22531 states have internal predecessors, (23589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22532 states to 22532 states and 23589 transitions. [2025-03-16 15:08:13,269 INFO L78 Accepts]: Start accepts. Automaton has 22532 states and 23589 transitions. Word has length 712 [2025-03-16 15:08:13,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:13,269 INFO L471 AbstractCegarLoop]: Abstraction has 22532 states and 23589 transitions. [2025-03-16 15:08:13,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22532 states and 23589 transitions. [2025-03-16 15:08:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-03-16 15:08:13,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:13,277 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:13,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:08:13,277 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:13,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash 841938222, now seen corresponding path program 1 times [2025-03-16 15:08:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509394419] [2025-03-16 15:08:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:13,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:13,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-03-16 15:08:13,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-03-16 15:08:13,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:13,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-16 15:08:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:13,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509394419] [2025-03-16 15:08:13,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509394419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:13,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:13,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:13,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930462382] [2025-03-16 15:08:13,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:13,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:13,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:13,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:13,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:13,738 INFO L87 Difference]: Start difference. First operand 22532 states and 23589 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:14,442 INFO L93 Difference]: Finished difference Result 48666 states and 51076 transitions. [2025-03-16 15:08:14,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:14,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 726 [2025-03-16 15:08:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:14,467 INFO L225 Difference]: With dead ends: 48666 [2025-03-16 15:08:14,467 INFO L226 Difference]: Without dead ends: 26434 [2025-03-16 15:08:14,480 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-03-16 15:08:14,480 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 173 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:14,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 543 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26434 states. [2025-03-16 15:08:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26434 to 25536. [2025-03-16 15:08:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25536 states, 25535 states have (on average 1.044644605443509) internal successors, (26675), 25535 states have internal predecessors, (26675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25536 states to 25536 states and 26675 transitions. [2025-03-16 15:08:14,759 INFO L78 Accepts]: Start accepts. Automaton has 25536 states and 26675 transitions. Word has length 726 [2025-03-16 15:08:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 25536 states and 26675 transitions. [2025-03-16 15:08:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:14,760 INFO L276 IsEmpty]: Start isEmpty. Operand 25536 states and 26675 transitions. [2025-03-16 15:08:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-03-16 15:08:14,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:14,770 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:14,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:08:14,770 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:14,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1035623631, now seen corresponding path program 1 times [2025-03-16 15:08:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250066046] [2025-03-16 15:08:14,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:14,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-03-16 15:08:14,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-03-16 15:08:14,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:14,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1285 backedges. 922 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2025-03-16 15:08:15,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:15,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250066046] [2025-03-16 15:08:15,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250066046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:15,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:15,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:08:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383315959] [2025-03-16 15:08:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:15,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:15,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:15,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:15,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:15,072 INFO L87 Difference]: Start difference. First operand 25536 states and 26675 transitions. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 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-03-16 15:08:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:16,074 INFO L93 Difference]: Finished difference Result 52562 states and 54906 transitions. [2025-03-16 15:08:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 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 788 [2025-03-16 15:08:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:16,099 INFO L225 Difference]: With dead ends: 52562 [2025-03-16 15:08:16,099 INFO L226 Difference]: Without dead ends: 27326 [2025-03-16 15:08:16,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:16,115 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 630 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:16,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 419 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27326 states. [2025-03-16 15:08:16,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27326 to 26428. [2025-03-16 15:08:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26428 states, 26427 states have (on average 1.0359102433117644) internal successors, (27376), 26427 states have internal predecessors, (27376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26428 states to 26428 states and 27376 transitions. [2025-03-16 15:08:16,403 INFO L78 Accepts]: Start accepts. Automaton has 26428 states and 27376 transitions. Word has length 788 [2025-03-16 15:08:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:16,403 INFO L471 AbstractCegarLoop]: Abstraction has 26428 states and 27376 transitions. [2025-03-16 15:08:16,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 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-03-16 15:08:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 26428 states and 27376 transitions. [2025-03-16 15:08:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-16 15:08:16,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:16,414 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:16,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:08:16,414 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1182180018, now seen corresponding path program 1 times [2025-03-16 15:08:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662892200] [2025-03-16 15:08:16,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:16,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-16 15:08:16,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-16 15:08:16,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:16,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-03-16 15:08:17,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:17,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662892200] [2025-03-16 15:08:17,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662892200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:17,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:17,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:17,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918468266] [2025-03-16 15:08:17,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:17,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:17,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:17,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:17,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:17,167 INFO L87 Difference]: Start difference. First operand 26428 states and 27376 transitions. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:17,918 INFO L93 Difference]: Finished difference Result 52254 states and 54137 transitions. [2025-03-16 15:08:17,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:17,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 828 [2025-03-16 15:08:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:17,946 INFO L225 Difference]: With dead ends: 52254 [2025-03-16 15:08:17,947 INFO L226 Difference]: Without dead ends: 26126 [2025-03-16 15:08:17,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-03-16 15:08:17,965 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 220 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:17,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 110 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:08:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26126 states. [2025-03-16 15:08:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26126 to 26126. [2025-03-16 15:08:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26126 states, 26125 states have (on average 1.0326507177033493) internal successors, (26978), 26125 states have internal predecessors, (26978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:18,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26126 states to 26126 states and 26978 transitions. [2025-03-16 15:08:18,265 INFO L78 Accepts]: Start accepts. Automaton has 26126 states and 26978 transitions. Word has length 828 [2025-03-16 15:08:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:18,265 INFO L471 AbstractCegarLoop]: Abstraction has 26126 states and 26978 transitions. [2025-03-16 15:08:18,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:18,266 INFO L276 IsEmpty]: Start isEmpty. Operand 26126 states and 26978 transitions. [2025-03-16 15:08:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2025-03-16 15:08:18,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:18,287 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:08:18,287 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 599182657, now seen corresponding path program 1 times [2025-03-16 15:08:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117379381] [2025-03-16 15:08:18,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:18,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 923 statements into 1 equivalence classes. [2025-03-16 15:08:18,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 923 of 923 statements. [2025-03-16 15:08:18,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:18,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 633 proven. 306 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2025-03-16 15:08:19,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117379381] [2025-03-16 15:08:19,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117379381] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762834840] [2025-03-16 15:08:19,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:19,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:19,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:19,328 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:19,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:08:19,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 923 statements into 1 equivalence classes. [2025-03-16 15:08:19,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 923 of 923 statements. [2025-03-16 15:08:19,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:19,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:19,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:19,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:19,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-03-16 15:08:19,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:19,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762834840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:19,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:19,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:08:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900936322] [2025-03-16 15:08:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:19,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:19,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:19,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:08:19,833 INFO L87 Difference]: Start difference. First operand 26126 states and 26978 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:20,475 INFO L93 Difference]: Finished difference Result 51345 states and 53030 transitions. [2025-03-16 15:08:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:20,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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 923 [2025-03-16 15:08:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:20,500 INFO L225 Difference]: With dead ends: 51345 [2025-03-16 15:08:20,500 INFO L226 Difference]: Without dead ends: 25519 [2025-03-16 15:08:20,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 927 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:08:20,516 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:20,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 497 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:08:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25519 states. [2025-03-16 15:08:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25519 to 24319. [2025-03-16 15:08:20,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24319 states, 24318 states have (on average 1.0236861584011843) internal successors, (24894), 24318 states have internal predecessors, (24894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24319 states to 24319 states and 24894 transitions. [2025-03-16 15:08:20,713 INFO L78 Accepts]: Start accepts. Automaton has 24319 states and 24894 transitions. Word has length 923 [2025-03-16 15:08:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:20,714 INFO L471 AbstractCegarLoop]: Abstraction has 24319 states and 24894 transitions. [2025-03-16 15:08:20,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 24319 states and 24894 transitions. [2025-03-16 15:08:20,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2025-03-16 15:08:20,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:20,728 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:20,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:08:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:20,929 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:20,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1283514527, now seen corresponding path program 1 times [2025-03-16 15:08:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574422025] [2025-03-16 15:08:20,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:21,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 923 statements into 1 equivalence classes. [2025-03-16 15:08:21,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 923 of 923 statements. [2025-03-16 15:08:21,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:21,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 1023 proven. 0 refuted. 0 times theorem prover too weak. 728 trivial. 0 not checked. [2025-03-16 15:08:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:21,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574422025] [2025-03-16 15:08:21,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574422025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:21,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:21,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:08:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956223395] [2025-03-16 15:08:21,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:21,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:21,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:21,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:21,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:08:21,438 INFO L87 Difference]: Start difference. First operand 24319 states and 24894 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:22,287 INFO L93 Difference]: Finished difference Result 53140 states and 54421 transitions. [2025-03-16 15:08:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:22,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 923 [2025-03-16 15:08:22,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:22,322 INFO L225 Difference]: With dead ends: 53140 [2025-03-16 15:08:22,322 INFO L226 Difference]: Without dead ends: 29121 [2025-03-16 15:08:22,338 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-03-16 15:08:22,338 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 345 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:22,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 118 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:08:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29121 states. [2025-03-16 15:08:22,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29121 to 24915. [2025-03-16 15:08:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24915 states, 24914 states have (on average 1.022116079312836) internal successors, (25465), 24914 states have internal predecessors, (25465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24915 states to 24915 states and 25465 transitions. [2025-03-16 15:08:22,640 INFO L78 Accepts]: Start accepts. Automaton has 24915 states and 25465 transitions. Word has length 923 [2025-03-16 15:08:22,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:22,640 INFO L471 AbstractCegarLoop]: Abstraction has 24915 states and 25465 transitions. [2025-03-16 15:08:22,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 24915 states and 25465 transitions. [2025-03-16 15:08:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2025-03-16 15:08:22,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:22,662 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:22,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:08:22,662 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:22,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 283604590, now seen corresponding path program 1 times [2025-03-16 15:08:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:22,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094082904] [2025-03-16 15:08:22,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:22,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:22,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 926 statements into 1 equivalence classes. [2025-03-16 15:08:22,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 926 of 926 statements. [2025-03-16 15:08:22,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:22,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:23,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-16 15:08:23,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:23,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094082904] [2025-03-16 15:08:23,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094082904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:23,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:23,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:08:23,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034498098] [2025-03-16 15:08:23,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:23,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:23,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:23,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:23,098 INFO L87 Difference]: Start difference. First operand 24915 states and 25465 transitions. Second operand has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:24,004 INFO L93 Difference]: Finished difference Result 54020 states and 55228 transitions. [2025-03-16 15:08:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 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 926 [2025-03-16 15:08:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:24,030 INFO L225 Difference]: With dead ends: 54020 [2025-03-16 15:08:24,030 INFO L226 Difference]: Without dead ends: 29405 [2025-03-16 15:08:24,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:24,045 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 455 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:24,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 137 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:08:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29405 states. [2025-03-16 15:08:24,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29405 to 24614. [2025-03-16 15:08:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24614 states, 24613 states have (on average 1.022020883273067) internal successors, (25155), 24613 states have internal predecessors, (25155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24614 states to 24614 states and 25155 transitions. [2025-03-16 15:08:24,278 INFO L78 Accepts]: Start accepts. Automaton has 24614 states and 25155 transitions. Word has length 926 [2025-03-16 15:08:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:24,278 INFO L471 AbstractCegarLoop]: Abstraction has 24614 states and 25155 transitions. [2025-03-16 15:08:24,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:24,278 INFO L276 IsEmpty]: Start isEmpty. Operand 24614 states and 25155 transitions. [2025-03-16 15:08:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 963 [2025-03-16 15:08:24,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:24,291 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:24,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 15:08:24,292 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:24,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -551061467, now seen corresponding path program 1 times [2025-03-16 15:08:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:24,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385802128] [2025-03-16 15:08:24,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:24,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:24,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-16 15:08:24,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-16 15:08:24,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:24,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 776 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2025-03-16 15:08:24,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:24,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385802128] [2025-03-16 15:08:24,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385802128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:24,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:24,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:08:24,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779364348] [2025-03-16 15:08:24,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:24,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:24,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:24,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:24,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:24,943 INFO L87 Difference]: Start difference. First operand 24614 states and 25155 transitions. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:25,997 INFO L93 Difference]: Finished difference Result 58522 states and 59807 transitions. [2025-03-16 15:08:25,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:25,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 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 962 [2025-03-16 15:08:25,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:26,027 INFO L225 Difference]: With dead ends: 58522 [2025-03-16 15:08:26,027 INFO L226 Difference]: Without dead ends: 34208 [2025-03-16 15:08:26,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:26,041 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 402 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:26,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 144 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2025-03-16 15:08:26,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 24913. [2025-03-16 15:08:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24913 states, 24912 states have (on average 1.0219171483622351) internal successors, (25458), 24912 states have internal predecessors, (25458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:26,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24913 states to 24913 states and 25458 transitions. [2025-03-16 15:08:26,290 INFO L78 Accepts]: Start accepts. Automaton has 24913 states and 25458 transitions. Word has length 962 [2025-03-16 15:08:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:26,291 INFO L471 AbstractCegarLoop]: Abstraction has 24913 states and 25458 transitions. [2025-03-16 15:08:26,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 24913 states and 25458 transitions. [2025-03-16 15:08:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2025-03-16 15:08:26,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:26,312 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:08:26,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:08:26,313 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -641705522, now seen corresponding path program 1 times [2025-03-16 15:08:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458578229] [2025-03-16 15:08:26,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:26,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1010 statements into 1 equivalence classes. [2025-03-16 15:08:26,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1010 of 1010 statements. [2025-03-16 15:08:26,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:26,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2284 backedges. 1595 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-03-16 15:08:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:27,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458578229] [2025-03-16 15:08:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458578229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:08:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:08:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403182195] [2025-03-16 15:08:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:27,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:08:27,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:27,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:08:27,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:27,117 INFO L87 Difference]: Start difference. First operand 24913 states and 25458 transitions. Second operand has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:28,211 INFO L93 Difference]: Finished difference Result 55212 states and 56405 transitions. [2025-03-16 15:08:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:08:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 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 1010 [2025-03-16 15:08:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:28,231 INFO L225 Difference]: With dead ends: 55212 [2025-03-16 15:08:28,231 INFO L226 Difference]: Without dead ends: 27601 [2025-03-16 15:08:28,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:08:28,243 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 490 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:28,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 128 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 15:08:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27601 states. [2025-03-16 15:08:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27601 to 21314. [2025-03-16 15:08:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21314 states, 21313 states have (on average 1.0205508375170085) internal successors, (21751), 21313 states have internal predecessors, (21751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21314 states to 21314 states and 21751 transitions. [2025-03-16 15:08:28,402 INFO L78 Accepts]: Start accepts. Automaton has 21314 states and 21751 transitions. Word has length 1010 [2025-03-16 15:08:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:28,403 INFO L471 AbstractCegarLoop]: Abstraction has 21314 states and 21751 transitions. [2025-03-16 15:08:28,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21314 states and 21751 transitions. [2025-03-16 15:08:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1059 [2025-03-16 15:08:28,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:28,416 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:08:28,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 15:08:28,416 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:28,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2066691394, now seen corresponding path program 1 times [2025-03-16 15:08:28,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:28,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426884211] [2025-03-16 15:08:28,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:28,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1058 statements into 1 equivalence classes. [2025-03-16 15:08:28,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1058 of 1058 statements. [2025-03-16 15:08:28,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:28,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:29,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 115 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2025-03-16 15:08:29,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:29,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426884211] [2025-03-16 15:08:29,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426884211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:29,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073415727] [2025-03-16 15:08:29,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:29,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:29,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:29,121 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:29,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:08:29,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1058 statements into 1 equivalence classes. [2025-03-16 15:08:29,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1058 of 1058 statements. [2025-03-16 15:08:29,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:29,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:29,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:08:29,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:32,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 115 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2025-03-16 15:08:32,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:08:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1603 backedges. 115 proven. 757 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2025-03-16 15:08:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073415727] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:08:33,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:08:33,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-16 15:08:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039452346] [2025-03-16 15:08:33,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:08:33,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 15:08:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:33,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 15:08:33,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:08:33,719 INFO L87 Difference]: Start difference. First operand 21314 states and 21751 transitions. Second operand has 10 states, 10 states have (on average 143.9) internal successors, (1439), 9 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:36,923 INFO L93 Difference]: Finished difference Result 37802 states and 38630 transitions. [2025-03-16 15:08:36,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 15:08:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 143.9) internal successors, (1439), 9 states have internal predecessors, (1439), 0 states have call successors, (0), 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 1058 [2025-03-16 15:08:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:36,955 INFO L225 Difference]: With dead ends: 37802 [2025-03-16 15:08:36,955 INFO L226 Difference]: Without dead ends: 37800 [2025-03-16 15:08:36,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2118 GetRequests, 2110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:08:36,962 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1309 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1309 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:36,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1309 Valid, 186 Invalid, 3792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 3466 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 15:08:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37800 states. [2025-03-16 15:08:37,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37800 to 21015. [2025-03-16 15:08:37,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21015 states, 21014 states have (on average 1.0205577234224803) internal successors, (21446), 21014 states have internal predecessors, (21446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21015 states to 21015 states and 21446 transitions. [2025-03-16 15:08:37,176 INFO L78 Accepts]: Start accepts. Automaton has 21015 states and 21446 transitions. Word has length 1058 [2025-03-16 15:08:37,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:37,176 INFO L471 AbstractCegarLoop]: Abstraction has 21015 states and 21446 transitions. [2025-03-16 15:08:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.9) internal successors, (1439), 9 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21015 states and 21446 transitions. [2025-03-16 15:08:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1269 [2025-03-16 15:08:37,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:08:37,192 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:08:37,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:08:37,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-16 15:08:37,393 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:08:37,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:08:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash 791437548, now seen corresponding path program 1 times [2025-03-16 15:08:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:08:37,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573908459] [2025-03-16 15:08:37,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:37,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:08:37,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1268 statements into 1 equivalence classes. [2025-03-16 15:08:37,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1268 of 1268 statements. [2025-03-16 15:08:37,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:37,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 1597 proven. 188 refuted. 0 times theorem prover too weak. 1701 trivial. 0 not checked. [2025-03-16 15:08:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:08:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573908459] [2025-03-16 15:08:38,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573908459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:08:38,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032633162] [2025-03-16 15:08:38,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:08:38,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:08:38,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:08:38,631 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:08:38,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:08:38,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1268 statements into 1 equivalence classes. [2025-03-16 15:08:38,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1268 of 1268 statements. [2025-03-16 15:08:38,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:08:38,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:08:38,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:08:38,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:08:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 2340 proven. 0 refuted. 0 times theorem prover too weak. 1146 trivial. 0 not checked. [2025-03-16 15:08:39,016 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:08:39,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032633162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:08:39,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:08:39,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:08:39,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790423889] [2025-03-16 15:08:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:08:39,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:08:39,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:08:39,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:08:39,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:39,017 INFO L87 Difference]: Start difference. First operand 21015 states and 21446 transitions. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:08:39,557 INFO L93 Difference]: Finished difference Result 36310 states and 37067 transitions. [2025-03-16 15:08:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:08:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 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 1268 [2025-03-16 15:08:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:08:39,558 INFO L225 Difference]: With dead ends: 36310 [2025-03-16 15:08:39,559 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:08:39,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1267 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:08:39,570 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 230 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:08:39,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 355 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:08:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:08:39,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:08:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:08:39,571 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1268 [2025-03-16 15:08:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:08:39,571 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:08:39,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:08:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:08:39,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:08:39,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:08:39,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:08:39,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 15:08:39,777 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:08:39,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:08:45,133 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification. DAG size of input: 620 DAG size of output: 730 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-16 15:08:47,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:08:47,948 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 15:08:47,950 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 15:08:47,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:08:47 BoogieIcfgContainer [2025-03-16 15:08:47,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:08:47,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:08:47,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:08:47,958 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:08:47,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:41" (3/4) ... [2025-03-16 15:08:47,960 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:08:47,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-16 15:08:47,986 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:08:47,987 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:08:47,988 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:08:48,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:08:48,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:08:48,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:08:48,110 INFO L158 Benchmark]: Toolchain (without parser) took 69905.10ms. Allocated memory was 167.8MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 116.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 285.5MB. Max. memory is 16.1GB. [2025-03-16 15:08:48,111 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:08:48,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 551.53ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 43.9MB in the end (delta: 72.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-16 15:08:48,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.88ms. Allocated memory is still 167.8MB. Free memory was 43.9MB in the beginning and 84.3MB in the end (delta: -40.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2025-03-16 15:08:48,111 INFO L158 Benchmark]: Boogie Preprocessor took 224.29ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 96.0MB in the end (delta: -11.7MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2025-03-16 15:08:48,112 INFO L158 Benchmark]: IcfgBuilder took 1959.60ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 96.0MB in the beginning and 74.8MB in the end (delta: 21.1MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2025-03-16 15:08:48,113 INFO L158 Benchmark]: TraceAbstraction took 66851.92ms. Allocated memory was 285.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 74.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-16 15:08:48,113 INFO L158 Benchmark]: Witness Printer took 151.43ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 15:08:48,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 551.53ms. Allocated memory is still 167.8MB. Free memory was 116.2MB in the beginning and 43.9MB in the end (delta: 72.3MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.88ms. Allocated memory is still 167.8MB. Free memory was 43.9MB in the beginning and 84.3MB in the end (delta: -40.4MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 224.29ms. Allocated memory is still 167.8MB. Free memory was 84.3MB in the beginning and 96.0MB in the end (delta: -11.7MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1959.60ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 96.0MB in the beginning and 74.8MB in the end (delta: 21.1MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. * TraceAbstraction took 66851.92ms. Allocated memory was 285.2MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 74.8MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 151.43ms. Allocated memory is still 2.0GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 110]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 363 locations, 688 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.6s, OverallIterations: 29, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11889 SdHoareTripleChecker+Valid, 29.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11889 mSDsluCounter, 9917 SdHoareTripleChecker+Invalid, 25.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1127 mSDsCounter, 4796 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32300 IncrementalHoareTripleChecker+Invalid, 37096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4796 mSolverCounterUnsat, 8790 mSDtfsCounter, 32300 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6236 GetRequests, 6176 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26428occurred in iteration=21, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 58187 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 21851 NumberOfCodeBlocks, 21851 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 23458 ConstructedInterpolants, 297 QuantifiedInterpolants, 77774 SizeOfPredicates, 6 NumberOfNonLiveVariables, 5283 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 36 InterpolantComputations, 27 PerfectInterpolantSequences, 30006/33078 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 4)) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a0 + 60)))) || (((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0))) || ((((0 <= ((long long) 143 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || (((((long long) 104 + a0) <= 0) && (2 == a2)) && (44 <= a29))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2))) || (((2 != a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || (((140780 <= a0) && (a2 == 4)) && (((long long) a4 + 172330) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (((long long) a0 + 61) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((0 <= ((long long) a0 + 459337)) && (((long long) 104 + a0) <= 0)) && (((long long) 42 + a4) <= 0)) && (a2 == 4)) && (((long long) a29 + 144) <= 0))) || ((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600263 + a0))) && (a29 <= 43))) || (((((((long long) 104 + a0) <= 0) && (0 <= ((long long) a29 + 14))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600263 + a0))) && (a2 == 4))) || (((0 <= ((long long) a29 + 14)) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 42 + a4) <= 0) && (2 == a2)) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (3 == a2)) && (a29 <= 43))) || (((((long long) 42 + a4) <= 0) && (a2 == 4)) && (((long long) 366639 + a0) <= 0))) || (((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (a2 == 1))) || (((((0 <= ((long long) a29 + 14)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (((long long) a0 + 61) <= 0))) || ((((long long) 89 + a4) <= 0) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || ((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600263 + a0))) && (5 <= a2))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (3 == a2))) || ((((((long long) 104 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85)))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:08:48,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE