./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.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 39463d01f5c85d47bf5e231172595e96b8ff556c59c4a9ab8cf46a88a393b05c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:39:11,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:39:11,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:39:11,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:39:11,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:39:11,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:39:11,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:39:11,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:39:11,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:39:11,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:39:11,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:39:11,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:39:11,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:39:11,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:39:11,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:39:11,986 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:39:11,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:39:11,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:39:11,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:39:11,987 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 -> 39463d01f5c85d47bf5e231172595e96b8ff556c59c4a9ab8cf46a88a393b05c [2025-03-03 13:39:12,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:39:12,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:39:12,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:39:12,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:39:12,211 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:39:12,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2025-03-03 13:39:13,375 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6898d19b/9e7cd28f4c334673800f4fe175ee9672/FLAGe089e39ce [2025-03-03 13:39:13,582 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:39:13,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2025-03-03 13:39:13,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6898d19b/9e7cd28f4c334673800f4fe175ee9672/FLAGe089e39ce [2025-03-03 13:39:13,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6898d19b/9e7cd28f4c334673800f4fe175ee9672 [2025-03-03 13:39:13,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:39:13,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:39:13,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:39:13,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:39:13,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:39:13,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:39:13" (1/1) ... [2025-03-03 13:39:13,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403b246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:13, skipping insertion in model container [2025-03-03 13:39:13,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:39:13" (1/1) ... [2025-03-03 13:39:13,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:39:14,058 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/loops-crafted-1/nested_delay_nd.c[465,478] [2025-03-03 13:39:14,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:39:14,080 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:39:14,087 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/loops-crafted-1/nested_delay_nd.c[465,478] [2025-03-03 13:39:14,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:39:14,104 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:39:14,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14 WrapperNode [2025-03-03 13:39:14,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:39:14,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:39:14,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:39:14,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:39:14,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,126 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-03-03 13:39:14,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:39:14,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:39:14,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:39:14,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:39:14,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,145 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 13:39:14,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,147 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:39:14,154 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:39:14,154 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:39:14,154 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:39:14,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (1/1) ... [2025-03-03 13:39:14,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:39:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:14,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 13:39:14,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 13:39:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:39:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:39:14,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:39:14,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:39:14,268 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:39:14,269 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:39:14,386 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 13:39:14,386 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:39:14,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:39:14,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:39:14,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:39:14 BoogieIcfgContainer [2025-03-03 13:39:14,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:39:14,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:39:14,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:39:14,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:39:14,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:39:13" (1/3) ... [2025-03-03 13:39:14,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fbf7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:39:14, skipping insertion in model container [2025-03-03 13:39:14,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:39:14" (2/3) ... [2025-03-03 13:39:14,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fbf7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:39:14, skipping insertion in model container [2025-03-03 13:39:14,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:39:14" (3/3) ... [2025-03-03 13:39:14,401 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2025-03-03 13:39:14,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:39:14,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nested_delay_nd.c that has 1 procedures, 20 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 13:39:14,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:39:14,454 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;@575903ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:39:14,455 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:39:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:39:14,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:14,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:14,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:14,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 950394200, now seen corresponding path program 1 times [2025-03-03 13:39:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:14,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334245931] [2025-03-03 13:39:14,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:14,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:14,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:39:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:39:14,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:14,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334245931] [2025-03-03 13:39:14,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334245931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:14,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 13:39:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437129764] [2025-03-03 13:39:14,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:14,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 13:39:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:14,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 13:39:14,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:39:14,587 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:14,594 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2025-03-03 13:39:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 13:39:14,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-03 13:39:14,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:14,599 INFO L225 Difference]: With dead ends: 34 [2025-03-03 13:39:14,599 INFO L226 Difference]: Without dead ends: 17 [2025-03-03 13:39:14,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 13:39:14,602 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:14,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:14,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-03 13:39:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-03 13:39:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-03 13:39:14,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2025-03-03 13:39:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:14,624 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-03 13:39:14,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-03-03 13:39:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 13:39:14,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:14,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:14,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:39:14,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:14,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 753880695, now seen corresponding path program 1 times [2025-03-03 13:39:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:14,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266333658] [2025-03-03 13:39:14,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:14,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 13:39:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 13:39:14,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:14,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:14,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266333658] [2025-03-03 13:39:14,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266333658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:14,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:14,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:14,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88457123] [2025-03-03 13:39:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:14,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:14,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:14,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:14,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:14,739 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:14,786 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-03-03 13:39:14,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:14,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-03 13:39:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:14,787 INFO L225 Difference]: With dead ends: 33 [2025-03-03 13:39:14,787 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 13:39:14,787 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-03 13:39:14,789 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:14,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 13:39:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 13:39:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-03 13:39:14,794 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2025-03-03 13:39:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:14,794 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-03 13:39:14,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-03 13:39:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:39:14,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:14,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:14,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:39:14,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:14,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -617869227, now seen corresponding path program 1 times [2025-03-03 13:39:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:14,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764272475] [2025-03-03 13:39:14,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:14,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:14,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:39:14,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:39:14,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:14,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:39:14,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:14,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764272475] [2025-03-03 13:39:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764272475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077000033] [2025-03-03 13:39:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:14,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:39:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:14,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:39:14,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:14,849 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:14,880 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2025-03-03 13:39:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:39:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:39:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:14,881 INFO L225 Difference]: With dead ends: 36 [2025-03-03 13:39:14,882 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 13:39:14,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:14,882 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:14,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 13:39:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-03-03 13:39:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 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-03 13:39:14,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-03 13:39:14,887 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2025-03-03 13:39:14,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:14,887 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-03 13:39:14,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-03 13:39:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:39:14,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:14,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:14,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:39:14,889 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:14,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash -589240076, now seen corresponding path program 1 times [2025-03-03 13:39:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760314427] [2025-03-03 13:39:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:14,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:39:14,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:39:14,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:14,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:39:14,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:14,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760314427] [2025-03-03 13:39:14,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760314427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:14,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:14,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:14,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564420634] [2025-03-03 13:39:14,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:14,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:39:14,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:14,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:39:14,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:39:14,978 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:15,002 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2025-03-03 13:39:15,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:39:15,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:39:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:15,003 INFO L225 Difference]: With dead ends: 49 [2025-03-03 13:39:15,003 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:39:15,003 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-03 13:39:15,004 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:15,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 29 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:15,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:39:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-03 13:39:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 31 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-03-03 13:39:15,008 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2025-03-03 13:39:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:15,009 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-03-03 13:39:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2025-03-03 13:39:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:39:15,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:15,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:15,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:39:15,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:15,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -589210285, now seen corresponding path program 1 times [2025-03-03 13:39:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:15,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078745735] [2025-03-03 13:39:15,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:15,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:15,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:39:15,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:39:15,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:15,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078745735] [2025-03-03 13:39:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078745735] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200452994] [2025-03-03 13:39:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:15,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:15,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:15,088 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-03 13:39:15,089 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-03 13:39:15,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-03 13:39:15,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:39:15,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:15,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:15,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:39:15,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:15,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200452994] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:15,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:15,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-03 13:39:15,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472641664] [2025-03-03 13:39:15,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:15,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:39:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:15,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:39:15,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:39:15,222 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:15,292 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2025-03-03 13:39:15,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:39:15,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:39:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:15,293 INFO L225 Difference]: With dead ends: 78 [2025-03-03 13:39:15,293 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 13:39:15,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-03 13:39:15,295 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:15,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 13:39:15,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-03 13:39:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:15,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2025-03-03 13:39:15,304 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2025-03-03 13:39:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:15,304 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2025-03-03 13:39:15,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2025-03-03 13:39:15,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:39:15,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:15,306 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:15,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:15,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1544667637, now seen corresponding path program 2 times [2025-03-03 13:39:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003046186] [2025-03-03 13:39:15,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:15,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:39:15,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:15,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:15,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:15,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 13:39:15,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003046186] [2025-03-03 13:39:15,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003046186] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:15,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082109863] [2025-03-03 13:39:15,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:15,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:15,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:15,605 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-03 13:39:15,607 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-03 13:39:15,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:39:15,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:15,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:15,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 13:39:15,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 13:39:15,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 13:39:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082109863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:15,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-03 13:39:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364469670] [2025-03-03 13:39:15,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:15,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 13:39:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 13:39:15,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-03 13:39:15,782 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:16,017 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2025-03-03 13:39:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 13:39:16,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 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 24 [2025-03-03 13:39:16,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:16,020 INFO L225 Difference]: With dead ends: 169 [2025-03-03 13:39:16,020 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 13:39:16,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:39:16,020 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 96 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:16,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 100 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:16,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 13:39:16,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2025-03-03 13:39:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 111 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2025-03-03 13:39:16,040 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 24 [2025-03-03 13:39:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:16,040 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2025-03-03 13:39:16,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2025-03-03 13:39:16,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:39:16,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:16,041 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:16,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:39:16,241 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,SelfDestructingSolverStorable5 [2025-03-03 13:39:16,241 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:16,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash 376775349, now seen corresponding path program 1 times [2025-03-03 13:39:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:16,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5691134] [2025-03-03 13:39:16,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:16,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:16,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 13:39:16,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:39:16,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:16,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 13:39:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5691134] [2025-03-03 13:39:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5691134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:16,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795769557] [2025-03-03 13:39:16,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:16,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:39:16,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:16,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:39:16,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:16,280 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:16,305 INFO L93 Difference]: Finished difference Result 241 states and 315 transitions. [2025-03-03 13:39:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:39:16,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-03 13:39:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:16,306 INFO L225 Difference]: With dead ends: 241 [2025-03-03 13:39:16,307 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 13:39:16,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:16,308 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:16,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 13:39:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2025-03-03 13:39:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.280373831775701) internal successors, (137), 107 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2025-03-03 13:39:16,322 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 24 [2025-03-03 13:39:16,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:16,322 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2025-03-03 13:39:16,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2025-03-03 13:39:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:39:16,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:16,324 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:16,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 13:39:16,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:16,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:16,325 INFO L85 PathProgramCache]: Analyzing trace with hash 727822736, now seen corresponding path program 1 times [2025-03-03 13:39:16,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155719337] [2025-03-03 13:39:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:16,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:39:16,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:16,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:16,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 13:39:16,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:16,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155719337] [2025-03-03 13:39:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155719337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:16,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:16,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:39:16,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037510904] [2025-03-03 13:39:16,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:16,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:39:16,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:16,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:39:16,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:16,363 INFO L87 Difference]: Start difference. First operand 108 states and 137 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:16,384 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-03-03 13:39:16,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:39:16,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-03 13:39:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:16,386 INFO L225 Difference]: With dead ends: 165 [2025-03-03 13:39:16,386 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 13:39:16,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:39:16,387 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:16,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 13:39:16,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-03 13:39:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 111 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-03 13:39:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-03-03 13:39:16,401 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 25 [2025-03-03 13:39:16,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:16,401 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-03-03 13:39:16,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-03-03 13:39:16,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 13:39:16,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:16,401 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:16,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 13:39:16,402 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:16,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 728776048, now seen corresponding path program 1 times [2025-03-03 13:39:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850683610] [2025-03-03 13:39:16,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:16,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:16,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:39:16,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:16,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:16,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850683610] [2025-03-03 13:39:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850683610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217259194] [2025-03-03 13:39:16,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:16,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:16,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:16,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:16,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 13:39:16,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 13:39:16,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 13:39:16,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:16,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:16,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:39:16,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:16,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:16,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217259194] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:16,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:16,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-03 13:39:16,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174971512] [2025-03-03 13:39:16,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:16,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 13:39:16,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:16,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 13:39:16,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:39:16,685 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:16,817 INFO L93 Difference]: Finished difference Result 328 states and 442 transitions. [2025-03-03 13:39:16,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 13:39:16,817 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 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-03 13:39:16,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:16,818 INFO L225 Difference]: With dead ends: 328 [2025-03-03 13:39:16,818 INFO L226 Difference]: Without dead ends: 220 [2025-03-03 13:39:16,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:39:16,819 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 78 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:16,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 24 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-03 13:39:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-03 13:39:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 219 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2025-03-03 13:39:16,841 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 25 [2025-03-03 13:39:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:16,841 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2025-03-03 13:39:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2025-03-03 13:39:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 13:39:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:16,843 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:16,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:17,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:17,045 INFO L85 PathProgramCache]: Analyzing trace with hash 472089520, now seen corresponding path program 2 times [2025-03-03 13:39:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023837919] [2025-03-03 13:39:17,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:17,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 13:39:17,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:39:17,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:17,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023837919] [2025-03-03 13:39:17,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023837919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624782414] [2025-03-03 13:39:17,208 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:17,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:17,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:17,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:17,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 13:39:17,234 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-03 13:39:17,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 13:39:17,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:17,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:17,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 13:39:17,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:17,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:39:17,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624782414] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:17,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:17,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-03 13:39:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142429060] [2025-03-03 13:39:17,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:17,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 13:39:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:17,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 13:39:17,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:39:17,665 INFO L87 Difference]: Start difference. First operand 220 states and 271 transitions. Second operand has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:17,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:17,996 INFO L93 Difference]: Finished difference Result 652 states and 874 transitions. [2025-03-03 13:39:17,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 13:39:17,997 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 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 43 [2025-03-03 13:39:17,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:17,999 INFO L225 Difference]: With dead ends: 652 [2025-03-03 13:39:17,999 INFO L226 Difference]: Without dead ends: 436 [2025-03-03 13:39:18,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 13:39:18,000 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:18,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 48 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:39:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-03 13:39:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-03 13:39:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.2298850574712643) internal successors, (535), 435 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 535 transitions. [2025-03-03 13:39:18,034 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 535 transitions. Word has length 43 [2025-03-03 13:39:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 535 transitions. [2025-03-03 13:39:18,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.0) internal successors, (111), 36 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 535 transitions. [2025-03-03 13:39:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 13:39:18,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:18,035 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:18,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:18,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:18,236 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:18,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:18,237 INFO L85 PathProgramCache]: Analyzing trace with hash 140959792, now seen corresponding path program 3 times [2025-03-03 13:39:18,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:18,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663322941] [2025-03-03 13:39:18,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:39:18,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:18,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 23 equivalence classes. [2025-03-03 13:39:18,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 79 statements. [2025-03-03 13:39:18,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:39:18,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-03-03 13:39:18,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:18,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663322941] [2025-03-03 13:39:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663322941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 13:39:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018446520] [2025-03-03 13:39:18,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:18,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:39:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:18,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:39:18,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:39:18,380 INFO L87 Difference]: Start difference. First operand 436 states and 535 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:18,449 INFO L93 Difference]: Finished difference Result 651 states and 800 transitions. [2025-03-03 13:39:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:39:18,450 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 79 [2025-03-03 13:39:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:18,453 INFO L225 Difference]: With dead ends: 651 [2025-03-03 13:39:18,455 INFO L226 Difference]: Without dead ends: 649 [2025-03-03 13:39:18,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:39:18,456 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:18,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 35 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-03 13:39:18,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-03-03 13:39:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.228395061728395) internal successors, (796), 648 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 796 transitions. [2025-03-03 13:39:18,497 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 796 transitions. Word has length 79 [2025-03-03 13:39:18,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:18,497 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 796 transitions. [2025-03-03 13:39:18,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 796 transitions. [2025-03-03 13:39:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 13:39:18,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:18,498 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:18,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 13:39:18,499 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:18,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:18,499 INFO L85 PathProgramCache]: Analyzing trace with hash -375951312, now seen corresponding path program 1 times [2025-03-03 13:39:18,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:18,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500981737] [2025-03-03 13:39:18,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:18,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 13:39:18,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 13:39:18,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:18,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-03 13:39:18,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500981737] [2025-03-03 13:39:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500981737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:18,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:18,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:39:18,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672185261] [2025-03-03 13:39:18,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:18,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:39:18,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:18,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:39:18,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:39:18,581 INFO L87 Difference]: Start difference. First operand 649 states and 796 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:18,639 INFO L93 Difference]: Finished difference Result 1085 states and 1331 transitions. [2025-03-03 13:39:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:39:18,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 79 [2025-03-03 13:39:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:18,643 INFO L225 Difference]: With dead ends: 1085 [2025-03-03 13:39:18,643 INFO L226 Difference]: Without dead ends: 868 [2025-03-03 13:39:18,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:39:18,644 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 79 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:18,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 38 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-03 13:39:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 789. [2025-03-03 13:39:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.2461928934010151) internal successors, (982), 788 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 982 transitions. [2025-03-03 13:39:18,702 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 982 transitions. Word has length 79 [2025-03-03 13:39:18,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:18,702 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 982 transitions. [2025-03-03 13:39:18,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:18,703 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 982 transitions. [2025-03-03 13:39:18,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 13:39:18,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:18,704 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 44, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:18,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 13:39:18,704 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:18,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:18,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1780522402, now seen corresponding path program 1 times [2025-03-03 13:39:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462318830] [2025-03-03 13:39:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:18,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 13:39:18,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 13:39:18,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:18,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1498 proven. 715 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 13:39:19,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462318830] [2025-03-03 13:39:19,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462318830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:19,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321790422] [2025-03-03 13:39:19,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:19,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:19,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:19,337 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:19,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 13:39:19,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 13:39:19,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 13:39:19,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:19,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:19,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 13:39:19,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1498 proven. 715 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 13:39:19,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1498 proven. 715 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2025-03-03 13:39:20,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321790422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:20,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:20,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-03-03 13:39:20,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663310812] [2025-03-03 13:39:20,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:20,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-03 13:39:20,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:20,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-03 13:39:20,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 13:39:20,653 INFO L87 Difference]: Start difference. First operand 789 states and 982 transitions. Second operand has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:21,604 INFO L93 Difference]: Finished difference Result 2171 states and 2968 transitions. [2025-03-03 13:39:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 13:39:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-03-03 13:39:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:21,610 INFO L225 Difference]: With dead ends: 2171 [2025-03-03 13:39:21,610 INFO L226 Difference]: Without dead ends: 1581 [2025-03-03 13:39:21,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 13:39:21,614 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 399 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:21,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 54 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:39:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-03-03 13:39:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2025-03-03 13:39:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.2443037974683544) internal successors, (1966), 1580 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1966 transitions. [2025-03-03 13:39:21,672 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1966 transitions. Word has length 154 [2025-03-03 13:39:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:21,672 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 1966 transitions. [2025-03-03 13:39:21,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.095890410958904) internal successors, (226), 72 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1966 transitions. [2025-03-03 13:39:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 13:39:21,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:21,679 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 92, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:21,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:39:21,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 13:39:21,883 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:21,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1888756830, now seen corresponding path program 2 times [2025-03-03 13:39:21,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:21,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497774535] [2025-03-03 13:39:21,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:21,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:21,892 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 298 statements into 2 equivalence classes. [2025-03-03 13:39:21,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 13:39:21,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:21,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 12565 trivial. 0 not checked. [2025-03-03 13:39:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497774535] [2025-03-03 13:39:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497774535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:22,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:22,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 13:39:22,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722984601] [2025-03-03 13:39:22,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:22,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 13:39:22,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:22,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 13:39:22,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:39:22,115 INFO L87 Difference]: Start difference. First operand 1581 states and 1966 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:22,161 INFO L93 Difference]: Finished difference Result 1583 states and 1967 transitions. [2025-03-03 13:39:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:39:22,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 298 [2025-03-03 13:39:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:22,165 INFO L225 Difference]: With dead ends: 1583 [2025-03-03 13:39:22,165 INFO L226 Difference]: Without dead ends: 1144 [2025-03-03 13:39:22,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 13:39:22,166 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:22,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 19 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:39:22,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-03 13:39:22,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2025-03-03 13:39:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 1143 states have (on average 1.3289588801399825) internal successors, (1519), 1143 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1519 transitions. [2025-03-03 13:39:22,207 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1519 transitions. Word has length 298 [2025-03-03 13:39:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:22,207 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1519 transitions. [2025-03-03 13:39:22,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1519 transitions. [2025-03-03 13:39:22,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-03 13:39:22,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:22,210 INFO L218 NwaCegarLoop]: trace histogram [92, 92, 90, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:22,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 13:39:22,210 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:22,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:22,211 INFO L85 PathProgramCache]: Analyzing trace with hash 154887074, now seen corresponding path program 1 times [2025-03-03 13:39:22,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:22,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24681807] [2025-03-03 13:39:22,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:22,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:22,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 13:39:22,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 13:39:22,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:22,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 6442 proven. 3151 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-03-03 13:39:23,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:23,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24681807] [2025-03-03 13:39:23,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24681807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089619324] [2025-03-03 13:39:23,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:23,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:23,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 13:39:23,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-03 13:39:23,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-03 13:39:23,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:23,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:23,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 13:39:23,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 6442 proven. 3151 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-03-03 13:39:25,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:27,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12750 backedges. 6442 proven. 3151 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2025-03-03 13:39:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089619324] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:27,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 144 [2025-03-03 13:39:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068426372] [2025-03-03 13:39:27,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2025-03-03 13:39:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:27,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2025-03-03 13:39:27,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9219, Invalid=11661, Unknown=0, NotChecked=0, Total=20880 [2025-03-03 13:39:27,177 INFO L87 Difference]: Start difference. First operand 1144 states and 1519 transitions. Second operand has 145 states, 145 states have (on average 3.0551724137931036) internal successors, (443), 144 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:29,954 INFO L93 Difference]: Finished difference Result 3162 states and 4589 transitions. [2025-03-03 13:39:29,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-03 13:39:29,954 INFO L78 Accepts]: Start accepts. Automaton has has 145 states, 145 states have (on average 3.0551724137931036) internal successors, (443), 144 states have internal predecessors, (443), 0 states have call successors, (0), 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 298 [2025-03-03 13:39:29,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:29,961 INFO L225 Difference]: With dead ends: 3162 [2025-03-03 13:39:29,961 INFO L226 Difference]: Without dead ends: 2296 [2025-03-03 13:39:29,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13345 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=13872, Invalid=22800, Unknown=0, NotChecked=0, Total=36672 [2025-03-03 13:39:29,973 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 867 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:29,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 48 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:39:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-03-03 13:39:30,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2025-03-03 13:39:30,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 1.3311546840958606) internal successors, (3055), 2295 states have internal predecessors, (3055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3055 transitions. [2025-03-03 13:39:30,063 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3055 transitions. Word has length 298 [2025-03-03 13:39:30,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:30,063 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 3055 transitions. [2025-03-03 13:39:30,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 145 states, 145 states have (on average 3.0551724137931036) internal successors, (443), 144 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:30,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3055 transitions. [2025-03-03 13:39:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-03 13:39:30,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:30,070 INFO L218 NwaCegarLoop]: trace histogram [188, 188, 186, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:30,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:39:30,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 13:39:30,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:30,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1682218914, now seen corresponding path program 2 times [2025-03-03 13:39:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850798842] [2025-03-03 13:39:30,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:39:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:30,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 586 statements into 2 equivalence classes. [2025-03-03 13:39:30,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 13:39:30,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:39:30,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:35,294 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 39904 proven. 0 refuted. 0 times theorem prover too weak. 13214 trivial. 0 not checked. [2025-03-03 13:39:35,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:35,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850798842] [2025-03-03 13:39:35,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850798842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:39:35,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:39:35,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2025-03-03 13:39:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807569384] [2025-03-03 13:39:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:39:35,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-03 13:39:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:35,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-03 13:39:35,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 13:39:35,297 INFO L87 Difference]: Start difference. First operand 2296 states and 3055 transitions. Second operand has 96 states, 96 states have (on average 3.15625) internal successors, (303), 96 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:39:38,828 INFO L93 Difference]: Finished difference Result 57119 states and 76118 transitions. [2025-03-03 13:39:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 13:39:38,829 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 3.15625) internal successors, (303), 96 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 586 [2025-03-03 13:39:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:39:38,934 INFO L225 Difference]: With dead ends: 57119 [2025-03-03 13:39:38,935 INFO L226 Difference]: Without dead ends: 55120 [2025-03-03 13:39:38,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 13:39:38,953 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2374 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 13:39:38,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 238 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 13:39:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55120 states. [2025-03-03 13:39:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55120 to 2308. [2025-03-03 13:39:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 2307 states have (on average 1.1716514954486346) internal successors, (2703), 2307 states have internal predecessors, (2703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2703 transitions. [2025-03-03 13:39:39,704 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2703 transitions. Word has length 586 [2025-03-03 13:39:39,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:39:39,706 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 2703 transitions. [2025-03-03 13:39:39,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 3.15625) internal successors, (303), 96 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:39:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2703 transitions. [2025-03-03 13:39:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-03 13:39:39,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:39:39,714 INFO L218 NwaCegarLoop]: trace histogram [188, 188, 186, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:39:39,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 13:39:39,715 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:39:39,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:39:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 925773826, now seen corresponding path program 1 times [2025-03-03 13:39:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:39:39,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715025026] [2025-03-03 13:39:39,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:39:39,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 13:39:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 13:39:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 26698 proven. 13207 refuted. 0 times theorem prover too weak. 13213 trivial. 0 not checked. [2025-03-03 13:39:44,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:39:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715025026] [2025-03-03 13:39:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715025026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:39:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334281437] [2025-03-03 13:39:44,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:39:44,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:39:44,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:39:44,801 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:39:44,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 13:39:44,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-03 13:39:44,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-03 13:39:44,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:39:44,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:39:44,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-03 13:39:44,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:39:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 26698 proven. 13207 refuted. 0 times theorem prover too weak. 13213 trivial. 0 not checked. [2025-03-03 13:39:48,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:39:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 53118 backedges. 26698 proven. 13207 refuted. 0 times theorem prover too weak. 13213 trivial. 0 not checked. [2025-03-03 13:39:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334281437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:39:56,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:39:56,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 288 [2025-03-03 13:39:56,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276717566] [2025-03-03 13:39:56,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:39:56,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 289 states [2025-03-03 13:39:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:39:56,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 289 interpolants. [2025-03-03 13:39:56,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36867, Invalid=46365, Unknown=0, NotChecked=0, Total=83232 [2025-03-03 13:39:56,284 INFO L87 Difference]: Start difference. First operand 2308 states and 2703 transitions. Second operand has 289 states, 289 states have (on average 3.027681660899654) internal successors, (875), 288 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:40:11,117 INFO L93 Difference]: Finished difference Result 7120 states and 9350 transitions. [2025-03-03 13:40:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-03-03 13:40:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 289 states, 289 states have (on average 3.027681660899654) internal successors, (875), 288 states have internal predecessors, (875), 0 states have call successors, (0), 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 586 [2025-03-03 13:40:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:40:11,126 INFO L225 Difference]: With dead ends: 7120 [2025-03-03 13:40:11,126 INFO L226 Difference]: Without dead ends: 5380 [2025-03-03 13:40:11,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1362 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54337 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=55392, Invalid=91680, Unknown=0, NotChecked=0, Total=147072 [2025-03-03 13:40:11,133 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1803 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 13:40:11,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1803 Valid, 78 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 13:40:11,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2025-03-03 13:40:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4612. [2025-03-03 13:40:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.1691607026675341) internal successors, (5391), 4611 states have internal predecessors, (5391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5391 transitions. [2025-03-03 13:40:12,167 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5391 transitions. Word has length 586 [2025-03-03 13:40:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:40:12,167 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 5391 transitions. [2025-03-03 13:40:12,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 289 states, 289 states have (on average 3.027681660899654) internal successors, (875), 288 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:40:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5391 transitions. [2025-03-03 13:40:12,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1163 [2025-03-03 13:40:12,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:40:12,177 INFO L218 NwaCegarLoop]: trace histogram [380, 380, 378, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:40:12,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 13:40:12,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:12,378 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:40:12,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:40:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1446867966, now seen corresponding path program 2 times [2025-03-03 13:40:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:40:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006827934] [2025-03-03 13:40:12,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:12,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:40:12,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1162 statements into 2 equivalence classes. [2025-03-03 13:40:12,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1162 of 1162 statements. [2025-03-03 13:40:12,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:12,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 216798 backedges. 108682 proven. 54055 refuted. 0 times theorem prover too weak. 54061 trivial. 0 not checked. [2025-03-03 13:40:34,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:40:34,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006827934] [2025-03-03 13:40:34,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006827934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:40:34,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041753171] [2025-03-03 13:40:34,731 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:40:34,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:40:34,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:40:34,732 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 13:40:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 13:40:34,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1162 statements into 2 equivalence classes. [2025-03-03 13:40:34,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1162 of 1162 statements. [2025-03-03 13:40:34,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:40:34,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:40:34,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 2357 conjuncts, 193 conjuncts are in the unsatisfiable core [2025-03-03 13:40:35,003 INFO L279 TraceCheckSpWp]: Computing forward predicates...