./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label55.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 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:52:35,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:52:35,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:52:35,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:52:35,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:52:35,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:52:35,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:52:35,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:52:35,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:52:35,184 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:52:35,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:52:35,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:52:35,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:52:35,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:52:35,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:52:35,186 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:52:35,187 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:52:35,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:35,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:52:35,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:52:35,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:52:35,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 3ed93fbea5c4ce7662a30833852408f6a41bed2c847c0002d827dceaca299880 [2025-03-16 14:52:35,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:52:35,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:52:35,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:52:35,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:52:35,435 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:52:35,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2025-03-16 14:52:36,590 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083105325/bcb908cd450843d5be2ea5d3d3b4b050/FLAGe4ce5befa [2025-03-16 14:52:36,881 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:52:36,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label55.c [2025-03-16 14:52:36,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083105325/bcb908cd450843d5be2ea5d3d3b4b050/FLAGe4ce5befa [2025-03-16 14:52:36,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/083105325/bcb908cd450843d5be2ea5d3d3b4b050 [2025-03-16 14:52:36,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:52:36,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:52:36,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:36,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:52:36,923 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:52:36,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:36" (1/1) ... [2025-03-16 14:52:36,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:36, skipping insertion in model container [2025-03-16 14:52:36,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:52:36" (1/1) ... [2025-03-16 14:52:36,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:52:37,113 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/Problem11_label55.c[6546,6559] [2025-03-16 14:52:37,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:37,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:52:37,274 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/Problem11_label55.c[6546,6559] [2025-03-16 14:52:37,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:52:37,373 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:52:37,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37 WrapperNode [2025-03-16 14:52:37,374 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:52:37,375 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:37,375 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:52:37,375 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:52:37,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,480 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:52:37,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:52:37,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:52:37,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:52:37,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:52:37,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,539 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:52:37,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:52:37,603 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:52:37,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:52:37,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:52:37,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (1/1) ... [2025-03-16 14:52:37,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:52:37,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:37,630 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:52:37,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:52:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:52:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:52:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:52:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:52:37,701 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:52:37,702 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:52:38,996 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:52:38,996 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:52:39,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:52:39,013 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:52:39,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:39 BoogieIcfgContainer [2025-03-16 14:52:39,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:52:39,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:52:39,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:52:39,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:52:39,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:52:36" (1/3) ... [2025-03-16 14:52:39,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a1f811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:39, skipping insertion in model container [2025-03-16 14:52:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:52:37" (2/3) ... [2025-03-16 14:52:39,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a1f811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:52:39, skipping insertion in model container [2025-03-16 14:52:39,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:39" (3/3) ... [2025-03-16 14:52:39,020 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label55.c [2025-03-16 14:52:39,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:52:39,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label55.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:52:39,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:52:39,089 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;@161b2888, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:52:39,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:52:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 14:52:39,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:39,099 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] [2025-03-16 14:52:39,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:39,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1943819657, now seen corresponding path program 1 times [2025-03-16 14:52:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:39,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592122690] [2025-03-16 14:52:39,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:39,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 14:52:39,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 14:52:39,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:39,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:39,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:39,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592122690] [2025-03-16 14:52:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592122690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:39,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:39,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:39,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718427810] [2025-03-16 14:52:39,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:39,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:52:39,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:39,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:52:39,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:39,249 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:39,280 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:52:39,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:52:39,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 14:52:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:39,287 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:52:39,288 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:52:39,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:52:39,293 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:39,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:52:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:52:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:52:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:52:39,325 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 44 [2025-03-16 14:52:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:39,325 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:52:39,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:52:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-16 14:52:39,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:39,326 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] [2025-03-16 14:52:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:52:39,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:39,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:39,327 INFO L85 PathProgramCache]: Analyzing trace with hash -161276845, now seen corresponding path program 1 times [2025-03-16 14:52:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157834872] [2025-03-16 14:52:39,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:39,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-16 14:52:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-16 14:52:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:39,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:39,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:39,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157834872] [2025-03-16 14:52:39,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157834872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:39,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:39,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477188780] [2025-03-16 14:52:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:39,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:39,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:39,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:39,521 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:40,273 INFO L93 Difference]: Finished difference Result 630 states and 1026 transitions. [2025-03-16 14:52:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:40,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-16 14:52:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:40,276 INFO L225 Difference]: With dead ends: 630 [2025-03-16 14:52:40,276 INFO L226 Difference]: Without dead ends: 412 [2025-03-16 14:52:40,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:40,277 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 179 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:40,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:40,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-16 14:52:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-03-16 14:52:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4549878345498783) internal successors, (598), 411 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:40,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 598 transitions. [2025-03-16 14:52:40,305 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 598 transitions. Word has length 44 [2025-03-16 14:52:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:40,305 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 598 transitions. [2025-03-16 14:52:40,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 598 transitions. [2025-03-16 14:52:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 14:52:40,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:40,309 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:40,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:52:40,309 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:40,313 INFO L85 PathProgramCache]: Analyzing trace with hash -659511714, now seen corresponding path program 1 times [2025-03-16 14:52:40,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:40,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36174449] [2025-03-16 14:52:40,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:40,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:40,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 14:52:40,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 14:52:40,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:40,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36174449] [2025-03-16 14:52:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36174449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:40,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:40,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:52:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260693427] [2025-03-16 14:52:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:40,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:40,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:40,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:40,537 INFO L87 Difference]: Start difference. First operand 412 states and 598 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:41,173 INFO L93 Difference]: Finished difference Result 1210 states and 1762 transitions. [2025-03-16 14:52:41,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:41,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-16 14:52:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:41,176 INFO L225 Difference]: With dead ends: 1210 [2025-03-16 14:52:41,176 INFO L226 Difference]: Without dead ends: 799 [2025-03-16 14:52:41,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:41,178 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:41,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:41,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-16 14:52:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 788. [2025-03-16 14:52:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3761118170266835) internal successors, (1083), 787 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1083 transitions. [2025-03-16 14:52:41,208 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1083 transitions. Word has length 112 [2025-03-16 14:52:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:41,208 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1083 transitions. [2025-03-16 14:52:41,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:41,209 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1083 transitions. [2025-03-16 14:52:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 14:52:41,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:41,210 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:41,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:52:41,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 2092379652, now seen corresponding path program 1 times [2025-03-16 14:52:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927803844] [2025-03-16 14:52:41,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:41,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 14:52:41,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 14:52:41,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:41,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:41,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:41,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927803844] [2025-03-16 14:52:41,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927803844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544957764] [2025-03-16 14:52:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:41,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:41,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:41,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:41,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:41,567 INFO L87 Difference]: Start difference. First operand 788 states and 1083 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:42,550 INFO L93 Difference]: Finished difference Result 2504 states and 3427 transitions. [2025-03-16 14:52:42,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:42,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2025-03-16 14:52:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:42,557 INFO L225 Difference]: With dead ends: 2504 [2025-03-16 14:52:42,557 INFO L226 Difference]: Without dead ends: 1717 [2025-03-16 14:52:42,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:52:42,559 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 485 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:42,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 217 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:52:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1717 states. [2025-03-16 14:52:42,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1717 to 1713. [2025-03-16 14:52:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1712 states have (on average 1.2266355140186915) internal successors, (2100), 1712 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2100 transitions. [2025-03-16 14:52:42,602 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2100 transitions. Word has length 113 [2025-03-16 14:52:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:42,602 INFO L471 AbstractCegarLoop]: Abstraction has 1713 states and 2100 transitions. [2025-03-16 14:52:42,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2100 transitions. [2025-03-16 14:52:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-16 14:52:42,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:42,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:42,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:52:42,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:42,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1200317582, now seen corresponding path program 1 times [2025-03-16 14:52:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68827502] [2025-03-16 14:52:42,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:42,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-16 14:52:42,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-16 14:52:42,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:42,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:42,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:42,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68827502] [2025-03-16 14:52:42,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68827502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:42,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:42,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:42,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259149164] [2025-03-16 14:52:42,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:42,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:42,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:42,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:42,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:42,781 INFO L87 Difference]: Start difference. First operand 1713 states and 2100 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:43,368 INFO L93 Difference]: Finished difference Result 4004 states and 5047 transitions. [2025-03-16 14:52:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 171 [2025-03-16 14:52:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:43,375 INFO L225 Difference]: With dead ends: 4004 [2025-03-16 14:52:43,375 INFO L226 Difference]: Without dead ends: 2476 [2025-03-16 14:52:43,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:43,377 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 190 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:43,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2025-03-16 14:52:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2473. [2025-03-16 14:52:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2473 states, 2472 states have (on average 1.2309870550161812) internal successors, (3043), 2472 states have internal predecessors, (3043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:43,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2473 states to 2473 states and 3043 transitions. [2025-03-16 14:52:43,413 INFO L78 Accepts]: Start accepts. Automaton has 2473 states and 3043 transitions. Word has length 171 [2025-03-16 14:52:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 2473 states and 3043 transitions. [2025-03-16 14:52:43,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:43,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2473 states and 3043 transitions. [2025-03-16 14:52:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 14:52:43,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:43,416 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:52:43,416 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:43,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:43,416 INFO L85 PathProgramCache]: Analyzing trace with hash 512958113, now seen corresponding path program 1 times [2025-03-16 14:52:43,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:43,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214164573] [2025-03-16 14:52:43,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:43,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 14:52:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 14:52:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:43,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214164573] [2025-03-16 14:52:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214164573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435136844] [2025-03-16 14:52:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:43,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:43,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:43,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:43,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:43,616 INFO L87 Difference]: Start difference. First operand 2473 states and 3043 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:44,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:44,207 INFO L93 Difference]: Finished difference Result 5884 states and 7349 transitions. [2025-03-16 14:52:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:44,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 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 224 [2025-03-16 14:52:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:44,217 INFO L225 Difference]: With dead ends: 5884 [2025-03-16 14:52:44,217 INFO L226 Difference]: Without dead ends: 3596 [2025-03-16 14:52:44,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:44,222 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 136 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:44,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 337 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3596 states. [2025-03-16 14:52:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3596 to 3396. [2025-03-16 14:52:44,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3395 states have (on average 1.21060382916053) internal successors, (4110), 3395 states have internal predecessors, (4110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4110 transitions. [2025-03-16 14:52:44,271 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4110 transitions. Word has length 224 [2025-03-16 14:52:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:44,272 INFO L471 AbstractCegarLoop]: Abstraction has 3396 states and 4110 transitions. [2025-03-16 14:52:44,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4110 transitions. [2025-03-16 14:52:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 14:52:44,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:44,275 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:44,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:52:44,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:44,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash -215761375, now seen corresponding path program 1 times [2025-03-16 14:52:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365385142] [2025-03-16 14:52:44,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:44,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 14:52:44,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 14:52:44,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:44,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:52:44,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365385142] [2025-03-16 14:52:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365385142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:44,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:44,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217586469] [2025-03-16 14:52:44,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:44,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:44,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:44,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:44,453 INFO L87 Difference]: Start difference. First operand 3396 states and 4110 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:45,010 INFO L93 Difference]: Finished difference Result 7358 states and 8962 transitions. [2025-03-16 14:52:45,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:45,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 225 [2025-03-16 14:52:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:45,021 INFO L225 Difference]: With dead ends: 7358 [2025-03-16 14:52:45,022 INFO L226 Difference]: Without dead ends: 3963 [2025-03-16 14:52:45,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:45,025 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 157 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:45,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 344 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:45,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3963 states. [2025-03-16 14:52:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3963 to 3948. [2025-03-16 14:52:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3948 states, 3947 states have (on average 1.210032936407398) internal successors, (4776), 3947 states have internal predecessors, (4776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:45,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 4776 transitions. [2025-03-16 14:52:45,076 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 4776 transitions. Word has length 225 [2025-03-16 14:52:45,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:45,077 INFO L471 AbstractCegarLoop]: Abstraction has 3948 states and 4776 transitions. [2025-03-16 14:52:45,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:45,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 4776 transitions. [2025-03-16 14:52:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:52:45,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:45,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:45,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:52:45,079 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:45,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:45,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1182668090, now seen corresponding path program 1 times [2025-03-16 14:52:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:45,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030244785] [2025-03-16 14:52:45,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:45,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:45,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:52:45,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:52:45,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:45,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:52:45,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030244785] [2025-03-16 14:52:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030244785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:45,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442198720] [2025-03-16 14:52:45,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:45,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:45,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:45,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:45,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:45,235 INFO L87 Difference]: Start difference. First operand 3948 states and 4776 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:45,794 INFO L93 Difference]: Finished difference Result 8826 states and 10786 transitions. [2025-03-16 14:52:45,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:45,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2025-03-16 14:52:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:45,805 INFO L225 Difference]: With dead ends: 8826 [2025-03-16 14:52:45,805 INFO L226 Difference]: Without dead ends: 4879 [2025-03-16 14:52:45,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:45,809 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 152 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:45,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 377 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2025-03-16 14:52:45,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4868. [2025-03-16 14:52:45,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4868 states, 4867 states have (on average 1.1949866447503597) internal successors, (5816), 4867 states have internal predecessors, (5816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 5816 transitions. [2025-03-16 14:52:45,891 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 5816 transitions. Word has length 226 [2025-03-16 14:52:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:45,892 INFO L471 AbstractCegarLoop]: Abstraction has 4868 states and 5816 transitions. [2025-03-16 14:52:45,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 5816 transitions. [2025-03-16 14:52:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 14:52:45,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:45,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:45,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:52:45,896 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:45,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:45,898 INFO L85 PathProgramCache]: Analyzing trace with hash -44519368, now seen corresponding path program 1 times [2025-03-16 14:52:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:45,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713984351] [2025-03-16 14:52:45,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:45,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:45,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 14:52:45,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 14:52:45,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:45,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:46,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713984351] [2025-03-16 14:52:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713984351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770773088] [2025-03-16 14:52:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:46,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:46,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:46,247 INFO L87 Difference]: Start difference. First operand 4868 states and 5816 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:47,325 INFO L93 Difference]: Finished difference Result 15486 states and 18735 transitions. [2025-03-16 14:52:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:47,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-16 14:52:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:47,356 INFO L225 Difference]: With dead ends: 15486 [2025-03-16 14:52:47,357 INFO L226 Difference]: Without dead ends: 10619 [2025-03-16 14:52:47,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:47,366 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 286 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:47,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 225 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:52:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10619 states. [2025-03-16 14:52:47,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10619 to 10247. [2025-03-16 14:52:47,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10247 states, 10246 states have (on average 1.1746047237946515) internal successors, (12035), 10246 states have internal predecessors, (12035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10247 states to 10247 states and 12035 transitions. [2025-03-16 14:52:47,515 INFO L78 Accepts]: Start accepts. Automaton has 10247 states and 12035 transitions. Word has length 246 [2025-03-16 14:52:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:47,516 INFO L471 AbstractCegarLoop]: Abstraction has 10247 states and 12035 transitions. [2025-03-16 14:52:47,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 10247 states and 12035 transitions. [2025-03-16 14:52:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 14:52:47,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:47,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:47,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:52:47,520 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -46899343, now seen corresponding path program 1 times [2025-03-16 14:52:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:47,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084381813] [2025-03-16 14:52:47,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:47,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 14:52:47,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 14:52:47,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:47,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:47,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:47,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084381813] [2025-03-16 14:52:47,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084381813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:47,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:47,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:47,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419091655] [2025-03-16 14:52:47,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:47,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:47,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:47,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:47,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:47,769 INFO L87 Difference]: Start difference. First operand 10247 states and 12035 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:48,841 INFO L93 Difference]: Finished difference Result 25301 states and 30133 transitions. [2025-03-16 14:52:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:48,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-16 14:52:48,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:48,864 INFO L225 Difference]: With dead ends: 25301 [2025-03-16 14:52:48,864 INFO L226 Difference]: Without dead ends: 15055 [2025-03-16 14:52:48,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:48,873 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 297 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:48,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 129 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 14:52:48,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15055 states. [2025-03-16 14:52:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15055 to 14672. [2025-03-16 14:52:49,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14672 states, 14671 states have (on average 1.1806284506850249) internal successors, (17321), 14671 states have internal predecessors, (17321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14672 states to 14672 states and 17321 transitions. [2025-03-16 14:52:49,063 INFO L78 Accepts]: Start accepts. Automaton has 14672 states and 17321 transitions. Word has length 256 [2025-03-16 14:52:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:49,063 INFO L471 AbstractCegarLoop]: Abstraction has 14672 states and 17321 transitions. [2025-03-16 14:52:49,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14672 states and 17321 transitions. [2025-03-16 14:52:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-16 14:52:49,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:49,068 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:49,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:52:49,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:49,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:49,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1838137450, now seen corresponding path program 1 times [2025-03-16 14:52:49,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:49,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873573782] [2025-03-16 14:52:49,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:49,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:49,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-16 14:52:49,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-16 14:52:49,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:49,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-16 14:52:49,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:49,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873573782] [2025-03-16 14:52:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873573782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724076182] [2025-03-16 14:52:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:49,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:49,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:49,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:49,184 INFO L87 Difference]: Start difference. First operand 14672 states and 17321 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-16 14:52:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:49,862 INFO L93 Difference]: Finished difference Result 34862 states and 41356 transitions. [2025-03-16 14:52:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:49,863 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 258 [2025-03-16 14:52:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:49,895 INFO L225 Difference]: With dead ends: 34862 [2025-03-16 14:52:49,895 INFO L226 Difference]: Without dead ends: 20191 [2025-03-16 14:52:49,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:49,910 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 155 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:49,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 374 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20191 states. [2025-03-16 14:52:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20191 to 19083. [2025-03-16 14:52:50,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19083 states, 19082 states have (on average 1.1640813331935855) internal successors, (22213), 19082 states have internal predecessors, (22213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19083 states to 19083 states and 22213 transitions. [2025-03-16 14:52:50,097 INFO L78 Accepts]: Start accepts. Automaton has 19083 states and 22213 transitions. Word has length 258 [2025-03-16 14:52:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:50,098 INFO L471 AbstractCegarLoop]: Abstraction has 19083 states and 22213 transitions. [2025-03-16 14:52:50,098 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-16 14:52:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 19083 states and 22213 transitions. [2025-03-16 14:52:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-16 14:52:50,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:50,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:50,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:52:50,102 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:50,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:50,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1027522704, now seen corresponding path program 1 times [2025-03-16 14:52:50,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:50,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518894796] [2025-03-16 14:52:50,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:50,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-16 14:52:50,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-16 14:52:50,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:50,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:50,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518894796] [2025-03-16 14:52:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518894796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:50,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:50,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:50,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28797688] [2025-03-16 14:52:50,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:50,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:50,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:50,284 INFO L87 Difference]: Start difference. First operand 19083 states and 22213 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:50,888 INFO L93 Difference]: Finished difference Result 38177 states and 44449 transitions. [2025-03-16 14:52:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2025-03-16 14:52:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:50,915 INFO L225 Difference]: With dead ends: 38177 [2025-03-16 14:52:50,915 INFO L226 Difference]: Without dead ends: 19095 [2025-03-16 14:52:50,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:50,932 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 155 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:50,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 374 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:52:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19095 states. [2025-03-16 14:52:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19095 to 18898. [2025-03-16 14:52:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18898 states, 18897 states have (on average 1.1379584060962058) internal successors, (21504), 18897 states have internal predecessors, (21504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 21504 transitions. [2025-03-16 14:52:51,168 INFO L78 Accepts]: Start accepts. Automaton has 18898 states and 21504 transitions. Word has length 263 [2025-03-16 14:52:51,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:51,169 INFO L471 AbstractCegarLoop]: Abstraction has 18898 states and 21504 transitions. [2025-03-16 14:52:51,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 18898 states and 21504 transitions. [2025-03-16 14:52:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 14:52:51,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:51,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:51,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:52:51,174 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:51,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1735632375, now seen corresponding path program 1 times [2025-03-16 14:52:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029059740] [2025-03-16 14:52:51,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:51,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:52:51,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:52:51,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:51,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:51,417 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:51,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:51,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029059740] [2025-03-16 14:52:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029059740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:51,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643909185] [2025-03-16 14:52:51,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:51,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:51,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:51,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:51,419 INFO L87 Difference]: Start difference. First operand 18898 states and 21504 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:52,213 INFO L93 Difference]: Finished difference Result 34993 states and 39866 transitions. [2025-03-16 14:52:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:52,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 277 [2025-03-16 14:52:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:52,235 INFO L225 Difference]: With dead ends: 34993 [2025-03-16 14:52:52,235 INFO L226 Difference]: Without dead ends: 15544 [2025-03-16 14:52:52,248 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-16 14:52:52,248 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 213 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:52,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 162 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:52:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15544 states. [2025-03-16 14:52:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15544 to 12035. [2025-03-16 14:52:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12035 states, 12034 states have (on average 1.1083596476649493) internal successors, (13338), 12034 states have internal predecessors, (13338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12035 states to 12035 states and 13338 transitions. [2025-03-16 14:52:52,387 INFO L78 Accepts]: Start accepts. Automaton has 12035 states and 13338 transitions. Word has length 277 [2025-03-16 14:52:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:52,388 INFO L471 AbstractCegarLoop]: Abstraction has 12035 states and 13338 transitions. [2025-03-16 14:52:52,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12035 states and 13338 transitions. [2025-03-16 14:52:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-16 14:52:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:52,397 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:52,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:52:52,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1856585113, now seen corresponding path program 1 times [2025-03-16 14:52:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025034745] [2025-03-16 14:52:52,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:52,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-16 14:52:52,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-16 14:52:52,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:52,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-16 14:52:52,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025034745] [2025-03-16 14:52:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025034745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:52,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984588779] [2025-03-16 14:52:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:52,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:52,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:52,492 INFO L87 Difference]: Start difference. First operand 12035 states and 13338 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:52,948 INFO L93 Difference]: Finished difference Result 26092 states and 28921 transitions. [2025-03-16 14:52:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:52,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 311 [2025-03-16 14:52:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:52,965 INFO L225 Difference]: With dead ends: 26092 [2025-03-16 14:52:52,966 INFO L226 Difference]: Without dead ends: 14058 [2025-03-16 14:52:52,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:52,975 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 175 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:52,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 140 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14058 states. [2025-03-16 14:52:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14058 to 9453. [2025-03-16 14:52:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9453 states, 9452 states have (on average 1.111087600507829) internal successors, (10502), 9452 states have internal predecessors, (10502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9453 states to 9453 states and 10502 transitions. [2025-03-16 14:52:53,078 INFO L78 Accepts]: Start accepts. Automaton has 9453 states and 10502 transitions. Word has length 311 [2025-03-16 14:52:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:53,079 INFO L471 AbstractCegarLoop]: Abstraction has 9453 states and 10502 transitions. [2025-03-16 14:52:53,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 9453 states and 10502 transitions. [2025-03-16 14:52:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-16 14:52:53,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:53,084 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:52:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:52:53,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -371737429, now seen corresponding path program 1 times [2025-03-16 14:52:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646457109] [2025-03-16 14:52:53,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:53,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 14:52:53,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 14:52:53,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:53,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 205 proven. 97 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:52:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646457109] [2025-03-16 14:52:53,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646457109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:53,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432131763] [2025-03-16 14:52:53,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:53,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:53,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:53,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:53,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:52:53,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 14:52:53,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 14:52:53,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:53,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:53,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:52:53,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:52:54,157 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:52:54,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:52:54,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432131763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:54,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:52:54,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:52:54,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190973599] [2025-03-16 14:52:54,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:54,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:54,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:54,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:54,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:54,159 INFO L87 Difference]: Start difference. First operand 9453 states and 10502 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:54,792 INFO L93 Difference]: Finished difference Result 21856 states and 24243 transitions. [2025-03-16 14:52:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:54,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 331 [2025-03-16 14:52:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:54,804 INFO L225 Difference]: With dead ends: 21856 [2025-03-16 14:52:54,804 INFO L226 Difference]: Without dead ends: 12404 [2025-03-16 14:52:54,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:52:54,810 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 292 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:54,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 147 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12404 states. [2025-03-16 14:52:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12404 to 12218. [2025-03-16 14:52:54,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12218 states, 12217 states have (on average 1.1081280183351068) internal successors, (13538), 12217 states have internal predecessors, (13538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12218 states to 12218 states and 13538 transitions. [2025-03-16 14:52:54,903 INFO L78 Accepts]: Start accepts. Automaton has 12218 states and 13538 transitions. Word has length 331 [2025-03-16 14:52:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:54,903 INFO L471 AbstractCegarLoop]: Abstraction has 12218 states and 13538 transitions. [2025-03-16 14:52:54,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:54,904 INFO L276 IsEmpty]: Start isEmpty. Operand 12218 states and 13538 transitions. [2025-03-16 14:52:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 14:52:54,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:54,910 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:52:54,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:52:55,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:52:55,111 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:55,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1124182478, now seen corresponding path program 1 times [2025-03-16 14:52:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810824604] [2025-03-16 14:52:55,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:55,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 14:52:55,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 14:52:55,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:55,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 307 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:52:55,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:55,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810824604] [2025-03-16 14:52:55,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810824604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:55,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:55,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:52:55,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620980664] [2025-03-16 14:52:55,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:55,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:55,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:55,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:55,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:55,484 INFO L87 Difference]: Start difference. First operand 12218 states and 13538 transitions. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:56,478 INFO L93 Difference]: Finished difference Result 28682 states and 31732 transitions. [2025-03-16 14:52:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 353 [2025-03-16 14:52:56,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:56,494 INFO L225 Difference]: With dead ends: 28682 [2025-03-16 14:52:56,495 INFO L226 Difference]: Without dead ends: 14987 [2025-03-16 14:52:56,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:56,506 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 297 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:56,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 348 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:52:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14987 states. [2025-03-16 14:52:56,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14987 to 10737. [2025-03-16 14:52:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10737 states, 10736 states have (on average 1.0984538002980626) internal successors, (11793), 10736 states have internal predecessors, (11793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 11793 transitions. [2025-03-16 14:52:56,648 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 11793 transitions. Word has length 353 [2025-03-16 14:52:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:56,649 INFO L471 AbstractCegarLoop]: Abstraction has 10737 states and 11793 transitions. [2025-03-16 14:52:56,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 11793 transitions. [2025-03-16 14:52:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-16 14:52:56,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:56,659 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:56,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:52:56,659 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:56,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:56,660 INFO L85 PathProgramCache]: Analyzing trace with hash -426996943, now seen corresponding path program 1 times [2025-03-16 14:52:56,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:56,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35825398] [2025-03-16 14:52:56,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:56,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:56,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-16 14:52:56,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-16 14:52:56,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:56,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:52:56,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35825398] [2025-03-16 14:52:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35825398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157175754] [2025-03-16 14:52:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:56,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:52:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:52:56,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:52:56,875 INFO L87 Difference]: Start difference. First operand 10737 states and 11793 transitions. Second operand has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:57,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:57,579 INFO L93 Difference]: Finished difference Result 28668 states and 31443 transitions. [2025-03-16 14:52:57,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:52:57,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 401 [2025-03-16 14:52:57,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:57,595 INFO L225 Difference]: With dead ends: 28668 [2025-03-16 14:52:57,596 INFO L226 Difference]: Without dead ends: 17748 [2025-03-16 14:52:57,599 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-16 14:52:57,599 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 224 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:57,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 67 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:52:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17748 states. [2025-03-16 14:52:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17748 to 16267. [2025-03-16 14:52:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16267 states, 16266 states have (on average 1.097012172630026) internal successors, (17844), 16266 states have internal predecessors, (17844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16267 states to 16267 states and 17844 transitions. [2025-03-16 14:52:57,726 INFO L78 Accepts]: Start accepts. Automaton has 16267 states and 17844 transitions. Word has length 401 [2025-03-16 14:52:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 16267 states and 17844 transitions. [2025-03-16 14:52:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.75) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 16267 states and 17844 transitions. [2025-03-16 14:52:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-16 14:52:57,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:57,737 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:52:57,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:52:57,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:57,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:57,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1087191942, now seen corresponding path program 1 times [2025-03-16 14:52:57,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:57,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612870659] [2025-03-16 14:52:57,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:57,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:57,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-16 14:52:57,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-16 14:52:57,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:57,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-16 14:52:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612870659] [2025-03-16 14:52:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612870659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:52:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:52:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:52:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119361165] [2025-03-16 14:52:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:52:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:52:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:52:57,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:52:57,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:57,918 INFO L87 Difference]: Start difference. First operand 16267 states and 17844 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:52:58,357 INFO L93 Difference]: Finished difference Result 34557 states and 37963 transitions. [2025-03-16 14:52:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:52:58,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 448 [2025-03-16 14:52:58,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:52:58,376 INFO L225 Difference]: With dead ends: 34557 [2025-03-16 14:52:58,377 INFO L226 Difference]: Without dead ends: 18659 [2025-03-16 14:52:58,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:52:58,387 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 107 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:52:58,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 359 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:52:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18659 states. [2025-03-16 14:52:58,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18659 to 17371. [2025-03-16 14:52:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17371 states, 17370 states have (on average 1.0932066781807714) internal successors, (18989), 17370 states have internal predecessors, (18989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17371 states to 17371 states and 18989 transitions. [2025-03-16 14:52:58,525 INFO L78 Accepts]: Start accepts. Automaton has 17371 states and 18989 transitions. Word has length 448 [2025-03-16 14:52:58,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:52:58,526 INFO L471 AbstractCegarLoop]: Abstraction has 17371 states and 18989 transitions. [2025-03-16 14:52:58,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:52:58,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17371 states and 18989 transitions. [2025-03-16 14:52:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-16 14:52:58,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:52:58,537 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:52:58,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:52:58,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:52:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:52:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash -972805484, now seen corresponding path program 1 times [2025-03-16 14:52:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:52:58,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822346998] [2025-03-16 14:52:58,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:58,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:52:58,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-16 14:52:58,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-16 14:52:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 154 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:52:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:52:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822346998] [2025-03-16 14:52:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822346998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:52:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95669707] [2025-03-16 14:52:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:52:59,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:52:59,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:52:59,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:52:59,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:52:59,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-16 14:52:59,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-16 14:52:59,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:52:59,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:52:59,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 14:52:59,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:53:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 154 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:00,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:53:03,141 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 218 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:53:03,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95669707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:53:03,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:53:03,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-16 14:53:03,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868968416] [2025-03-16 14:53:03,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:53:03,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 14:53:03,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:03,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 14:53:03,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-16 14:53:03,143 INFO L87 Difference]: Start difference. First operand 17371 states and 18989 transitions. Second operand has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 12 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:06,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:06,333 INFO L93 Difference]: Finished difference Result 39718 states and 43468 transitions. [2025-03-16 14:53:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:53:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 12 states have internal predecessors, (1323), 0 states have call successors, (0), 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 456 [2025-03-16 14:53:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:06,352 INFO L225 Difference]: With dead ends: 39718 [2025-03-16 14:53:06,352 INFO L226 Difference]: Without dead ends: 22532 [2025-03-16 14:53:06,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 904 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-03-16 14:53:06,358 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1348 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 6597 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 7102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 6597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:06,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 228 Invalid, 7102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 6597 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 14:53:06,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22532 states. [2025-03-16 14:53:06,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22532 to 17187. [2025-03-16 14:53:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17187 states, 17186 states have (on average 1.0883277086000234) internal successors, (18704), 17186 states have internal predecessors, (18704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17187 states to 17187 states and 18704 transitions. [2025-03-16 14:53:06,482 INFO L78 Accepts]: Start accepts. Automaton has 17187 states and 18704 transitions. Word has length 456 [2025-03-16 14:53:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:06,482 INFO L471 AbstractCegarLoop]: Abstraction has 17187 states and 18704 transitions. [2025-03-16 14:53:06,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.76923076923077) internal successors, (1323), 12 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:06,483 INFO L276 IsEmpty]: Start isEmpty. Operand 17187 states and 18704 transitions. [2025-03-16 14:53:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-16 14:53:06,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:06,498 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:06,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:53:06,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:53:06,699 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:06,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:06,699 INFO L85 PathProgramCache]: Analyzing trace with hash 638662123, now seen corresponding path program 1 times [2025-03-16 14:53:06,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:06,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978037449] [2025-03-16 14:53:06,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:06,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:06,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-16 14:53:06,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-16 14:53:06,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:06,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-16 14:53:06,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:06,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978037449] [2025-03-16 14:53:06,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978037449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:06,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726614117] [2025-03-16 14:53:06,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:06,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:53:06,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:06,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:53:06,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:53:06,937 INFO L87 Difference]: Start difference. First operand 17187 states and 18704 transitions. Second operand has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:07,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:07,669 INFO L93 Difference]: Finished difference Result 33090 states and 36015 transitions. [2025-03-16 14:53:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:53:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 546 [2025-03-16 14:53:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:07,688 INFO L225 Difference]: With dead ends: 33090 [2025-03-16 14:53:07,688 INFO L226 Difference]: Without dead ends: 18484 [2025-03-16 14:53:07,697 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-16 14:53:07,697 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 197 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:07,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 68 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:53:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18484 states. [2025-03-16 14:53:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18484 to 17003. [2025-03-16 14:53:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17003 states, 17002 states have (on average 1.0878720150570522) internal successors, (18496), 17002 states have internal predecessors, (18496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17003 states to 17003 states and 18496 transitions. [2025-03-16 14:53:07,835 INFO L78 Accepts]: Start accepts. Automaton has 17003 states and 18496 transitions. Word has length 546 [2025-03-16 14:53:07,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:07,836 INFO L471 AbstractCegarLoop]: Abstraction has 17003 states and 18496 transitions. [2025-03-16 14:53:07,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.25) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:07,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17003 states and 18496 transitions. [2025-03-16 14:53:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2025-03-16 14:53:07,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:07,847 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:07,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:53:07,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:07,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash -598212466, now seen corresponding path program 1 times [2025-03-16 14:53:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855330084] [2025-03-16 14:53:07,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 560 statements into 1 equivalence classes. [2025-03-16 14:53:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 560 of 560 statements. [2025-03-16 14:53:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-16 14:53:08,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:08,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855330084] [2025-03-16 14:53:08,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855330084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:08,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:08,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:08,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540864671] [2025-03-16 14:53:08,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:08,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:08,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:08,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:08,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:08,094 INFO L87 Difference]: Start difference. First operand 17003 states and 18496 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:08,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:08,525 INFO L93 Difference]: Finished difference Result 32182 states and 34994 transitions. [2025-03-16 14:53:08,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:08,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 560 [2025-03-16 14:53:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:08,541 INFO L225 Difference]: With dead ends: 32182 [2025-03-16 14:53:08,541 INFO L226 Difference]: Without dead ends: 17575 [2025-03-16 14:53:08,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:08,550 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 104 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:08,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 159 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:53:08,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17575 states. [2025-03-16 14:53:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17575 to 10920. [2025-03-16 14:53:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10920 states, 10919 states have (on average 1.0845315505082882) internal successors, (11842), 10919 states have internal predecessors, (11842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:08,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 11842 transitions. [2025-03-16 14:53:08,640 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 11842 transitions. Word has length 560 [2025-03-16 14:53:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:08,640 INFO L471 AbstractCegarLoop]: Abstraction has 10920 states and 11842 transitions. [2025-03-16 14:53:08,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 11842 transitions. [2025-03-16 14:53:08,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2025-03-16 14:53:08,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:53:08,647 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:08,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:53:08,647 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:53:08,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:53:08,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1402689531, now seen corresponding path program 1 times [2025-03-16 14:53:08,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:53:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566737030] [2025-03-16 14:53:08,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:53:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:53:08,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 561 statements into 1 equivalence classes. [2025-03-16 14:53:08,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 561 of 561 statements. [2025-03-16 14:53:08,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:53:08,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:53:08,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-16 14:53:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:53:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566737030] [2025-03-16 14:53:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566737030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:53:08,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:53:08,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:53:08,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052155669] [2025-03-16 14:53:08,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:53:08,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:53:08,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:53:08,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:53:08,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:08,798 INFO L87 Difference]: Start difference. First operand 10920 states and 11842 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:53:09,176 INFO L93 Difference]: Finished difference Result 22938 states and 24809 transitions. [2025-03-16 14:53:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:53:09,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 561 [2025-03-16 14:53:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:53:09,177 INFO L225 Difference]: With dead ends: 22938 [2025-03-16 14:53:09,177 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:53:09,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:53:09,185 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:53:09,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 129 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:53:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:53:09,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:53:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:53:09,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 561 [2025-03-16 14:53:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:53:09,187 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:53:09,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:53:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:53:09,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:53:09,189 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:53:09,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 14:53:09,191 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:53:09,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:53:14,698 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:53:14,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:53:14 BoogieIcfgContainer [2025-03-16 14:53:14,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:53:14,717 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:53:14,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:53:14,717 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:53:14,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:52:39" (3/4) ... [2025-03-16 14:53:14,719 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:53:14,738 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:53:14,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:53:14,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:53:14,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:53:14,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:53:14,886 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:53:14,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:53:14,887 INFO L158 Benchmark]: Toolchain (without parser) took 37969.43ms. Allocated memory was 201.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 156.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 169.5MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,888 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:53:14,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.75ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 112.7MB in the end (delta: 43.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.80ms. Allocated memory is still 201.3MB. Free memory was 112.7MB in the beginning and 95.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,888 INFO L158 Benchmark]: Boogie Preprocessor took 120.27ms. Allocated memory is still 201.3MB. Free memory was 95.7MB in the beginning and 72.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,888 INFO L158 Benchmark]: IcfgBuilder took 1410.14ms. Allocated memory is still 201.3MB. Free memory was 72.0MB in the beginning and 103.4MB in the end (delta: -31.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,889 INFO L158 Benchmark]: TraceAbstraction took 35701.98ms. Allocated memory was 201.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 103.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 957.3MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,889 INFO L158 Benchmark]: Witness Printer took 169.22ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: -57.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2025-03-16 14:53:14,890 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.43ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 455.75ms. Allocated memory is still 201.3MB. Free memory was 155.8MB in the beginning and 112.7MB in the end (delta: 43.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.80ms. Allocated memory is still 201.3MB. Free memory was 112.7MB in the beginning and 95.7MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.27ms. Allocated memory is still 201.3MB. Free memory was 95.7MB in the beginning and 72.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1410.14ms. Allocated memory is still 201.3MB. Free memory was 72.0MB in the beginning and 103.4MB in the end (delta: -31.5MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35701.98ms. Allocated memory was 201.3MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 103.4MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 957.3MB. Max. memory is 16.1GB. * Witness Printer took 169.22ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: -57.1MB). Peak memory consumption was 10.1MB. 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: 151]: 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, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5393 SdHoareTripleChecker+Valid, 15.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5393 mSDsluCounter, 5137 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 768 mSDsCounter, 2388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21344 IncrementalHoareTripleChecker+Invalid, 23732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2388 mSolverCounterUnsat, 4369 mSDtfsCounter, 21344 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1318 GetRequests, 1267 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19083occurred in iteration=11, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 31104 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 7213 NumberOfCodeBlocks, 7213 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 7644 ConstructedInterpolants, 0 QuantifiedInterpolants, 31575 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1051 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 25 InterpolantComputations, 21 PerfectInterpolantSequences, 7562/8516 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: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (a29 <= 220)) || (((((570382 <= a29) && (a25 <= 10)) && (a4 == 1)) && (312 <= a23)) && (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483831))) || ((((((long long) a29 + 193244) <= 0) && (a25 <= 10)) && (a4 == 1)) && (312 <= a23))) || (((((long long) a23 + 43) <= 0) && (a25 == 11)) && (a29 <= 130))) || (((307 <= a23) && (a4 == 1)) && (a25 == 10))) || (((((long long) a23 + 43) <= 0) && (((long long) a29 + 275824) <= 0)) && (a25 == 9))) || ((((a29 <= 275) && (a25 <= 10)) && (a23 <= 262)) && (a4 == 1))) || ((((a4 == 0) && (a25 <= 10)) && (((long long) a23 + 599772) <= 0)) && (a29 <= 130))) || (((a25 == 13) && (a4 == 0)) && (a23 <= 262))) || ((a25 == 11) && (a4 == 1))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 9))) || (((a4 == 0) && (a25 == 10)) && (a29 <= 130))) || (((a29 <= 275) && (a25 == 12)) && (a4 == 0))) || ((a25 == 9) && (a4 == 1))) || (((a25 == 13) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138096))) && (a4 == 1))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 11))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 9))) || (((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 == 10))) || (((a25 == 12) && (a23 <= 262)) && (a4 == 1))) || (((a25 == 12) && (a4 == 0)) && (a23 <= 262))) || (((((long long) a23 + 43) <= 0) && (a25 <= 10)) && (a4 == 1))) || (((a29 <= 277) && (a4 == 1)) && (a25 == 10))) || ((((a29 <= 140) && (a4 == 0)) && (a23 <= 262)) && (a25 == 10))) || (((a25 == 12) && (a29 <= 277)) && (a4 == 1))) || ((((a29 <= 275) && (a4 == 0)) && (a25 == 11)) && (a23 <= 262))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:53:14,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE