./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 04:49:07,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:49:07,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:49:07,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:49:07,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:49:07,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:49:07,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:49:07,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:49:07,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:49:07,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:49:07,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:49:07,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:49:07,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:49:07,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:49:07,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:49:07,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:49:07,142 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:49:07,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:49:07,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:49:07,142 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-08 04:49:07,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:49:07,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:49:07,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:49:07,394 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:49:07,394 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:49:07,395 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-08 04:49:08,488 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304d527e8/013f2109a382495d8c676bbca2db2a05/FLAG37a1f7359 [2025-03-08 04:49:08,687 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:49:08,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2025-03-08 04:49:08,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304d527e8/013f2109a382495d8c676bbca2db2a05/FLAG37a1f7359 [2025-03-08 04:49:09,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304d527e8/013f2109a382495d8c676bbca2db2a05 [2025-03-08 04:49:09,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:49:09,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:49:09,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:49:09,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:49:09,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:49:09,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d3e4cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09, skipping insertion in model container [2025-03-08 04:49:09,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:49:09,155 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-08 04:49:09,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:49:09,170 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:49:09,176 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-08 04:49:09,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:49:09,191 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:49:09,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09 WrapperNode [2025-03-08 04:49:09,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:49:09,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:49:09,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:49:09,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:49:09,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,215 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-03-08 04:49:09,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:49:09,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:49:09,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:49:09,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:49:09,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,232 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 04:49:09,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,234 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,238 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:49:09,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:49:09,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:49:09,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:49:09,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (1/1) ... [2025-03-08 04:49:09,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:49:09,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:09,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:49:09,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:49:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:49:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:49:09,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:49:09,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:49:09,335 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:49:09,336 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:49:09,463 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 04:49:09,463 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:49:09,469 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:49:09,469 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:49:09,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:09 BoogieIcfgContainer [2025-03-08 04:49:09,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:49:09,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:49:09,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:49:09,476 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:49:09,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:49:09" (1/3) ... [2025-03-08 04:49:09,477 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea9a2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:09, skipping insertion in model container [2025-03-08 04:49:09,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:09" (2/3) ... [2025-03-08 04:49:09,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea9a2b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:09, skipping insertion in model container [2025-03-08 04:49:09,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:09" (3/3) ... [2025-03-08 04:49:09,482 INFO L128 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2025-03-08 04:49:09,492 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:49:09,493 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-08 04:49:09,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:49:09,540 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;@36255312, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:49:09,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:49:09,544 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-08 04:49:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:49:09,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:09,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:09,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:09,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash 950394200, now seen corresponding path program 1 times [2025-03-08 04:49:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:09,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949317189] [2025-03-08 04:49:09,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:09,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:49:09,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:49:09,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:09,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949317189] [2025-03-08 04:49:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949317189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:09,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:49:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741372442] [2025-03-08 04:49:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:09,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:49:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:09,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:49:09,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:49:09,670 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-08 04:49:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:09,677 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2025-03-08 04:49:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:49:09,678 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-08 04:49:09,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:09,682 INFO L225 Difference]: With dead ends: 34 [2025-03-08 04:49:09,682 INFO L226 Difference]: Without dead ends: 17 [2025-03-08 04:49:09,683 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-08 04:49:09,685 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-08 04:49:09,685 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-08 04:49:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-03-08 04:49:09,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-03-08 04:49:09,698 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-08 04:49:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-08 04:49:09,701 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 12 [2025-03-08 04:49:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:09,701 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-08 04:49:09,701 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-08 04:49:09,702 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-03-08 04:49:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:49:09,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:09,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:09,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:49:09,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:09,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash 753880695, now seen corresponding path program 1 times [2025-03-08 04:49:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:09,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841777872] [2025-03-08 04:49:09,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:09,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:49:09,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:49:09,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:09,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:49:09,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:09,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841777872] [2025-03-08 04:49:09,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841777872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:09,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:09,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:49:09,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267562638] [2025-03-08 04:49:09,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:09,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:49:09,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:09,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:49:09,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:49:09,807 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-08 04:49:09,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:09,843 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2025-03-08 04:49:09,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:49:09,843 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-08 04:49:09,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:09,844 INFO L225 Difference]: With dead ends: 33 [2025-03-08 04:49:09,844 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 04:49:09,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:49:09,845 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-08 04:49:09,845 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-08 04:49:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 04:49:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 04:49:09,847 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-08 04:49:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-08 04:49:09,847 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2025-03-08 04:49:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:09,848 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-08 04:49:09,848 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-08 04:49:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-08 04:49:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:49:09,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:09,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:09,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:49:09,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:09,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash -617869227, now seen corresponding path program 1 times [2025-03-08 04:49:09,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:09,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952687692] [2025-03-08 04:49:09,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:09,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:09,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:49:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:49:09,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:09,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:09,904 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-08 04:49:09,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:09,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952687692] [2025-03-08 04:49:09,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952687692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:09,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:09,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:49:09,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873767754] [2025-03-08 04:49:09,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:09,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:49:09,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:09,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:49:09,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:49:09,907 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-08 04:49:09,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:09,938 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2025-03-08 04:49:09,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:49:09,940 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-08 04:49:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:09,940 INFO L225 Difference]: With dead ends: 36 [2025-03-08 04:49:09,940 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 04:49:09,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:49:09,941 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-08 04:49:09,941 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-08 04:49:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 04:49:09,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2025-03-08 04:49:09,942 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-08 04:49:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-08 04:49:09,943 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 15 [2025-03-08 04:49:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:09,943 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-08 04:49:09,943 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-08 04:49:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-08 04:49:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:49:09,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:09,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:09,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:49:09,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:09,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash -589240076, now seen corresponding path program 1 times [2025-03-08 04:49:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:09,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540278764] [2025-03-08 04:49:09,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:09,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:49:09,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:49:09,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:09,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:10,039 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-08 04:49:10,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:10,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540278764] [2025-03-08 04:49:10,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540278764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:10,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:10,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:49:10,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628874916] [2025-03-08 04:49:10,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:10,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:49:10,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:10,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:49:10,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:49:10,040 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-08 04:49:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:10,069 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2025-03-08 04:49:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:49:10,069 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-08 04:49:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:10,070 INFO L225 Difference]: With dead ends: 49 [2025-03-08 04:49:10,070 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:49:10,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:49:10,071 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-08 04:49:10,071 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-08 04:49:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:49:10,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-08 04:49:10,074 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-08 04:49:10,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-03-08 04:49:10,075 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 15 [2025-03-08 04:49:10,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:10,075 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-03-08 04:49:10,075 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-08 04:49:10,075 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2025-03-08 04:49:10,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:49:10,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:10,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:10,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:49:10,076 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:10,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash -589210285, now seen corresponding path program 1 times [2025-03-08 04:49:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674644250] [2025-03-08 04:49:10,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:10,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:49:10,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:49:10,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:10,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:10,149 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-08 04:49:10,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:10,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674644250] [2025-03-08 04:49:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674644250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:10,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788619187] [2025-03-08 04:49:10,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:10,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:10,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:10,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:49:10,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:49:10,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:49:10,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:49:10,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:10,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:10,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:49:10,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:10,264 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-08 04:49:10,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:10,301 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-08 04:49:10,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788619187] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:10,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:10,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-08 04:49:10,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946109060] [2025-03-08 04:49:10,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:10,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:49:10,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:10,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:49:10,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:49:10,304 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-08 04:49:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:10,388 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2025-03-08 04:49:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:49:10,389 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-08 04:49:10,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:10,389 INFO L225 Difference]: With dead ends: 78 [2025-03-08 04:49:10,389 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 04:49:10,390 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-08 04:49:10,390 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-08 04:49:10,390 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-08 04:49:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 04:49:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 04:49:10,394 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-08 04:49:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2025-03-08 04:49:10,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 15 [2025-03-08 04:49:10,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:10,395 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2025-03-08 04:49:10,395 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-08 04:49:10,395 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2025-03-08 04:49:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:49:10,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:10,396 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:10,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:49:10,596 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-08 04:49:10,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:10,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1544667637, now seen corresponding path program 2 times [2025-03-08 04:49:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:10,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335155621] [2025-03-08 04:49:10,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:10,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 04:49:10,610 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:49:10,610 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:10,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:10,692 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-08 04:49:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335155621] [2025-03-08 04:49:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335155621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459623493] [2025-03-08 04:49:10,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:10,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:10,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:10,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:49:10,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:49:10,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 04:49:10,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:49:10,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:10,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:10,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:49:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:10,837 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-08 04:49:10,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:10,890 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-08 04:49:10,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459623493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:10,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:10,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-03-08 04:49:10,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716194164] [2025-03-08 04:49:10,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:10,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:49:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:10,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:49:10,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:49:10,891 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-08 04:49:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:11,104 INFO L93 Difference]: Finished difference Result 169 states and 233 transitions. [2025-03-08 04:49:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:49:11,106 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-08 04:49:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:11,107 INFO L225 Difference]: With dead ends: 169 [2025-03-08 04:49:11,107 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 04:49:11,107 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-08 04:49:11,107 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-08 04:49:11,107 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-08 04:49:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 04:49:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2025-03-08 04:49:11,122 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-08 04:49:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2025-03-08 04:49:11,122 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 24 [2025-03-08 04:49:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:11,122 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2025-03-08 04:49:11,123 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-08 04:49:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2025-03-08 04:49:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:49:11,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:11,123 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:11,129 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-08 04:49:11,323 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-08 04:49:11,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:11,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash 376775349, now seen corresponding path program 1 times [2025-03-08 04:49:11,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029917632] [2025-03-08 04:49:11,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:11,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:49:11,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:49:11,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:11,348 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-08 04:49:11,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:11,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029917632] [2025-03-08 04:49:11,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029917632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:11,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:11,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:49:11,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936564196] [2025-03-08 04:49:11,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:11,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:49:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:11,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:49:11,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:49:11,349 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-08 04:49:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:11,371 INFO L93 Difference]: Finished difference Result 241 states and 315 transitions. [2025-03-08 04:49:11,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:49:11,371 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-08 04:49:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:11,372 INFO L225 Difference]: With dead ends: 241 [2025-03-08 04:49:11,372 INFO L226 Difference]: Without dead ends: 133 [2025-03-08 04:49:11,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:49:11,372 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-08 04:49:11,373 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-08 04:49:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-08 04:49:11,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 108. [2025-03-08 04:49:11,390 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-08 04:49:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 137 transitions. [2025-03-08 04:49:11,390 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 137 transitions. Word has length 24 [2025-03-08 04:49:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 137 transitions. [2025-03-08 04:49:11,391 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-08 04:49:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 137 transitions. [2025-03-08 04:49:11,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:49:11,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:11,391 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:11,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 04:49:11,391 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 727822736, now seen corresponding path program 1 times [2025-03-08 04:49:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847696568] [2025-03-08 04:49:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:11,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:49:11,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:49:11,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:11,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:11,424 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-08 04:49:11,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:11,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847696568] [2025-03-08 04:49:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847696568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:49:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893665116] [2025-03-08 04:49:11,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:11,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:49:11,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:11,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:49:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:49:11,425 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-08 04:49:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:11,459 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2025-03-08 04:49:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:49:11,460 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-08 04:49:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:11,460 INFO L225 Difference]: With dead ends: 165 [2025-03-08 04:49:11,460 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 04:49:11,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:49:11,461 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-08 04:49:11,461 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-08 04:49:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 04:49:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-08 04:49:11,472 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-08 04:49:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2025-03-08 04:49:11,472 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 25 [2025-03-08 04:49:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:11,472 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2025-03-08 04:49:11,472 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-08 04:49:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2025-03-08 04:49:11,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 04:49:11,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:11,473 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:11,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 04:49:11,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:11,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:11,473 INFO L85 PathProgramCache]: Analyzing trace with hash 728776048, now seen corresponding path program 1 times [2025-03-08 04:49:11,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:11,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790487307] [2025-03-08 04:49:11,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:11,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:49:11,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:49:11,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:11,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:11,551 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-08 04:49:11,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:11,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790487307] [2025-03-08 04:49:11,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790487307] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742129848] [2025-03-08 04:49:11,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:11,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:11,553 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-08 04:49:11,555 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-08 04:49:11,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 04:49:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 04:49:11,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:11,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:11,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:49:11,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:11,660 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-08 04:49:11,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:11,728 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-08 04:49:11,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742129848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:11,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:11,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2025-03-08 04:49:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968754125] [2025-03-08 04:49:11,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:49:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:11,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:49:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:49:11,732 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-08 04:49:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:11,859 INFO L93 Difference]: Finished difference Result 328 states and 442 transitions. [2025-03-08 04:49:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:49:11,859 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-08 04:49:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:11,861 INFO L225 Difference]: With dead ends: 328 [2025-03-08 04:49:11,861 INFO L226 Difference]: Without dead ends: 220 [2025-03-08 04:49:11,862 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-08 04:49:11,863 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-08 04:49:11,863 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-08 04:49:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-08 04:49:11,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-08 04:49:11,881 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-08 04:49:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 271 transitions. [2025-03-08 04:49:11,883 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 271 transitions. Word has length 25 [2025-03-08 04:49:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 271 transitions. [2025-03-08 04:49:11,883 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-08 04:49:11,884 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2025-03-08 04:49:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 04:49:11,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:11,885 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:11,891 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-08 04:49:12,086 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-08 04:49:12,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:12,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:12,086 INFO L85 PathProgramCache]: Analyzing trace with hash 472089520, now seen corresponding path program 2 times [2025-03-08 04:49:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441901638] [2025-03-08 04:49:12,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:12,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:12,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-08 04:49:12,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:49:12,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:12,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:12,278 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-08 04:49:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441901638] [2025-03-08 04:49:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441901638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841808853] [2025-03-08 04:49:12,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:12,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:12,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:12,280 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-08 04:49:12,282 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-08 04:49:12,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-08 04:49:12,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 04:49:12,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:12,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 04:49:12,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:12,512 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-08 04:49:12,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:12,767 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-08 04:49:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841808853] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:12,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2025-03-08 04:49:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798002285] [2025-03-08 04:49:12,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 04:49:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:12,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 04:49:12,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 04:49:12,770 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-08 04:49:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:13,107 INFO L93 Difference]: Finished difference Result 652 states and 874 transitions. [2025-03-08 04:49:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 04:49:13,107 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-08 04:49:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:13,109 INFO L225 Difference]: With dead ends: 652 [2025-03-08 04:49:13,109 INFO L226 Difference]: Without dead ends: 436 [2025-03-08 04:49:13,110 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-08 04:49:13,111 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-08 04:49:13,111 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-08 04:49:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-08 04:49:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-03-08 04:49:13,147 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-08 04:49:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 535 transitions. [2025-03-08 04:49:13,148 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 535 transitions. Word has length 43 [2025-03-08 04:49:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 535 transitions. [2025-03-08 04:49:13,149 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-08 04:49:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 535 transitions. [2025-03-08 04:49:13,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 04:49:13,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:13,153 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:13,159 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-08 04:49:13,357 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-08 04:49:13,357 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:13,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:13,360 INFO L85 PathProgramCache]: Analyzing trace with hash 140959792, now seen corresponding path program 3 times [2025-03-08 04:49:13,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:13,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611207233] [2025-03-08 04:49:13,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:49:13,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:13,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 23 equivalence classes. [2025-03-08 04:49:13,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 79 statements. [2025-03-08 04:49:13,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:49:13,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:13,494 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-08 04:49:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:13,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611207233] [2025-03-08 04:49:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611207233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:13,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:13,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 04:49:13,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30524037] [2025-03-08 04:49:13,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:13,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:49:13,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:13,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:49:13,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:49:13,495 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-08 04:49:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:13,562 INFO L93 Difference]: Finished difference Result 651 states and 800 transitions. [2025-03-08 04:49:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:49:13,563 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-08 04:49:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:13,567 INFO L225 Difference]: With dead ends: 651 [2025-03-08 04:49:13,568 INFO L226 Difference]: Without dead ends: 649 [2025-03-08 04:49:13,568 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-08 04:49:13,569 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-08 04:49:13,569 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-08 04:49:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-08 04:49:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2025-03-08 04:49:13,598 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-08 04:49:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 796 transitions. [2025-03-08 04:49:13,600 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 796 transitions. Word has length 79 [2025-03-08 04:49:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:13,600 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 796 transitions. [2025-03-08 04:49:13,600 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-08 04:49:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 796 transitions. [2025-03-08 04:49:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 04:49:13,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:13,609 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:49:13,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 04:49:13,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:13,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash -375951312, now seen corresponding path program 1 times [2025-03-08 04:49:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143093140] [2025-03-08 04:49:13,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:13,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:13,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 04:49:13,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 04:49:13,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:13,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:13,681 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-08 04:49:13,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143093140] [2025-03-08 04:49:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143093140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:49:13,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268751191] [2025-03-08 04:49:13,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:13,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:49:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:13,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:49:13,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:49:13,682 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-08 04:49:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:13,733 INFO L93 Difference]: Finished difference Result 1085 states and 1331 transitions. [2025-03-08 04:49:13,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:49:13,734 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-08 04:49:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:13,736 INFO L225 Difference]: With dead ends: 1085 [2025-03-08 04:49:13,736 INFO L226 Difference]: Without dead ends: 868 [2025-03-08 04:49:13,737 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-08 04:49:13,737 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-08 04:49:13,737 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-08 04:49:13,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-08 04:49:13,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 789. [2025-03-08 04:49:13,768 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-08 04:49:13,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 982 transitions. [2025-03-08 04:49:13,770 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 982 transitions. Word has length 79 [2025-03-08 04:49:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:13,771 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 982 transitions. [2025-03-08 04:49:13,771 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-08 04:49:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 982 transitions. [2025-03-08 04:49:13,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 04:49:13,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:13,772 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-08 04:49:13,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 04:49:13,772 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:13,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:13,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1780522402, now seen corresponding path program 1 times [2025-03-08 04:49:13,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:13,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340362961] [2025-03-08 04:49:13,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:13,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 04:49:13,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 04:49:13,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:13,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:14,339 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-08 04:49:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340362961] [2025-03-08 04:49:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340362961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585446719] [2025-03-08 04:49:14,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:14,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:14,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:14,342 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-08 04:49:14,344 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-08 04:49:14,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 04:49:14,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 04:49:14,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:14,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:14,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 04:49:14,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:14,880 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-08 04:49:14,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:15,556 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-08 04:49:15,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585446719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:15,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:15,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2025-03-08 04:49:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709974034] [2025-03-08 04:49:15,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:15,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-08 04:49:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:15,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-08 04:49:15,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 04:49:15,561 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-08 04:49:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:16,424 INFO L93 Difference]: Finished difference Result 2171 states and 2968 transitions. [2025-03-08 04:49:16,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 04:49:16,424 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-08 04:49:16,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:16,429 INFO L225 Difference]: With dead ends: 2171 [2025-03-08 04:49:16,429 INFO L226 Difference]: Without dead ends: 1581 [2025-03-08 04:49:16,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 04:49:16,431 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-08 04:49:16,431 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-08 04:49:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-03-08 04:49:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1581. [2025-03-08 04:49:16,481 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-08 04:49:16,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1966 transitions. [2025-03-08 04:49:16,485 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1966 transitions. Word has length 154 [2025-03-08 04:49:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:16,485 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 1966 transitions. [2025-03-08 04:49:16,485 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-08 04:49:16,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1966 transitions. [2025-03-08 04:49:16,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 04:49:16,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:16,488 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-08 04:49:16,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:49:16,692 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-08 04:49:16,692 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:16,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1888756830, now seen corresponding path program 2 times [2025-03-08 04:49:16,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:16,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182452704] [2025-03-08 04:49:16,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:16,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 298 statements into 2 equivalence classes. [2025-03-08 04:49:16,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 04:49:16,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:16,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:16,923 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-08 04:49:16,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:16,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182452704] [2025-03-08 04:49:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182452704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 04:49:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585221249] [2025-03-08 04:49:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:16,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:49:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:16,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:49:16,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:49:16,924 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-08 04:49:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:17,003 INFO L93 Difference]: Finished difference Result 1583 states and 1967 transitions. [2025-03-08 04:49:17,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:49:17,004 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-08 04:49:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:17,008 INFO L225 Difference]: With dead ends: 1583 [2025-03-08 04:49:17,008 INFO L226 Difference]: Without dead ends: 1144 [2025-03-08 04:49:17,008 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-08 04:49:17,009 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-08 04:49:17,009 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-08 04:49:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2025-03-08 04:49:17,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1144. [2025-03-08 04:49:17,063 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-08 04:49:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1519 transitions. [2025-03-08 04:49:17,066 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1519 transitions. Word has length 298 [2025-03-08 04:49:17,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:17,066 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1519 transitions. [2025-03-08 04:49:17,066 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-08 04:49:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1519 transitions. [2025-03-08 04:49:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 04:49:17,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:17,069 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-08 04:49:17,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 04:49:17,069 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:17,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:17,069 INFO L85 PathProgramCache]: Analyzing trace with hash 154887074, now seen corresponding path program 1 times [2025-03-08 04:49:17,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:17,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123757670] [2025-03-08 04:49:17,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:17,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 04:49:17,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 04:49:17,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:17,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:18,604 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-08 04:49:18,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123757670] [2025-03-08 04:49:18,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123757670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:18,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053381257] [2025-03-08 04:49:18,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:18,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:18,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:18,606 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-08 04:49:18,606 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-08 04:49:18,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 04:49:18,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 04:49:18,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:18,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:18,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 04:49:18,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:19,778 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-08 04:49:19,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:21,805 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-08 04:49:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053381257] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:21,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 144 [2025-03-08 04:49:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430421410] [2025-03-08 04:49:21,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:21,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 145 states [2025-03-08 04:49:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:21,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2025-03-08 04:49:21,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9219, Invalid=11661, Unknown=0, NotChecked=0, Total=20880 [2025-03-08 04:49:21,812 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-08 04:49:24,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:24,416 INFO L93 Difference]: Finished difference Result 3162 states and 4589 transitions. [2025-03-08 04:49:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-08 04:49:24,417 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-08 04:49:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:24,423 INFO L225 Difference]: With dead ends: 3162 [2025-03-08 04:49:24,423 INFO L226 Difference]: Without dead ends: 2296 [2025-03-08 04:49:24,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13345 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=13872, Invalid=22800, Unknown=0, NotChecked=0, Total=36672 [2025-03-08 04:49:24,431 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:49:24,432 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.3s Time] [2025-03-08 04:49:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2025-03-08 04:49:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 2296. [2025-03-08 04:49:24,500 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-08 04:49:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3055 transitions. [2025-03-08 04:49:24,506 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3055 transitions. Word has length 298 [2025-03-08 04:49:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:24,506 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 3055 transitions. [2025-03-08 04:49:24,506 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-08 04:49:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3055 transitions. [2025-03-08 04:49:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-08 04:49:24,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:24,513 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-08 04:49:24,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:49:24,716 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-08 04:49:24,716 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:24,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1682218914, now seen corresponding path program 2 times [2025-03-08 04:49:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508942581] [2025-03-08 04:49:24,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:49:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:24,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 586 statements into 2 equivalence classes. [2025-03-08 04:49:24,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 04:49:24,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:49:24,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:29,616 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-08 04:49:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508942581] [2025-03-08 04:49:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508942581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:49:29,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:49:29,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [96] imperfect sequences [] total 96 [2025-03-08 04:49:29,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53988716] [2025-03-08 04:49:29,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:49:29,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-08 04:49:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:29,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-08 04:49:29,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 04:49:29,620 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-08 04:49:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:49:33,484 INFO L93 Difference]: Finished difference Result 57119 states and 76118 transitions. [2025-03-08 04:49:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-08 04:49:33,484 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-08 04:49:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:49:33,592 INFO L225 Difference]: With dead ends: 57119 [2025-03-08 04:49:33,592 INFO L226 Difference]: Without dead ends: 55120 [2025-03-08 04:49:33,607 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-08 04:49:33,608 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 2374 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-08 04:49:33,608 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-08 04:49:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55120 states. [2025-03-08 04:49:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55120 to 2308. [2025-03-08 04:49:34,311 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-08 04:49:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2703 transitions. [2025-03-08 04:49:34,327 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2703 transitions. Word has length 586 [2025-03-08 04:49:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:49:34,327 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 2703 transitions. [2025-03-08 04:49:34,328 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-08 04:49:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2703 transitions. [2025-03-08 04:49:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2025-03-08 04:49:34,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:49:34,335 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-08 04:49:34,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 04:49:34,335 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:49:34,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:49:34,336 INFO L85 PathProgramCache]: Analyzing trace with hash 925773826, now seen corresponding path program 1 times [2025-03-08 04:49:34,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:49:34,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775292298] [2025-03-08 04:49:34,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:34,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:49:34,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 04:49:34,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 04:49:34,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:34,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:39,344 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-08 04:49:39,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:49:39,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775292298] [2025-03-08 04:49:39,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775292298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:49:39,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621360403] [2025-03-08 04:49:39,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:49:39,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:49:39,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:49:39,347 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-08 04:49:39,349 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-08 04:49:39,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 586 statements into 1 equivalence classes. [2025-03-08 04:49:39,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 586 of 586 statements. [2025-03-08 04:49:39,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:49:39,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:49:39,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1205 conjuncts, 97 conjuncts are in the unsatisfiable core [2025-03-08 04:49:39,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:49:42,823 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-08 04:49:42,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:49:50,652 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-08 04:49:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621360403] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:49:50,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:49:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 288 [2025-03-08 04:49:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250976541] [2025-03-08 04:49:50,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:49:50,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 289 states [2025-03-08 04:49:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:49:50,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 289 interpolants. [2025-03-08 04:49:50,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36867, Invalid=46365, Unknown=0, NotChecked=0, Total=83232 [2025-03-08 04:49:50,671 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-08 04:50:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:50:05,191 INFO L93 Difference]: Finished difference Result 7120 states and 9350 transitions. [2025-03-08 04:50:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2025-03-08 04:50:05,192 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-08 04:50:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:50:05,201 INFO L225 Difference]: With dead ends: 7120 [2025-03-08 04:50:05,201 INFO L226 Difference]: Without dead ends: 5380 [2025-03-08 04:50:05,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1362 GetRequests, 980 SyntacticMatches, 0 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54337 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=55392, Invalid=91680, Unknown=0, NotChecked=0, Total=147072 [2025-03-08 04:50:05,208 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-08 04:50:05,209 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-08 04:50:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5380 states. [2025-03-08 04:50:06,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5380 to 4612. [2025-03-08 04:50:06,277 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-08 04:50:06,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5391 transitions. [2025-03-08 04:50:06,283 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5391 transitions. Word has length 586 [2025-03-08 04:50:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:50:06,284 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 5391 transitions. [2025-03-08 04:50:06,284 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-08 04:50:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5391 transitions. [2025-03-08 04:50:06,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1163 [2025-03-08 04:50:06,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:50:06,304 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-08 04:50:06,315 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-08 04:50:06,505 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-08 04:50:06,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:50:06,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:50:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1446867966, now seen corresponding path program 2 times [2025-03-08 04:50:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:50:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481002530] [2025-03-08 04:50:06,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:50:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:50:06,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1162 statements into 2 equivalence classes. [2025-03-08 04:50:06,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1162 of 1162 statements. [2025-03-08 04:50:06,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:50:06,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:29,078 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-08 04:50:29,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:50:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481002530] [2025-03-08 04:50:29,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481002530] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:50:29,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127898431] [2025-03-08 04:50:29,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:50:29,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:50:29,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:50:29,081 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-08 04:50:29,081 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-08 04:50:29,163 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1162 statements into 2 equivalence classes. [2025-03-08 04:50:29,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 1162 of 1162 statements. [2025-03-08 04:50:29,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:50:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:50:29,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 2357 conjuncts, 193 conjuncts are in the unsatisfiable core [2025-03-08 04:50:29,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:50:41,175 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-08 04:50:41,175 INFO L312 TraceCheckSpWp]: Computing backward predicates...