./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label28.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 b0a5cf50440c9e896d19b51bcdf6c9c62935ca0e3dc457582cf7d4a77a7eac75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:48:08,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:48:08,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:48:08,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:48:08,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:48:08,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:48:08,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:48:08,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:48:08,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:48:08,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:48:08,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:48:08,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:48:08,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:48:08,828 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:48:08,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:08,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:48:08,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:48:08,829 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 -> b0a5cf50440c9e896d19b51bcdf6c9c62935ca0e3dc457582cf7d4a77a7eac75 [2025-03-03 09:48:09,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:48:09,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:48:09,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:48:09,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:48:09,069 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:48:09,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2025-03-03 09:48:10,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d7f160d/4d9d97cba6544380b3fa7001202ec84b/FLAGf84cd7db9 [2025-03-03 09:48:10,497 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:48:10,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2025-03-03 09:48:10,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d7f160d/4d9d97cba6544380b3fa7001202ec84b/FLAGf84cd7db9 [2025-03-03 09:48:10,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d7f160d/4d9d97cba6544380b3fa7001202ec84b [2025-03-03 09:48:10,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:48:10,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:48:10,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:10,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:48:10,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:48:10,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbc6213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10, skipping insertion in model container [2025-03-03 09:48:10,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,571 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:48:10,738 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/Problem01_label28.c[17117,17130] [2025-03-03 09:48:10,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:10,764 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:48:10,808 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/Problem01_label28.c[17117,17130] [2025-03-03 09:48:10,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:48:10,836 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:48:10,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10 WrapperNode [2025-03-03 09:48:10,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:48:10,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:10,838 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:48:10,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:48:10,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,881 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-03 09:48:10,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:48:10,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:48:10,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:48:10,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:48:10,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,913 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:48:10,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,926 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:48:10,943 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:48:10,943 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:48:10,943 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:48:10,944 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (1/1) ... [2025-03-03 09:48:10,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:48:10,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:48:10,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:48:10,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:48:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:48:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:48:10,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:48:10,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:48:11,045 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:48:11,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:48:11,851 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-03 09:48:11,851 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:48:11,862 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:48:11,862 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:48:11,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:11 BoogieIcfgContainer [2025-03-03 09:48:11,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:48:11,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:48:11,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:48:11,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:48:11,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:48:10" (1/3) ... [2025-03-03 09:48:11,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3697834c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:11, skipping insertion in model container [2025-03-03 09:48:11,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:48:10" (2/3) ... [2025-03-03 09:48:11,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3697834c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:48:11, skipping insertion in model container [2025-03-03 09:48:11,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:11" (3/3) ... [2025-03-03 09:48:11,869 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2025-03-03 09:48:11,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:48:11,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label28.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:48:11,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:48:11,933 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;@76075ae6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:48:11,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:48:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 09:48:11,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:11,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:11,944 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:11,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2063994018, now seen corresponding path program 1 times [2025-03-03 09:48:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:11,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90319122] [2025-03-03 09:48:11,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:12,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 09:48:12,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 09:48:12,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:12,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90319122] [2025-03-03 09:48:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90319122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695946718] [2025-03-03 09:48:12,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:12,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:12,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:12,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:12,418 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:12,992 INFO L93 Difference]: Finished difference Result 553 states and 937 transitions. [2025-03-03 09:48:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:12,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 09:48:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:13,000 INFO L225 Difference]: With dead ends: 553 [2025-03-03 09:48:13,000 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 09:48:13,003 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-03 09:48:13,004 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 92 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:13,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 72 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 09:48:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-03 09:48:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-03-03 09:48:13,036 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2025-03-03 09:48:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:13,036 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-03-03 09:48:13,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-03-03 09:48:13,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 09:48:13,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:13,039 INFO L218 NwaCegarLoop]: trace histogram [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-03 09:48:13,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:48:13,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:13,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1847592064, now seen corresponding path program 1 times [2025-03-03 09:48:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:13,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810314552] [2025-03-03 09:48:13,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:13,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 09:48:13,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 09:48:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:13,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:13,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810314552] [2025-03-03 09:48:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810314552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543661622] [2025-03-03 09:48:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:13,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:13,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:13,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,159 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:13,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:13,509 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-03-03 09:48:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:13,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-03-03 09:48:13,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:13,511 INFO L225 Difference]: With dead ends: 792 [2025-03-03 09:48:13,511 INFO L226 Difference]: Without dead ends: 528 [2025-03-03 09:48:13,512 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-03 09:48:13,512 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:13,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-03 09:48:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-03 09:48:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3453510436432639) internal successors, (709), 527 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2025-03-03 09:48:13,540 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 99 [2025-03-03 09:48:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:13,540 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2025-03-03 09:48:13,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2025-03-03 09:48:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 09:48:13,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:13,543 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:48:13,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:48:13,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:13,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:13,543 INFO L85 PathProgramCache]: Analyzing trace with hash -822742369, now seen corresponding path program 1 times [2025-03-03 09:48:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:13,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628919923] [2025-03-03 09:48:13,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:13,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 09:48:13,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 09:48:13,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:13,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:13,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628919923] [2025-03-03 09:48:13,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628919923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:13,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:13,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:13,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010691013] [2025-03-03 09:48:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:13,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:13,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:13,717 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:14,025 INFO L93 Difference]: Finished difference Result 1578 states and 2122 transitions. [2025-03-03 09:48:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:14,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-03 09:48:14,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:14,028 INFO L225 Difference]: With dead ends: 1578 [2025-03-03 09:48:14,028 INFO L226 Difference]: Without dead ends: 1052 [2025-03-03 09:48:14,029 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-03 09:48:14,033 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 41 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:14,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 199 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-03-03 09:48:14,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2025-03-03 09:48:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 1.2759276879162702) internal successors, (1341), 1051 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1341 transitions. [2025-03-03 09:48:14,052 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1341 transitions. Word has length 100 [2025-03-03 09:48:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:14,053 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1341 transitions. [2025-03-03 09:48:14,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1341 transitions. [2025-03-03 09:48:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 09:48:14,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:14,055 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:14,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:48:14,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:14,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:14,056 INFO L85 PathProgramCache]: Analyzing trace with hash -596030359, now seen corresponding path program 1 times [2025-03-03 09:48:14,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141029498] [2025-03-03 09:48:14,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:14,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 09:48:14,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 09:48:14,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:14,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141029498] [2025-03-03 09:48:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141029498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:14,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:14,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:14,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911253607] [2025-03-03 09:48:14,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:14,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:14,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:14,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:14,182 INFO L87 Difference]: Start difference. First operand 1052 states and 1341 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:14,500 INFO L93 Difference]: Finished difference Result 2364 states and 3015 transitions. [2025-03-03 09:48:14,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-03 09:48:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:14,506 INFO L225 Difference]: With dead ends: 2364 [2025-03-03 09:48:14,506 INFO L226 Difference]: Without dead ends: 1314 [2025-03-03 09:48:14,507 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-03 09:48:14,509 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:14,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 61 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-03-03 09:48:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2025-03-03 09:48:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2353389185072354) internal successors, (1622), 1313 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1622 transitions. [2025-03-03 09:48:14,532 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1622 transitions. Word has length 104 [2025-03-03 09:48:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:14,533 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1622 transitions. [2025-03-03 09:48:14,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1622 transitions. [2025-03-03 09:48:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 09:48:14,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:14,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 09:48:14,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:48:14,535 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:14,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash -541546964, now seen corresponding path program 1 times [2025-03-03 09:48:14,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:14,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373830077] [2025-03-03 09:48:14,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:14,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 09:48:14,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 09:48:14,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:14,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:14,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373830077] [2025-03-03 09:48:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373830077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:14,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:14,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997480924] [2025-03-03 09:48:14,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:14,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:14,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:14,647 INFO L87 Difference]: Start difference. First operand 1314 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:15,179 INFO L93 Difference]: Finished difference Result 3936 states and 4878 transitions. [2025-03-03 09:48:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:15,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 09:48:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:15,186 INFO L225 Difference]: With dead ends: 3936 [2025-03-03 09:48:15,186 INFO L226 Difference]: Without dead ends: 2624 [2025-03-03 09:48:15,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:15,188 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 265 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:15,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 42 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:48:15,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-03 09:48:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2231. [2025-03-03 09:48:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.1977578475336323) internal successors, (2671), 2230 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2671 transitions. [2025-03-03 09:48:15,219 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2671 transitions. Word has length 108 [2025-03-03 09:48:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:15,219 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2671 transitions. [2025-03-03 09:48:15,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2671 transitions. [2025-03-03 09:48:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 09:48:15,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:15,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-03 09:48:15,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:48:15,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:15,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1558598446, now seen corresponding path program 1 times [2025-03-03 09:48:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:15,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656662842] [2025-03-03 09:48:15,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:15,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 09:48:15,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 09:48:15,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:15,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:48:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656662842] [2025-03-03 09:48:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656662842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679200839] [2025-03-03 09:48:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:15,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:15,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:15,315 INFO L87 Difference]: Start difference. First operand 2231 states and 2671 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:15,655 INFO L93 Difference]: Finished difference Result 5246 states and 6222 transitions. [2025-03-03 09:48:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2025-03-03 09:48:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:15,663 INFO L225 Difference]: With dead ends: 5246 [2025-03-03 09:48:15,663 INFO L226 Difference]: Without dead ends: 2493 [2025-03-03 09:48:15,666 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-03 09:48:15,666 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 124 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:15,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 193 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-03-03 09:48:15,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2100. [2025-03-03 09:48:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1024297284421154) internal successors, (2314), 2099 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2314 transitions. [2025-03-03 09:48:15,695 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2314 transitions. Word has length 115 [2025-03-03 09:48:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:15,696 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2314 transitions. [2025-03-03 09:48:15,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2314 transitions. [2025-03-03 09:48:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 09:48:15,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:15,698 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-03 09:48:15,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:48:15,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:15,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:15,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1539541413, now seen corresponding path program 1 times [2025-03-03 09:48:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:15,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552070994] [2025-03-03 09:48:15,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:15,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 09:48:15,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 09:48:15,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:15,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 09:48:15,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:15,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552070994] [2025-03-03 09:48:15,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552070994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:15,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:15,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071121541] [2025-03-03 09:48:15,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:15,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:15,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:15,780 INFO L87 Difference]: Start difference. First operand 2100 states and 2314 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:16,075 INFO L93 Difference]: Finished difference Result 4984 states and 5537 transitions. [2025-03-03 09:48:16,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:16,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 133 [2025-03-03 09:48:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:16,082 INFO L225 Difference]: With dead ends: 4984 [2025-03-03 09:48:16,082 INFO L226 Difference]: Without dead ends: 3017 [2025-03-03 09:48:16,084 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-03 09:48:16,085 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 130 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:16,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 20 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:16,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2025-03-03 09:48:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 2755. [2025-03-03 09:48:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2755 states, 2754 states have (on average 1.1132897603485838) internal successors, (3066), 2754 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 3066 transitions. [2025-03-03 09:48:16,117 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 3066 transitions. Word has length 133 [2025-03-03 09:48:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:16,117 INFO L471 AbstractCegarLoop]: Abstraction has 2755 states and 3066 transitions. [2025-03-03 09:48:16,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 3066 transitions. [2025-03-03 09:48:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 09:48:16,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:16,120 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 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] [2025-03-03 09:48:16,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:48:16,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:16,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:16,121 INFO L85 PathProgramCache]: Analyzing trace with hash 562600261, now seen corresponding path program 1 times [2025-03-03 09:48:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:16,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660893575] [2025-03-03 09:48:16,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:16,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 09:48:16,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 09:48:16,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:16,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 09:48:16,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:16,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660893575] [2025-03-03 09:48:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660893575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:16,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:48:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265521735] [2025-03-03 09:48:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:16,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:16,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:16,283 INFO L87 Difference]: Start difference. First operand 2755 states and 3066 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:16,552 INFO L93 Difference]: Finished difference Result 5770 states and 6426 transitions. [2025-03-03 09:48:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 164 [2025-03-03 09:48:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:16,559 INFO L225 Difference]: With dead ends: 5770 [2025-03-03 09:48:16,560 INFO L226 Difference]: Without dead ends: 3017 [2025-03-03 09:48:16,562 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-03 09:48:16,563 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 104 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:16,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 43 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:48:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2025-03-03 09:48:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 3017. [2025-03-03 09:48:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3016 states have (on average 1.1080901856763925) internal successors, (3342), 3016 states have internal predecessors, (3342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3342 transitions. [2025-03-03 09:48:16,598 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3342 transitions. Word has length 164 [2025-03-03 09:48:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:16,598 INFO L471 AbstractCegarLoop]: Abstraction has 3017 states and 3342 transitions. [2025-03-03 09:48:16,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3342 transitions. [2025-03-03 09:48:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 09:48:16,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:16,602 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 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] [2025-03-03 09:48:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:48:16,602 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:16,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:16,603 INFO L85 PathProgramCache]: Analyzing trace with hash 279819400, now seen corresponding path program 1 times [2025-03-03 09:48:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808905560] [2025-03-03 09:48:16,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:16,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 09:48:16,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 09:48:16,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:16,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:16,776 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-03 09:48:16,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:16,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808905560] [2025-03-03 09:48:16,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808905560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:16,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:16,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:16,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167201146] [2025-03-03 09:48:16,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:16,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:48:16,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:16,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:48:16,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:16,777 INFO L87 Difference]: Start difference. First operand 3017 states and 3342 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:17,237 INFO L93 Difference]: Finished difference Result 6032 states and 6694 transitions. [2025-03-03 09:48:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:48:17,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 168 [2025-03-03 09:48:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:17,244 INFO L225 Difference]: With dead ends: 6032 [2025-03-03 09:48:17,244 INFO L226 Difference]: Without dead ends: 3148 [2025-03-03 09:48:17,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:48:17,248 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 237 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:17,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 47 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:48:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2025-03-03 09:48:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3017. [2025-03-03 09:48:17,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3016 states have (on average 1.1014588859416445) internal successors, (3322), 3016 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3322 transitions. [2025-03-03 09:48:17,290 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3322 transitions. Word has length 168 [2025-03-03 09:48:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:17,291 INFO L471 AbstractCegarLoop]: Abstraction has 3017 states and 3322 transitions. [2025-03-03 09:48:17,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3322 transitions. [2025-03-03 09:48:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 09:48:17,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:17,296 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:17,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:48:17,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:17,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 427333712, now seen corresponding path program 1 times [2025-03-03 09:48:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501177935] [2025-03-03 09:48:17,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:17,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:17,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 09:48:17,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 09:48:17,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:17,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-03 09:48:17,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:17,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501177935] [2025-03-03 09:48:17,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501177935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:17,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:17,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597945306] [2025-03-03 09:48:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:17,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:17,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:17,480 INFO L87 Difference]: Start difference. First operand 3017 states and 3322 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:17,763 INFO L93 Difference]: Finished difference Result 6556 states and 7259 transitions. [2025-03-03 09:48:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 185 [2025-03-03 09:48:17,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:17,770 INFO L225 Difference]: With dead ends: 6556 [2025-03-03 09:48:17,770 INFO L226 Difference]: Without dead ends: 3410 [2025-03-03 09:48:17,773 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-03 09:48:17,773 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:17,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 39 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2025-03-03 09:48:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 3148. [2025-03-03 09:48:17,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.1013663806800127) internal successors, (3466), 3147 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3466 transitions. [2025-03-03 09:48:17,810 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3466 transitions. Word has length 185 [2025-03-03 09:48:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:17,810 INFO L471 AbstractCegarLoop]: Abstraction has 3148 states and 3466 transitions. [2025-03-03 09:48:17,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3466 transitions. [2025-03-03 09:48:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 09:48:17,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:17,814 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 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, 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] [2025-03-03 09:48:17,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:48:17,815 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -279336646, now seen corresponding path program 1 times [2025-03-03 09:48:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383516030] [2025-03-03 09:48:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:17,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 09:48:17,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 09:48:17,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:17,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 09:48:17,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:17,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383516030] [2025-03-03 09:48:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383516030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:17,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:17,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533006342] [2025-03-03 09:48:17,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:17,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:17,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:17,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:17,930 INFO L87 Difference]: Start difference. First operand 3148 states and 3466 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:18,220 INFO L93 Difference]: Finished difference Result 6294 states and 6935 transitions. [2025-03-03 09:48:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 228 [2025-03-03 09:48:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:18,227 INFO L225 Difference]: With dead ends: 6294 [2025-03-03 09:48:18,227 INFO L226 Difference]: Without dead ends: 3279 [2025-03-03 09:48:18,230 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-03 09:48:18,231 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 88 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:18,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 175 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:18,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-03 09:48:18,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3148. [2025-03-03 09:48:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3147 states have (on average 1.084524944391484) internal successors, (3413), 3147 states have internal predecessors, (3413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 3413 transitions. [2025-03-03 09:48:18,269 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 3413 transitions. Word has length 228 [2025-03-03 09:48:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:18,270 INFO L471 AbstractCegarLoop]: Abstraction has 3148 states and 3413 transitions. [2025-03-03 09:48:18,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 3413 transitions. [2025-03-03 09:48:18,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-03 09:48:18,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:18,274 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 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, 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-03 09:48:18,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:48:18,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash 625089713, now seen corresponding path program 1 times [2025-03-03 09:48:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598409792] [2025-03-03 09:48:18,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:18,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-03 09:48:18,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-03 09:48:18,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:18,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 09:48:18,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:18,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598409792] [2025-03-03 09:48:18,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598409792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:18,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:18,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:18,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16845244] [2025-03-03 09:48:18,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:18,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:18,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:18,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:18,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:18,391 INFO L87 Difference]: Start difference. First operand 3148 states and 3413 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:18,658 INFO L93 Difference]: Finished difference Result 6294 states and 6836 transitions. [2025-03-03 09:48:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 241 [2025-03-03 09:48:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:18,665 INFO L225 Difference]: With dead ends: 6294 [2025-03-03 09:48:18,665 INFO L226 Difference]: Without dead ends: 3279 [2025-03-03 09:48:18,668 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-03 09:48:18,669 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:18,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 162 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:48:18,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-03-03 09:48:18,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2025-03-03 09:48:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3278 states have (on average 1.067724222086638) internal successors, (3500), 3278 states have internal predecessors, (3500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:18,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 3500 transitions. [2025-03-03 09:48:18,706 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 3500 transitions. Word has length 241 [2025-03-03 09:48:18,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:18,706 INFO L471 AbstractCegarLoop]: Abstraction has 3279 states and 3500 transitions. [2025-03-03 09:48:18,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:18,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3500 transitions. [2025-03-03 09:48:18,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 09:48:18,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:48:18,710 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 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, 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] [2025-03-03 09:48:18,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:48:18,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:48:18,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:48:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1300761775, now seen corresponding path program 1 times [2025-03-03 09:48:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:48:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242760290] [2025-03-03 09:48:18,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:48:18,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:48:18,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 09:48:18,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 09:48:18,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:48:18,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:48:18,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 09:48:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:48:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242760290] [2025-03-03 09:48:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242760290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:48:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:48:18,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:48:18,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693230890] [2025-03-03 09:48:18,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:48:18,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:48:18,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:48:18,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:48:18,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:48:18,826 INFO L87 Difference]: Start difference. First operand 3279 states and 3500 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:48:19,103 INFO L93 Difference]: Finished difference Result 5375 states and 5754 transitions. [2025-03-03 09:48:19,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:48:19,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 250 [2025-03-03 09:48:19,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:48:19,104 INFO L225 Difference]: With dead ends: 5375 [2025-03-03 09:48:19,104 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:48:19,108 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-03 09:48:19,109 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 124 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:48:19,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 167 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:48:19,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:48:19,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:48:19,110 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-03 09:48:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:48:19,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 250 [2025-03-03 09:48:19,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:48:19,110 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:48:19,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:48:19,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:48:19,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:48:19,113 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:48:19,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:48:19,115 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:48:19,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:48:19,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:48:19,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:48:19 BoogieIcfgContainer [2025-03-03 09:48:19,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:48:19,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:48:19,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:48:19,416 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:48:19,416 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:48:11" (3/4) ... [2025-03-03 09:48:19,418 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:48:19,432 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:48:19,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:48:19,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:48:19,435 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:48:19,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:48:19,520 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:48:19,521 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:48:19,521 INFO L158 Benchmark]: Toolchain (without parser) took 8985.86ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 126.7MB in the beginning and 152.6MB in the end (delta: -25.9MB). Peak memory consumption was 137.2MB. Max. memory is 16.1GB. [2025-03-03 09:48:19,522 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:19,522 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.49ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 98.9MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 09:48:19,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.68ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 93.6MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:48:19,522 INFO L158 Benchmark]: Boogie Preprocessor took 54.64ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 89.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:48:19,523 INFO L158 Benchmark]: IcfgBuilder took 919.84ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 91.2MB in the end (delta: -1.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 09:48:19,523 INFO L158 Benchmark]: TraceAbstraction took 7550.89ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 90.2MB in the beginning and 166.6MB in the end (delta: -76.5MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2025-03-03 09:48:19,523 INFO L158 Benchmark]: Witness Printer took 105.03ms. Allocated memory is still 327.2MB. Free memory was 166.6MB in the beginning and 152.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:48:19,524 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.25ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.49ms. Allocated memory is still 167.8MB. Free memory was 126.3MB in the beginning and 98.9MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.68ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 93.6MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.64ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 89.3MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 919.84ms. Allocated memory is still 167.8MB. Free memory was 89.3MB in the beginning and 91.2MB in the end (delta: -1.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7550.89ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 90.2MB in the beginning and 166.6MB in the end (delta: -76.5MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * Witness Printer took 105.03ms. Allocated memory is still 327.2MB. Free memory was 166.6MB in the beginning and 152.6MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * 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: 465]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 13, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1668 mSDsluCounter, 1256 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 655 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4704 IncrementalHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 655 mSolverCounterUnsat, 1173 mSDtfsCounter, 4704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3279occurred in iteration=12, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1572 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1988 NumberOfCodeBlocks, 1988 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1975 ConstructedInterpolants, 0 QuantifiedInterpolants, 3602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 1708/1708 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: 593]: Location Invariant Derived location invariant: (((((((((((a8 <= 13) && (6 <= a16)) && (a7 == 1)) && (a20 == 1)) || (((a21 == 1) && (a7 == 1)) && (a16 <= 5))) || ((a7 <= 0) && (a20 != 1))) || ((((a8 <= 13) && (a17 == 1)) && (a7 == 1)) && (a20 == 1))) || ((a7 <= 0) && (a21 == 1))) || (((a7 <= 0) && (a17 == 1)) && (a16 <= 4))) || (((a20 != 1) && (a7 == 1)) && (a16 <= 5))) || ((a8 <= 13) && (a16 <= 4))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:48:19,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE