./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label12.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 ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:41:33,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:41:33,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:41:33,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:41:33,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:41:33,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:41:33,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:41:33,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:41:33,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:41:33,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:41:33,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:41:33,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:41:33,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:41:33,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:41:33,325 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:41:33,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:41:33,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:41:33,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:41:33,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:41:33,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:41:33,328 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 -> ffbcc3b4e73f8ad55a0649493c69e3be3f48518c4d71790476a2cf0516dec892 [2025-03-08 01:41:33,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:41:33,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:41:33,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:41:33,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:41:33,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:41:33,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2025-03-08 01:41:34,668 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc82eb3/9ff39c3286864108b69bfa9618cca02f/FLAGdd218c916 [2025-03-08 01:41:34,938 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:41:34,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label12.c [2025-03-08 01:41:34,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc82eb3/9ff39c3286864108b69bfa9618cca02f/FLAGdd218c916 [2025-03-08 01:41:35,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fdc82eb3/9ff39c3286864108b69bfa9618cca02f [2025-03-08 01:41:35,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:41:35,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:41:35,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:41:35,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:41:35,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:41:35,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,240 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d08bdda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35, skipping insertion in model container [2025-03-08 01:41:35,240 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,272 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:41:35,405 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_label12.c[3684,3697] [2025-03-08 01:41:35,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:41:35,636 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:41:35,653 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_label12.c[3684,3697] [2025-03-08 01:41:35,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:41:35,763 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:41:35,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35 WrapperNode [2025-03-08 01:41:35,764 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:41:35,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:41:35,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:41:35,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:41:35,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,857 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-08 01:41:35,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:41:35,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:41:35,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:41:35,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:41:35,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,914 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-08 01:41:35,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:41:35,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:41:35,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:41:35,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:41:35,973 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (1/1) ... [2025-03-08 01:41:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:41:35,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:35,996 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-08 01:41:36,001 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-08 01:41:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:41:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:41:36,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:41:36,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:41:36,062 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:41:36,063 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:41:37,312 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 01:41:37,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:41:37,329 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:41:37,329 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:41:37,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:37 BoogieIcfgContainer [2025-03-08 01:41:37,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:41:37,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:41:37,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:41:37,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:41:37,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:41:35" (1/3) ... [2025-03-08 01:41:37,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb9acc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:37, skipping insertion in model container [2025-03-08 01:41:37,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:35" (2/3) ... [2025-03-08 01:41:37,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb9acc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:37, skipping insertion in model container [2025-03-08 01:41:37,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:37" (3/3) ... [2025-03-08 01:41:37,340 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label12.c [2025-03-08 01:41:37,354 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:41:37,355 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label12.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:41:37,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:41:37,428 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;@2fa57660, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:41:37,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:41:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-08 01:41:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 01:41:37,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:37,440 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] [2025-03-08 01:41:37,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:37,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:37,445 INFO L85 PathProgramCache]: Analyzing trace with hash 462608409, now seen corresponding path program 1 times [2025-03-08 01:41:37,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511030551] [2025-03-08 01:41:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:37,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 01:41:37,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 01:41:37,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:37,667 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-08 01:41:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511030551] [2025-03-08 01:41:37,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511030551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:37,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:37,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:37,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839626463] [2025-03-08 01:41:37,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:37,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:37,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:37,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:37,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:37,689 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-08 01:41:38,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:38,524 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-03-08 01:41:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-08 01:41:38,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:38,532 INFO L225 Difference]: With dead ends: 761 [2025-03-08 01:41:38,532 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 01:41:38,534 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-08 01:41:38,536 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 203 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:38,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:41:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 01:41:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-08 01:41:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 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-08 01:41:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-03-08 01:41:38,582 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 25 [2025-03-08 01:41:38,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:38,582 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-03-08 01:41:38,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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-08 01:41:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-03-08 01:41:38,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 01:41:38,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:38,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:41:38,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:41:38,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:38,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2072452733, now seen corresponding path program 1 times [2025-03-08 01:41:38,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551852545] [2025-03-08 01:41:38,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:38,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 01:41:38,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 01:41:38,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:38,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551852545] [2025-03-08 01:41:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551852545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406818152] [2025-03-08 01:41:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:38,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:38,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:38,797 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:39,401 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-03-08 01:41:39,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:39,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-08 01:41:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:39,405 INFO L225 Difference]: With dead ends: 1211 [2025-03-08 01:41:39,405 INFO L226 Difference]: Without dead ends: 800 [2025-03-08 01:41:39,406 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-08 01:41:39,406 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 121 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-08 01:41:39,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-08 01:41:39,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-03-08 01:41:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 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-08 01:41:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-08 01:41:39,432 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 93 [2025-03-08 01:41:39,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:39,432 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-08 01:41:39,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-08 01:41:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 01:41:39,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:39,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:41:39,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:41:39,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 902588264, now seen corresponding path program 1 times [2025-03-08 01:41:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242689984] [2025-03-08 01:41:39,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:39,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:39,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 01:41:39,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 01:41:39,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:39,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:39,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:39,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242689984] [2025-03-08 01:41:39,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242689984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:39,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:39,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:39,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789207976] [2025-03-08 01:41:39,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:39,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:39,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:39,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:39,675 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-08 01:41:40,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:40,274 INFO L93 Difference]: Finished difference Result 2314 states and 3181 transitions. [2025-03-08 01:41:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:40,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 01:41:40,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:40,278 INFO L225 Difference]: With dead ends: 2314 [2025-03-08 01:41:40,278 INFO L226 Difference]: Without dead ends: 1527 [2025-03-08 01:41:40,280 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-08 01:41:40,280 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 119 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:40,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-03-08 01:41:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1526. [2025-03-08 01:41:40,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.217049180327869) internal successors, (1856), 1525 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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-08 01:41:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1856 transitions. [2025-03-08 01:41:40,302 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1856 transitions. Word has length 95 [2025-03-08 01:41:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:40,302 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1856 transitions. [2025-03-08 01:41:40,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 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-08 01:41:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1856 transitions. [2025-03-08 01:41:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 01:41:40,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:40,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:41:40,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:41:40,306 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:40,306 INFO L85 PathProgramCache]: Analyzing trace with hash 467593655, now seen corresponding path program 1 times [2025-03-08 01:41:40,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:40,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833121628] [2025-03-08 01:41:40,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:40,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 01:41:40,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 01:41:40,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:40,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:40,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:40,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833121628] [2025-03-08 01:41:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833121628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799666935] [2025-03-08 01:41:40,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:40,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:40,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:40,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:40,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:40,522 INFO L87 Difference]: Start difference. First operand 1526 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-08 01:41:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:41,142 INFO L93 Difference]: Finished difference Result 3257 states and 4123 transitions. [2025-03-08 01:41:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:41,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-03-08 01:41:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:41,149 INFO L225 Difference]: With dead ends: 3257 [2025-03-08 01:41:41,149 INFO L226 Difference]: Without dead ends: 1917 [2025-03-08 01:41:41,150 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-08 01:41:41,153 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 210 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 322 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-08 01:41:41,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-03-08 01:41:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-03-08 01:41:41,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.2462101411395714) internal successors, (2384), 1913 states have internal predecessors, (2384), 0 states have call successors, (0), 0 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-08 01:41:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2384 transitions. [2025-03-08 01:41:41,187 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2384 transitions. Word has length 152 [2025-03-08 01:41:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:41,188 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2384 transitions. [2025-03-08 01:41:41,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-08 01:41:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2384 transitions. [2025-03-08 01:41:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 01:41:41,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:41,191 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:41:41,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:41:41,191 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:41,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1746209270, now seen corresponding path program 1 times [2025-03-08 01:41:41,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:41,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286933008] [2025-03-08 01:41:41,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:41,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:41,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 01:41:41,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 01:41:41,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:41,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 01:41:41,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:41,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286933008] [2025-03-08 01:41:41,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286933008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:41,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:41,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:41,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688384959] [2025-03-08 01:41:41,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:41,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:41,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:41,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:41,441 INFO L87 Difference]: Start difference. First operand 1914 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 01:41:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:42,132 INFO L93 Difference]: Finished difference Result 4389 states and 5590 transitions. [2025-03-08 01:41:42,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:42,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 207 [2025-03-08 01:41:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:42,140 INFO L225 Difference]: With dead ends: 4389 [2025-03-08 01:41:42,141 INFO L226 Difference]: Without dead ends: 2661 [2025-03-08 01:41:42,142 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-08 01:41:42,144 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:42,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:41:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-03-08 01:41:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-03-08 01:41:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.2347931873479319) internal successors, (3045), 2466 states have internal predecessors, (3045), 0 states have call successors, (0), 0 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-08 01:41:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3045 transitions. [2025-03-08 01:41:42,179 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3045 transitions. Word has length 207 [2025-03-08 01:41:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:42,180 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3045 transitions. [2025-03-08 01:41:42,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 01:41:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3045 transitions. [2025-03-08 01:41:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 01:41:42,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:42,183 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:41:42,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:41:42,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:42,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2073682375, now seen corresponding path program 1 times [2025-03-08 01:41:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:42,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911036007] [2025-03-08 01:41:42,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:42,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:42,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 01:41:42,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 01:41:42,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:42,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-08 01:41:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911036007] [2025-03-08 01:41:42,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911036007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689327256] [2025-03-08 01:41:42,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:42,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:42,596 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-08 01:41:42,598 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-08 01:41:42,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 01:41:42,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 01:41:42,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:42,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:42,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:41:42,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-08 01:41:42,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:41:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689327256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:42,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:41:42,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:41:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299735215] [2025-03-08 01:41:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:42,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:42,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:41:42,779 INFO L87 Difference]: Start difference. First operand 2467 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 01:41:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:43,411 INFO L93 Difference]: Finished difference Result 6589 states and 8262 transitions. [2025-03-08 01:41:43,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:43,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 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 213 [2025-03-08 01:41:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:43,423 INFO L225 Difference]: With dead ends: 6589 [2025-03-08 01:41:43,423 INFO L226 Difference]: Without dead ends: 4124 [2025-03-08 01:41:43,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:41:43,427 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 186 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:43,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 145 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4124 states. [2025-03-08 01:41:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4124 to 4124. [2025-03-08 01:41:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4124 states, 4123 states have (on average 1.2277467863206404) internal successors, (5062), 4123 states have internal predecessors, (5062), 0 states have call successors, (0), 0 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-08 01:41:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4124 states to 4124 states and 5062 transitions. [2025-03-08 01:41:43,486 INFO L78 Accepts]: Start accepts. Automaton has 4124 states and 5062 transitions. Word has length 213 [2025-03-08 01:41:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:43,486 INFO L471 AbstractCegarLoop]: Abstraction has 4124 states and 5062 transitions. [2025-03-08 01:41:43,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-08 01:41:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states and 5062 transitions. [2025-03-08 01:41:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-08 01:41:43,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:43,491 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-08 01:41:43,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 01:41:43,696 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,SelfDestructingSolverStorable5 [2025-03-08 01:41:43,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:43,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1173571398, now seen corresponding path program 1 times [2025-03-08 01:41:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383818681] [2025-03-08 01:41:43,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:43,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:43,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 01:41:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 01:41:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-08 01:41:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383818681] [2025-03-08 01:41:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383818681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706493531] [2025-03-08 01:41:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:43,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:43,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:43,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:43,916 INFO L87 Difference]: Start difference. First operand 4124 states and 5062 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-08 01:41:44,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:44,583 INFO L93 Difference]: Finished difference Result 9544 states and 11819 transitions. [2025-03-08 01:41:44,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 244 [2025-03-08 01:41:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:44,601 INFO L225 Difference]: With dead ends: 9544 [2025-03-08 01:41:44,601 INFO L226 Difference]: Without dead ends: 5422 [2025-03-08 01:41:44,604 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-08 01:41:44,605 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 171 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:44,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 390 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5422 states. [2025-03-08 01:41:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5422 to 5413. [2025-03-08 01:41:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5413 states, 5412 states have (on average 1.2065779748706578) internal successors, (6530), 5412 states have internal predecessors, (6530), 0 states have call successors, (0), 0 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-08 01:41:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5413 states to 5413 states and 6530 transitions. [2025-03-08 01:41:44,667 INFO L78 Accepts]: Start accepts. Automaton has 5413 states and 6530 transitions. Word has length 244 [2025-03-08 01:41:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:44,668 INFO L471 AbstractCegarLoop]: Abstraction has 5413 states and 6530 transitions. [2025-03-08 01:41:44,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-08 01:41:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 5413 states and 6530 transitions. [2025-03-08 01:41:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-08 01:41:44,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:44,672 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:41:44,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:41:44,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:44,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1487624385, now seen corresponding path program 1 times [2025-03-08 01:41:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109574858] [2025-03-08 01:41:44,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-08 01:41:44,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-08 01:41:44,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:44,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:44,821 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2025-03-08 01:41:44,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:44,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109574858] [2025-03-08 01:41:44,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109574858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:44,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:44,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822232961] [2025-03-08 01:41:44,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:44,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:44,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:44,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:44,822 INFO L87 Difference]: Start difference. First operand 5413 states and 6530 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-08 01:41:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:45,452 INFO L93 Difference]: Finished difference Result 12295 states and 15022 transitions. [2025-03-08 01:41:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:45,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 290 [2025-03-08 01:41:45,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:45,473 INFO L225 Difference]: With dead ends: 12295 [2025-03-08 01:41:45,473 INFO L226 Difference]: Without dead ends: 6884 [2025-03-08 01:41:45,478 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-08 01:41:45,479 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 199 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:45,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 151 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2025-03-08 01:41:45,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 4854. [2025-03-08 01:41:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4854 states, 4853 states have (on average 1.2248093962497424) internal successors, (5944), 4853 states have internal predecessors, (5944), 0 states have call successors, (0), 0 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-08 01:41:45,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 5944 transitions. [2025-03-08 01:41:45,543 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 5944 transitions. Word has length 290 [2025-03-08 01:41:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:45,543 INFO L471 AbstractCegarLoop]: Abstraction has 4854 states and 5944 transitions. [2025-03-08 01:41:45,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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-08 01:41:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 5944 transitions. [2025-03-08 01:41:45,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-08 01:41:45,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:45,548 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:41:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:41:45,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1336928323, now seen corresponding path program 1 times [2025-03-08 01:41:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179609851] [2025-03-08 01:41:45,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 01:41:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 01:41:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179609851] [2025-03-08 01:41:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179609851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897442426] [2025-03-08 01:41:46,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:46,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:46,013 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-08 01:41:46,014 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-08 01:41:46,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-08 01:41:46,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-08 01:41:46,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:46,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:46,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 01:41:46,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:47,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:41:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:48,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897442426] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:41:48,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:41:48,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 01:41:48,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898222382] [2025-03-08 01:41:48,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:41:48,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 01:41:48,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:48,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 01:41:48,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-08 01:41:48,855 INFO L87 Difference]: Start difference. First operand 4854 states and 5944 transitions. Second operand has 8 states, 8 states have (on average 71.375) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:50,925 INFO L93 Difference]: Finished difference Result 14359 states and 17348 transitions. [2025-03-08 01:41:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 01:41:50,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 71.375) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2025-03-08 01:41:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:50,944 INFO L225 Difference]: With dead ends: 14359 [2025-03-08 01:41:50,944 INFO L226 Difference]: Without dead ends: 9507 [2025-03-08 01:41:50,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 01:41:50,950 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 865 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2791 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:50,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 186 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2791 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 01:41:50,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9507 states. [2025-03-08 01:41:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9507 to 5035. [2025-03-08 01:41:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5035 states, 5034 states have (on average 1.2177195073500198) internal successors, (6130), 5034 states have internal predecessors, (6130), 0 states have call successors, (0), 0 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-08 01:41:51,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5035 states to 5035 states and 6130 transitions. [2025-03-08 01:41:51,022 INFO L78 Accepts]: Start accepts. Automaton has 5035 states and 6130 transitions. Word has length 309 [2025-03-08 01:41:51,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:51,022 INFO L471 AbstractCegarLoop]: Abstraction has 5035 states and 6130 transitions. [2025-03-08 01:41:51,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 71.375) internal successors, (571), 7 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 5035 states and 6130 transitions. [2025-03-08 01:41:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-08 01:41:51,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:51,033 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:51,040 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-08 01:41:51,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 01:41:51,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:51,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:51,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1540708531, now seen corresponding path program 1 times [2025-03-08 01:41:51,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:51,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304665011] [2025-03-08 01:41:51,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:51,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:51,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-08 01:41:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-08 01:41:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:51,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:51,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:51,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304665011] [2025-03-08 01:41:51,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304665011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:51,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:51,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:41:51,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973066530] [2025-03-08 01:41:51,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:51,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:51,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:51,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:51,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:51,500 INFO L87 Difference]: Start difference. First operand 5035 states and 6130 transitions. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-08 01:41:52,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:52,402 INFO L93 Difference]: Finished difference Result 13948 states and 17018 transitions. [2025-03-08 01:41:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:52,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 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 330 [2025-03-08 01:41:52,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:52,414 INFO L225 Difference]: With dead ends: 13948 [2025-03-08 01:41:52,415 INFO L226 Difference]: Without dead ends: 8915 [2025-03-08 01:41:52,418 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-08 01:41:52,419 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 265 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:52,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 64 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:41:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8915 states. [2025-03-08 01:41:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8915 to 7625. [2025-03-08 01:41:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7625 states, 7624 states have (on average 1.189270724029381) internal successors, (9067), 7624 states have internal predecessors, (9067), 0 states have call successors, (0), 0 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-08 01:41:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7625 states to 7625 states and 9067 transitions. [2025-03-08 01:41:52,506 INFO L78 Accepts]: Start accepts. Automaton has 7625 states and 9067 transitions. Word has length 330 [2025-03-08 01:41:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:52,507 INFO L471 AbstractCegarLoop]: Abstraction has 7625 states and 9067 transitions. [2025-03-08 01:41:52,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 0 states have call successors, (0), 0 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-08 01:41:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7625 states and 9067 transitions. [2025-03-08 01:41:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-08 01:41:52,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:52,518 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:52,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 01:41:52,518 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:52,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:52,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1795036007, now seen corresponding path program 1 times [2025-03-08 01:41:52,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:52,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204107576] [2025-03-08 01:41:52,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:52,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:52,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 01:41:52,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 01:41:52,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:52,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 01:41:52,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:52,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204107576] [2025-03-08 01:41:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204107576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:52,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431658178] [2025-03-08 01:41:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:52,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:52,713 INFO L87 Difference]: Start difference. First operand 7625 states and 9067 transitions. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-08 01:41:53,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:53,541 INFO L93 Difference]: Finished difference Result 20971 states and 24863 transitions. [2025-03-08 01:41:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 404 [2025-03-08 01:41:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:53,561 INFO L225 Difference]: With dead ends: 20971 [2025-03-08 01:41:53,561 INFO L226 Difference]: Without dead ends: 13348 [2025-03-08 01:41:53,568 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-08 01:41:53,570 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 287 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:53,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 76 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:41:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13348 states. [2025-03-08 01:41:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13348 to 13161. [2025-03-08 01:41:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13161 states, 13160 states have (on average 1.1724164133738602) internal successors, (15429), 13160 states have internal predecessors, (15429), 0 states have call successors, (0), 0 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-08 01:41:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 15429 transitions. [2025-03-08 01:41:53,683 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 15429 transitions. Word has length 404 [2025-03-08 01:41:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:53,684 INFO L471 AbstractCegarLoop]: Abstraction has 13161 states and 15429 transitions. [2025-03-08 01:41:53,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-08 01:41:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 15429 transitions. [2025-03-08 01:41:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-08 01:41:53,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:53,696 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-08 01:41:53,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:41:53,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:53,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:53,697 INFO L85 PathProgramCache]: Analyzing trace with hash 275000182, now seen corresponding path program 1 times [2025-03-08 01:41:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:53,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631051781] [2025-03-08 01:41:53,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:53,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:53,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-08 01:41:53,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-08 01:41:53,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:53,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 01:41:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631051781] [2025-03-08 01:41:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631051781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:53,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:41:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224259417] [2025-03-08 01:41:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:53,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:53,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:53,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:53,952 INFO L87 Difference]: Start difference. First operand 13161 states and 15429 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-08 01:41:54,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:54,761 INFO L93 Difference]: Finished difference Result 28531 states and 33339 transitions. [2025-03-08 01:41:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 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 404 [2025-03-08 01:41:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:54,778 INFO L225 Difference]: With dead ends: 28531 [2025-03-08 01:41:54,778 INFO L226 Difference]: Without dead ends: 15372 [2025-03-08 01:41:54,788 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-08 01:41:54,789 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 279 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:54,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 60 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:41:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15372 states. [2025-03-08 01:41:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15372 to 13161. [2025-03-08 01:41:54,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13161 states, 13160 states have (on average 1.1724164133738602) internal successors, (15429), 13160 states have internal predecessors, (15429), 0 states have call successors, (0), 0 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-08 01:41:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13161 states to 13161 states and 15429 transitions. [2025-03-08 01:41:54,906 INFO L78 Accepts]: Start accepts. Automaton has 13161 states and 15429 transitions. Word has length 404 [2025-03-08 01:41:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:54,907 INFO L471 AbstractCegarLoop]: Abstraction has 13161 states and 15429 transitions. [2025-03-08 01:41:54,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-08 01:41:54,907 INFO L276 IsEmpty]: Start isEmpty. Operand 13161 states and 15429 transitions. [2025-03-08 01:41:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-08 01:41:54,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:54,918 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-08 01:41:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:41:54,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:54,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2091748266, now seen corresponding path program 1 times [2025-03-08 01:41:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:54,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773527778] [2025-03-08 01:41:54,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:54,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-08 01:41:54,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-08 01:41:54,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:54,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 01:41:55,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:55,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773527778] [2025-03-08 01:41:55,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773527778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:55,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:55,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:55,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859631554] [2025-03-08 01:41:55,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:55,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:55,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:55,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:55,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:55,211 INFO L87 Difference]: Start difference. First operand 13161 states and 15429 transitions. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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-08 01:41:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:55,699 INFO L93 Difference]: Finished difference Result 26523 states and 31079 transitions. [2025-03-08 01:41:55,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:55,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 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 449 [2025-03-08 01:41:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:55,718 INFO L225 Difference]: With dead ends: 26523 [2025-03-08 01:41:55,718 INFO L226 Difference]: Without dead ends: 13364 [2025-03-08 01:41:55,729 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-08 01:41:55,729 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 62 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:55,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 330 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:41:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13364 states. [2025-03-08 01:41:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13364 to 12609. [2025-03-08 01:41:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12609 states, 12608 states have (on average 1.1452252538071066) internal successors, (14439), 12608 states have internal predecessors, (14439), 0 states have call successors, (0), 0 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-08 01:41:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 14439 transitions. [2025-03-08 01:41:55,840 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 14439 transitions. Word has length 449 [2025-03-08 01:41:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:55,841 INFO L471 AbstractCegarLoop]: Abstraction has 12609 states and 14439 transitions. [2025-03-08 01:41:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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-08 01:41:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 14439 transitions. [2025-03-08 01:41:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-03-08 01:41:55,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:55,850 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:41:55,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 01:41:55,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:55,851 INFO L85 PathProgramCache]: Analyzing trace with hash 409536963, now seen corresponding path program 1 times [2025-03-08 01:41:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:55,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941254949] [2025-03-08 01:41:55,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:55,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:55,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-03-08 01:41:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-03-08 01:41:55,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:55,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-08 01:41:56,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941254949] [2025-03-08 01:41:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941254949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:56,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:56,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:56,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800667273] [2025-03-08 01:41:56,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:56,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:56,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:56,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:56,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:56,010 INFO L87 Difference]: Start difference. First operand 12609 states and 14439 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-08 01:41:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:56,289 INFO L93 Difference]: Finished difference Result 24646 states and 28183 transitions. [2025-03-08 01:41:56,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:56,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 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 461 [2025-03-08 01:41:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:56,300 INFO L225 Difference]: With dead ends: 24646 [2025-03-08 01:41:56,301 INFO L226 Difference]: Without dead ends: 12039 [2025-03-08 01:41:56,313 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-08 01:41:56,313 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:56,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 37 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 01:41:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12039 states. [2025-03-08 01:41:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12039 to 12035. [2025-03-08 01:41:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12035 states, 12034 states have (on average 1.1411002160545123) internal successors, (13732), 12034 states have internal predecessors, (13732), 0 states have call successors, (0), 0 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-08 01:41:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12035 states to 12035 states and 13732 transitions. [2025-03-08 01:41:56,416 INFO L78 Accepts]: Start accepts. Automaton has 12035 states and 13732 transitions. Word has length 461 [2025-03-08 01:41:56,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:56,417 INFO L471 AbstractCegarLoop]: Abstraction has 12035 states and 13732 transitions. [2025-03-08 01:41:56,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 2 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-08 01:41:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 12035 states and 13732 transitions. [2025-03-08 01:41:56,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 01:41:56,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:56,425 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:56,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 01:41:56,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:56,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:56,427 INFO L85 PathProgramCache]: Analyzing trace with hash 211258075, now seen corresponding path program 1 times [2025-03-08 01:41:56,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:56,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691992281] [2025-03-08 01:41:56,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:56,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:56,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 01:41:56,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 01:41:56,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:56,662 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 01:41:56,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691992281] [2025-03-08 01:41:56,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691992281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:56,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:56,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:56,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361791566] [2025-03-08 01:41:56,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:56,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:56,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:56,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:56,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:56,664 INFO L87 Difference]: Start difference. First operand 12035 states and 13732 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-08 01:41:57,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:57,111 INFO L93 Difference]: Finished difference Result 22389 states and 25413 transitions. [2025-03-08 01:41:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:57,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 477 [2025-03-08 01:41:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:57,120 INFO L225 Difference]: With dead ends: 22389 [2025-03-08 01:41:57,120 INFO L226 Difference]: Without dead ends: 10356 [2025-03-08 01:41:57,127 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-08 01:41:57,128 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:57,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 123 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:41:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2025-03-08 01:41:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 9620. [2025-03-08 01:41:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9620 states, 9619 states have (on average 1.1143570017673354) internal successors, (10719), 9619 states have internal predecessors, (10719), 0 states have call successors, (0), 0 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-08 01:41:57,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 10719 transitions. [2025-03-08 01:41:57,216 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 10719 transitions. Word has length 477 [2025-03-08 01:41:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:57,216 INFO L471 AbstractCegarLoop]: Abstraction has 9620 states and 10719 transitions. [2025-03-08 01:41:57,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-08 01:41:57,217 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 10719 transitions. [2025-03-08 01:41:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-08 01:41:57,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:57,227 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 01:41:57,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:41:57,228 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:57,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -540510530, now seen corresponding path program 1 times [2025-03-08 01:41:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165942966] [2025-03-08 01:41:57,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:57,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 01:41:57,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 01:41:57,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:57,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:57,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1571 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-03-08 01:41:57,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:57,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165942966] [2025-03-08 01:41:57,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165942966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:57,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:57,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329352825] [2025-03-08 01:41:57,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:57,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:57,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:57,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:57,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:57,487 INFO L87 Difference]: Start difference. First operand 9620 states and 10719 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:58,020 INFO L93 Difference]: Finished difference Result 20893 states and 23289 transitions. [2025-03-08 01:41:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733 [2025-03-08 01:41:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:58,029 INFO L225 Difference]: With dead ends: 20893 [2025-03-08 01:41:58,029 INFO L226 Difference]: Without dead ends: 10170 [2025-03-08 01:41:58,036 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-08 01:41:58,037 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 194 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:58,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 340 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:41:58,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10170 states. [2025-03-08 01:41:58,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10170 to 10170. [2025-03-08 01:41:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10170 states, 10169 states have (on average 1.0946995771462287) internal successors, (11132), 10169 states have internal predecessors, (11132), 0 states have call successors, (0), 0 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-08 01:41:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 11132 transitions. [2025-03-08 01:41:58,162 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 11132 transitions. Word has length 733 [2025-03-08 01:41:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:58,162 INFO L471 AbstractCegarLoop]: Abstraction has 10170 states and 11132 transitions. [2025-03-08 01:41:58,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:58,163 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 11132 transitions. [2025-03-08 01:41:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 824 [2025-03-08 01:41:58,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:58,180 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2025-03-08 01:41:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:41:58,180 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1537341879, now seen corresponding path program 1 times [2025-03-08 01:41:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071662778] [2025-03-08 01:41:58,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:58,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 823 statements into 1 equivalence classes. [2025-03-08 01:41:58,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 823 of 823 statements. [2025-03-08 01:41:58,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:58,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1919 backedges. 1393 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2025-03-08 01:41:58,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071662778] [2025-03-08 01:41:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071662778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:58,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:58,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019024561] [2025-03-08 01:41:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:58,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:58,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:58,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:58,500 INFO L87 Difference]: Start difference. First operand 10170 states and 11132 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:59,012 INFO L93 Difference]: Finished difference Result 21439 states and 23424 transitions. [2025-03-08 01:41:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 823 [2025-03-08 01:41:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:59,013 INFO L225 Difference]: With dead ends: 21439 [2025-03-08 01:41:59,013 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:41:59,019 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-08 01:41:59,019 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:59,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 320 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 01:41:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:41:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:41:59,021 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-08 01:41:59,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:41:59,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 823 [2025-03-08 01:41:59,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:59,021 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:41:59,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:41:59,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:41:59,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:41:59,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 01:41:59,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:59,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:42:00,703 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:42:00,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:42:00 BoogieIcfgContainer [2025-03-08 01:42:00,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:42:00,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:42:00,717 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:42:00,718 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:42:00,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:37" (3/4) ... [2025-03-08 01:42:00,719 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:42:00,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:42:00,739 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:42:00,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:42:00,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:42:00,852 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:42:00,852 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:42:00,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:42:00,853 INFO L158 Benchmark]: Toolchain (without parser) took 25617.17ms. Allocated memory was 201.3MB in the beginning and 713.0MB in the end (delta: 511.7MB). Free memory was 151.6MB in the beginning and 298.4MB in the end (delta: -146.8MB). Peak memory consumption was 362.2MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,853 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:42:00,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.98ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 108.7MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.47ms. Allocated memory is still 201.3MB. Free memory was 108.7MB in the beginning and 91.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,853 INFO L158 Benchmark]: Boogie Preprocessor took 113.04ms. Allocated memory is still 201.3MB. Free memory was 91.6MB in the beginning and 68.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,854 INFO L158 Benchmark]: IcfgBuilder took 1360.33ms. Allocated memory is still 201.3MB. Free memory was 68.4MB in the beginning and 101.6MB in the end (delta: -33.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,854 INFO L158 Benchmark]: TraceAbstraction took 23380.70ms. Allocated memory was 201.3MB in the beginning and 713.0MB in the end (delta: 511.7MB). Free memory was 101.6MB in the beginning and 315.2MB in the end (delta: -213.6MB). Peak memory consumption was 416.0MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,854 INFO L158 Benchmark]: Witness Printer took 137.09ms. Allocated memory is still 713.0MB. Free memory was 315.2MB in the beginning and 298.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:42:00,855 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.14ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.98ms. Allocated memory is still 201.3MB. Free memory was 151.2MB in the beginning and 108.7MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.47ms. Allocated memory is still 201.3MB. Free memory was 108.7MB in the beginning and 91.6MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.04ms. Allocated memory is still 201.3MB. Free memory was 91.6MB in the beginning and 68.4MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1360.33ms. Allocated memory is still 201.3MB. Free memory was 68.4MB in the beginning and 101.6MB in the end (delta: -33.3MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23380.70ms. Allocated memory was 201.3MB in the beginning and 713.0MB in the end (delta: 511.7MB). Free memory was 101.6MB in the beginning and 315.2MB in the end (delta: -213.6MB). Peak memory consumption was 416.0MB. Max. memory is 16.1GB. * Witness Printer took 137.09ms. Allocated memory is still 713.0MB. Free memory was 315.2MB in the beginning and 298.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 91]: 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, 283 locations, 481 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 17, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3666 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3666 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 436 mSDsCounter, 2273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12797 IncrementalHoareTripleChecker+Invalid, 15070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2273 mSolverCounterUnsat, 3037 mSDtfsCounter, 12797 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 886 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13161occurred in iteration=11, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 11903 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 6231 NumberOfCodeBlocks, 6231 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 6520 ConstructedInterpolants, 0 QuantifiedInterpolants, 22058 SizeOfPredicates, 8 NumberOfNonLiveVariables, 741 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 7013/7192 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: ((((((((((((((((((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || (((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((a25 == 12) && (a4 == 0)) && (a29 <= 599998)) && (a8 == 15))) || ((((a25 == 13) && (a29 <= 245)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 13) && (307 <= a23)) || ((a25 == 13) && (a3 == 1))) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((a25 <= 10) && (a29 <= 599998)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (a8 == 15))) || ((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a8 == 15))) || (((((a25 == 13) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15))) || ((((((long long) a29 + 21) <= 0) && (a25 == 11)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a29 + 21) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 245)) && (a23 <= 138)) && (a8 == 15))) || ((((((a25 == 12) && (307 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998)) && (a8 == 15))) || (((((a25 == 11) && (a29 <= 599998)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:42:00,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE