./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem14_label24.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 052d87c43f9a6a303e543fa72a6072828b82ea75a73030e4fb80f0f24076f245 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:05:59,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:06:00,052 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:06:00,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:06:00,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:06:00,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:06:00,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:06:00,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:06:00,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:06:00,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:06:00,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:06:00,070 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:06:00,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:00,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:06:00,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:06:00,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:06:00,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:06:00,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:06:00,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:06:00,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:06:00,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:06:00,072 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 -> 052d87c43f9a6a303e543fa72a6072828b82ea75a73030e4fb80f0f24076f245 [2025-03-16 15:06:00,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:06:00,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:06:00,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:06:00,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:06:00,298 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:06:00,299 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label24.c [2025-03-16 15:06:01,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d71c363/f500d763cfc74bd192c8f9f67e604e7b/FLAGa95709631 [2025-03-16 15:06:01,789 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:06:01,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label24.c [2025-03-16 15:06:01,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d71c363/f500d763cfc74bd192c8f9f67e604e7b/FLAGa95709631 [2025-03-16 15:06:01,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70d71c363/f500d763cfc74bd192c8f9f67e604e7b [2025-03-16 15:06:01,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:06:01,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:06:01,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:01,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:06:01,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:06:01,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:01" (1/1) ... [2025-03-16 15:06:01,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11af817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:01, skipping insertion in model container [2025-03-16 15:06:01,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:06:01" (1/1) ... [2025-03-16 15:06:02,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:06:02,132 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label24.c[4340,4353] [2025-03-16 15:06:02,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:02,311 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:06:02,327 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label24.c[4340,4353] [2025-03-16 15:06:02,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:06:02,393 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:06:02,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02 WrapperNode [2025-03-16 15:06:02,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:06:02,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:02,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:06:02,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:06:02,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,466 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:06:02,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:06:02,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:06:02,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:06:02,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:06:02,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,510 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:06:02,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,511 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,534 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,547 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:06:02,563 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:06:02,564 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:06:02,564 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:06:02,565 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (1/1) ... [2025-03-16 15:06:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:06:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:02,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:06:02,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:06:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:06:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:06:02,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:06:02,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:06:02,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:06:02,665 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:06:03,638 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:06:03,638 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:06:03,648 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:06:03,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:06:03,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:03 BoogieIcfgContainer [2025-03-16 15:06:03,651 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:06:03,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:06:03,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:06:03,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:06:03,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:06:01" (1/3) ... [2025-03-16 15:06:03,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93b7eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:03, skipping insertion in model container [2025-03-16 15:06:03,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:06:02" (2/3) ... [2025-03-16 15:06:03,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93b7eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:06:03, skipping insertion in model container [2025-03-16 15:06:03,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:03" (3/3) ... [2025-03-16 15:06:03,657 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label24.c [2025-03-16 15:06:03,670 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:06:03,671 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label24.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:06:03,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:06:03,735 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;@536c323e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:06:03,735 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:06:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 15:06:03,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:03,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:03,744 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:03,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 456860594, now seen corresponding path program 1 times [2025-03-16 15:06:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758215254] [2025-03-16 15:06:03,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:03,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:03,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 15:06:03,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 15:06:03,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:03,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:03,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:03,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758215254] [2025-03-16 15:06:03,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758215254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:03,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:03,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:03,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526092237] [2025-03-16 15:06:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:03,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:06:03,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:03,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:06:03,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:03,883 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 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 20.0) internal successors, (40), 2 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-16 15:06:03,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:03,902 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:06:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:06:03,904 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 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 40 [2025-03-16 15:06:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:03,912 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:06:03,912 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:06:03,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:06:03,916 INFO L435 NwaCegarLoop]: 298 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, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:03,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:06:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:06:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:06:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:06:03,948 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 40 [2025-03-16 15:06:03,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:03,948 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:06:03,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 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-16 15:06:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:06:03,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 15:06:03,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:03,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:03,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:06:03,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1212791081, now seen corresponding path program 1 times [2025-03-16 15:06:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736697024] [2025-03-16 15:06:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:03,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 15:06:03,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 15:06:03,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:03,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:04,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:04,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736697024] [2025-03-16 15:06:04,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736697024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:04,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:04,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:04,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947129413] [2025-03-16 15:06:04,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:04,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:04,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:04,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:04,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:04,102 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 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-16 15:06:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:04,649 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2025-03-16 15:06:04,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:04,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 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 40 [2025-03-16 15:06:04,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:04,652 INFO L225 Difference]: With dead ends: 361 [2025-03-16 15:06:04,652 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:06:04,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:04,653 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 161 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:04,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 11 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:06:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:06:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 358 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 587 transitions. [2025-03-16 15:06:04,680 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 587 transitions. Word has length 40 [2025-03-16 15:06:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:04,680 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 587 transitions. [2025-03-16 15:06:04,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 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-16 15:06:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 587 transitions. [2025-03-16 15:06:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:06:04,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:04,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:06:04,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash -593911556, now seen corresponding path program 1 times [2025-03-16 15:06:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925743603] [2025-03-16 15:06:04,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:04,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:06:04,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:06:04,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:04,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925743603] [2025-03-16 15:06:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925743603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:04,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:06:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885884541] [2025-03-16 15:06:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:04,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:04,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:04,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:04,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:04,889 INFO L87 Difference]: Start difference. First operand 359 states and 587 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:05,471 INFO L93 Difference]: Finished difference Result 1073 states and 1758 transitions. [2025-03-16 15:06:05,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:05,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 15:06:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:05,474 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:06:05,474 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:06:05,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:05,477 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:05,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 88 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:06:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 537. [2025-03-16 15:06:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4944029850746268) internal successors, (801), 536 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 801 transitions. [2025-03-16 15:06:05,503 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 801 transitions. Word has length 105 [2025-03-16 15:06:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:05,504 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 801 transitions. [2025-03-16 15:06:05,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 801 transitions. [2025-03-16 15:06:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 15:06:05,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:05,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:05,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:06:05,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:05,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash -596714401, now seen corresponding path program 1 times [2025-03-16 15:06:05,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:05,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000984402] [2025-03-16 15:06:05,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:05,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:05,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 15:06:05,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 15:06:05,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:05,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:05,882 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:05,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:05,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000984402] [2025-03-16 15:06:05,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000984402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:05,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:05,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:05,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770050223] [2025-03-16 15:06:05,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:05,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:05,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:05,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:05,884 INFO L87 Difference]: Start difference. First operand 537 states and 801 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:06,588 INFO L93 Difference]: Finished difference Result 1429 states and 2029 transitions. [2025-03-16 15:06:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:06,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2025-03-16 15:06:06,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:06,592 INFO L225 Difference]: With dead ends: 1429 [2025-03-16 15:06:06,593 INFO L226 Difference]: Without dead ends: 893 [2025-03-16 15:06:06,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:06:06,594 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:06,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 120 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 15:06:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-16 15:06:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 893. [2025-03-16 15:06:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2025-03-16 15:06:06,609 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 119 [2025-03-16 15:06:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:06,610 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2025-03-16 15:06:06,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2025-03-16 15:06:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-16 15:06:06,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:06,612 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:06,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:06:06,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:06,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash -522371306, now seen corresponding path program 1 times [2025-03-16 15:06:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640824012] [2025-03-16 15:06:06,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:06,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-16 15:06:06,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-16 15:06:06,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:06,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:06,823 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 15:06:06,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:06,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640824012] [2025-03-16 15:06:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640824012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817536425] [2025-03-16 15:06:06,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:06,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:06,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:06,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:06,824 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:07,417 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2025-03-16 15:06:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:07,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 199 [2025-03-16 15:06:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:07,421 INFO L225 Difference]: With dead ends: 1992 [2025-03-16 15:06:07,421 INFO L226 Difference]: Without dead ends: 1071 [2025-03-16 15:06:07,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:07,423 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 102 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:07,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 119 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:07,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2025-03-16 15:06:07,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2025-03-16 15:06:07,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2025-03-16 15:06:07,447 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 199 [2025-03-16 15:06:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:07,448 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2025-03-16 15:06:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2025-03-16 15:06:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 15:06:07,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:07,449 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:07,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:06:07,449 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:07,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -773731770, now seen corresponding path program 1 times [2025-03-16 15:06:07,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:07,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706870033] [2025-03-16 15:06:07,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:07,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:07,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 15:06:07,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 15:06:07,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:07,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:07,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706870033] [2025-03-16 15:06:07,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706870033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:07,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635004185] [2025-03-16 15:06:07,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:07,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:07,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:07,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:07,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:06:07,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 15:06:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 15:06:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:07,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:07,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-03-16 15:06:07,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:07,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635004185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:07,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:07,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:07,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120346986] [2025-03-16 15:06:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:07,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:07,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:07,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:07,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:07,935 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:08,395 INFO L93 Difference]: Finished difference Result 2497 states and 3032 transitions. [2025-03-16 15:06:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 211 [2025-03-16 15:06:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:08,399 INFO L225 Difference]: With dead ends: 2497 [2025-03-16 15:06:08,400 INFO L226 Difference]: Without dead ends: 1427 [2025-03-16 15:06:08,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:08,401 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:08,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 84 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2025-03-16 15:06:08,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1071. [2025-03-16 15:06:08,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2025-03-16 15:06:08,418 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 211 [2025-03-16 15:06:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:08,418 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2025-03-16 15:06:08,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:08,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2025-03-16 15:06:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 15:06:08,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:08,420 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:08,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-16 15:06:08,621 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -49191267, now seen corresponding path program 1 times [2025-03-16 15:06:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:08,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566406345] [2025-03-16 15:06:08,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:08,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:08,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 15:06:08,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 15:06:08,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:08,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:06:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566406345] [2025-03-16 15:06:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566406345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:08,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575890272] [2025-03-16 15:06:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:08,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:08,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:08,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:08,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:08,794 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:09,197 INFO L93 Difference]: Finished difference Result 2675 states and 3212 transitions. [2025-03-16 15:06:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-03-16 15:06:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:09,201 INFO L225 Difference]: With dead ends: 2675 [2025-03-16 15:06:09,201 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:06:09,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:09,203 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:09,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 57 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:06:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2025-03-16 15:06:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.156381486676017) internal successors, (1649), 1426 states have internal predecessors, (1649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1649 transitions. [2025-03-16 15:06:09,225 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1649 transitions. Word has length 214 [2025-03-16 15:06:09,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:09,225 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1649 transitions. [2025-03-16 15:06:09,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1649 transitions. [2025-03-16 15:06:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-16 15:06:09,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:09,228 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:09,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:06:09,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:09,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1125002276, now seen corresponding path program 1 times [2025-03-16 15:06:09,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:09,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064707386] [2025-03-16 15:06:09,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:09,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:09,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-16 15:06:09,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-16 15:06:09,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:09,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 171 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:06:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:09,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064707386] [2025-03-16 15:06:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064707386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:09,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418154595] [2025-03-16 15:06:09,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:09,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:09,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:09,626 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:09,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:06:09,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-16 15:06:09,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-16 15:06:09,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:09,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:09,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:09,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-16 15:06:10,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:10,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418154595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:10,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:10,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 15:06:10,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626233468] [2025-03-16 15:06:10,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:10,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:10,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:10,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:10,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:10,063 INFO L87 Difference]: Start difference. First operand 1427 states and 1649 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:10,480 INFO L93 Difference]: Finished difference Result 3209 states and 3787 transitions. [2025-03-16 15:06:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2025-03-16 15:06:10,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:10,486 INFO L225 Difference]: With dead ends: 3209 [2025-03-16 15:06:10,486 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:06:10,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:10,488 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:10,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 46 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:06:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2025-03-16 15:06:10,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1402918069584735) internal successors, (2032), 1782 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2032 transitions. [2025-03-16 15:06:10,518 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2032 transitions. Word has length 333 [2025-03-16 15:06:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:10,520 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2032 transitions. [2025-03-16 15:06:10,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2032 transitions. [2025-03-16 15:06:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-03-16 15:06:10,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:10,526 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:10,533 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-16 15:06:10,730 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,SelfDestructingSolverStorable7 [2025-03-16 15:06:10,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:10,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1639468681, now seen corresponding path program 1 times [2025-03-16 15:06:10,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:10,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521678402] [2025-03-16 15:06:10,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:10,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:10,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-03-16 15:06:10,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-03-16 15:06:10,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:10,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-03-16 15:06:11,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:11,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521678402] [2025-03-16 15:06:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521678402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:11,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:11,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140645229] [2025-03-16 15:06:11,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:11,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:11,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:11,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:11,020 INFO L87 Difference]: Start difference. First operand 1783 states and 2032 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:11,495 INFO L93 Difference]: Finished difference Result 3594 states and 4115 transitions. [2025-03-16 15:06:11,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:11,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 410 [2025-03-16 15:06:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:11,501 INFO L225 Difference]: With dead ends: 3594 [2025-03-16 15:06:11,501 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:06:11,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:06:11,504 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:11,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 15 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:06:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2025-03-16 15:06:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.0897867564534232) internal successors, (1942), 1782 states have internal predecessors, (1942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:11,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1942 transitions. [2025-03-16 15:06:11,531 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1942 transitions. Word has length 410 [2025-03-16 15:06:11,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:11,532 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1942 transitions. [2025-03-16 15:06:11,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1942 transitions. [2025-03-16 15:06:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-16 15:06:11,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:11,537 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:11,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:06:11,538 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:11,538 INFO L85 PathProgramCache]: Analyzing trace with hash 864247944, now seen corresponding path program 1 times [2025-03-16 15:06:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444059936] [2025-03-16 15:06:11,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:11,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:11,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-16 15:06:11,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-16 15:06:11,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:11,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:11,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:11,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444059936] [2025-03-16 15:06:11,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444059936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:11,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896033354] [2025-03-16 15:06:11,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:11,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:11,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:11,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:11,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:11,868 INFO L87 Difference]: Start difference. First operand 1783 states and 1942 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:12,250 INFO L93 Difference]: Finished difference Result 4277 states and 4714 transitions. [2025-03-16 15:06:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:12,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 433 [2025-03-16 15:06:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:12,257 INFO L225 Difference]: With dead ends: 4277 [2025-03-16 15:06:12,257 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 15:06:12,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:12,259 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:12,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 218 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:12,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 15:06:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2317. [2025-03-16 15:06:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0854922279792747) internal successors, (2514), 2316 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2514 transitions. [2025-03-16 15:06:12,295 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2514 transitions. Word has length 433 [2025-03-16 15:06:12,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:12,296 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2514 transitions. [2025-03-16 15:06:12,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2514 transitions. [2025-03-16 15:06:12,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-03-16 15:06:12,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:12,301 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 15:06:12,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:06:12,301 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:12,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash 38533942, now seen corresponding path program 1 times [2025-03-16 15:06:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:12,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598388020] [2025-03-16 15:06:12,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:12,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-16 15:06:12,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-16 15:06:12,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:12,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 405 proven. 195 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-16 15:06:12,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598388020] [2025-03-16 15:06:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598388020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804326106] [2025-03-16 15:06:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:12,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:12,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:12,748 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-16 15:06:12,749 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-16 15:06:12,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-03-16 15:06:12,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-03-16 15:06:12,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:12,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:12,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:12,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2025-03-16 15:06:12,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:12,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804326106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:12,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:12,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:12,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5916477] [2025-03-16 15:06:12,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:12,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:12,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:12,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:12,905 INFO L87 Difference]: Start difference. First operand 2317 states and 2514 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:13,309 INFO L93 Difference]: Finished difference Result 5345 states and 5859 transitions. [2025-03-16 15:06:13,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 436 [2025-03-16 15:06:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:13,319 INFO L225 Difference]: With dead ends: 5345 [2025-03-16 15:06:13,319 INFO L226 Difference]: Without dead ends: 3207 [2025-03-16 15:06:13,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:13,322 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:13,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 232 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-16 15:06:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 2851. [2025-03-16 15:06:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.0863157894736841) internal successors, (3096), 2850 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3096 transitions. [2025-03-16 15:06:13,362 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3096 transitions. Word has length 436 [2025-03-16 15:06:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:13,363 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3096 transitions. [2025-03-16 15:06:13,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:13,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3096 transitions. [2025-03-16 15:06:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-16 15:06:13,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:13,368 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-03-16 15:06:13,374 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-16 15:06:13,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:13,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:13,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:13,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1565596332, now seen corresponding path program 1 times [2025-03-16 15:06:13,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:13,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692268531] [2025-03-16 15:06:13,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:13,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-16 15:06:13,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-16 15:06:13,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:13,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 259 proven. 195 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2025-03-16 15:06:13,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692268531] [2025-03-16 15:06:13,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692268531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:13,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085712023] [2025-03-16 15:06:13,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:13,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:13,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:13,985 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-16 15:06:13,987 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-16 15:06:14,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-16 15:06:14,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-16 15:06:14,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:14,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:14,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:14,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2025-03-16 15:06:14,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085712023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:14,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597250229] [2025-03-16 15:06:14,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:14,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:14,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:14,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:14,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:14,158 INFO L87 Difference]: Start difference. First operand 2851 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:14,529 INFO L93 Difference]: Finished difference Result 3743 states and 4039 transitions. [2025-03-16 15:06:14,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 448 [2025-03-16 15:06:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:14,539 INFO L225 Difference]: With dead ends: 3743 [2025-03-16 15:06:14,539 INFO L226 Difference]: Without dead ends: 3741 [2025-03-16 15:06:14,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:14,540 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 160 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:14,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 10 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-16 15:06:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 2851. [2025-03-16 15:06:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.0863157894736841) internal successors, (3096), 2850 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3096 transitions. [2025-03-16 15:06:14,588 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3096 transitions. Word has length 448 [2025-03-16 15:06:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:14,589 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3096 transitions. [2025-03-16 15:06:14,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:14,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3096 transitions. [2025-03-16 15:06:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-16 15:06:14,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:14,596 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:14,603 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-16 15:06:14,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:14,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:14,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash 102704233, now seen corresponding path program 1 times [2025-03-16 15:06:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156022331] [2025-03-16 15:06:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:14,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-16 15:06:14,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-16 15:06:14,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:14,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:14,959 INFO L134 CoverageAnalysis]: Checked inductivity of 789 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:06:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156022331] [2025-03-16 15:06:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156022331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:14,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:14,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251930362] [2025-03-16 15:06:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:14,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:14,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:14,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:14,963 INFO L87 Difference]: Start difference. First operand 2851 states and 3096 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:15,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:15,355 INFO L93 Difference]: Finished difference Result 6769 states and 7416 transitions. [2025-03-16 15:06:15,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:15,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 474 [2025-03-16 15:06:15,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:15,364 INFO L225 Difference]: With dead ends: 6769 [2025-03-16 15:06:15,365 INFO L226 Difference]: Without dead ends: 4097 [2025-03-16 15:06:15,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:15,369 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:15,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 49 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:15,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-03-16 15:06:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2025-03-16 15:06:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.0830078125) internal successors, (4436), 4096 states have internal predecessors, (4436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4436 transitions. [2025-03-16 15:06:15,440 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4436 transitions. Word has length 474 [2025-03-16 15:06:15,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:15,440 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4436 transitions. [2025-03-16 15:06:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4436 transitions. [2025-03-16 15:06:15,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-16 15:06:15,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:15,443 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:15,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:06:15,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:15,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:15,444 INFO L85 PathProgramCache]: Analyzing trace with hash 604914055, now seen corresponding path program 1 times [2025-03-16 15:06:15,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:15,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802180765] [2025-03-16 15:06:15,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:15,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:15,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 15:06:15,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 15:06:15,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:15,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:15,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 680 proven. 195 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-16 15:06:15,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:15,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802180765] [2025-03-16 15:06:15,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802180765] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:15,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404578321] [2025-03-16 15:06:15,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:15,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:15,825 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-16 15:06:15,827 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-16 15:06:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-16 15:06:15,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-16 15:06:15,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:15,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:15,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1019 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2025-03-16 15:06:15,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404578321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:15,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:06:15,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752523324] [2025-03-16 15:06:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:15,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:15,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:15,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:15,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:15,990 INFO L87 Difference]: Start difference. First operand 4097 states and 4436 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:16,324 INFO L93 Difference]: Finished difference Result 9083 states and 9824 transitions. [2025-03-16 15:06:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 505 [2025-03-16 15:06:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:16,341 INFO L225 Difference]: With dead ends: 9083 [2025-03-16 15:06:16,343 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 15:06:16,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 504 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:16,348 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 140 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:16,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 245 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 15:06:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 3919. [2025-03-16 15:06:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.076059213884635) internal successors, (4216), 3918 states have internal predecessors, (4216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4216 transitions. [2025-03-16 15:06:16,413 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4216 transitions. Word has length 505 [2025-03-16 15:06:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4216 transitions. [2025-03-16 15:06:16,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:16,413 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4216 transitions. [2025-03-16 15:06:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-16 15:06:16,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:16,416 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:16,423 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-16 15:06:16,617 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,SelfDestructingSolverStorable13 [2025-03-16 15:06:16,617 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:16,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2141821439, now seen corresponding path program 1 times [2025-03-16 15:06:16,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:16,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079751776] [2025-03-16 15:06:16,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:16,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-16 15:06:16,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-16 15:06:16,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:16,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 739 proven. 11 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-16 15:06:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079751776] [2025-03-16 15:06:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079751776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355176270] [2025-03-16 15:06:16,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:16,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:16,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:16,936 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-16 15:06:16,937 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-16 15:06:16,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-16 15:06:17,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-16 15:06:17,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:17,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:17,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:06:17,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-16 15:06:18,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355176270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 15:06:18,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757950523] [2025-03-16 15:06:18,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:18,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:06:18,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:18,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:06:18,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:18,388 INFO L87 Difference]: Start difference. First operand 3919 states and 4216 transitions. Second operand has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:18,900 INFO L93 Difference]: Finished difference Result 7837 states and 8435 transitions. [2025-03-16 15:06:18,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 535 [2025-03-16 15:06:18,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:18,908 INFO L225 Difference]: With dead ends: 7837 [2025-03-16 15:06:18,908 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:06:18,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:18,912 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 181 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:18,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 52 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:06:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:06:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2025-03-16 15:06:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.055025266704099) internal successors, (3758), 3562 states have internal predecessors, (3758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3758 transitions. [2025-03-16 15:06:18,947 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3758 transitions. Word has length 535 [2025-03-16 15:06:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:18,948 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3758 transitions. [2025-03-16 15:06:18,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.8) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3758 transitions. [2025-03-16 15:06:18,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-16 15:06:18,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:18,952 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:18,959 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-16 15:06:19,153 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-16 15:06:19,153 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:19,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:19,154 INFO L85 PathProgramCache]: Analyzing trace with hash -669283465, now seen corresponding path program 1 times [2025-03-16 15:06:19,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:19,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699379730] [2025-03-16 15:06:19,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:19,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:19,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-16 15:06:19,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-16 15:06:19,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-16 15:06:19,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:19,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699379730] [2025-03-16 15:06:19,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699379730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:19,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597565530] [2025-03-16 15:06:19,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:19,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:19,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:19,447 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-16 15:06:19,449 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-16 15:06:19,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-16 15:06:19,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-16 15:06:19,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:19,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:19,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:06:19,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-16 15:06:19,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:20,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1189 proven. 155 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-16 15:06:20,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597565530] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:06:20,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:06:20,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:06:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123748786] [2025-03-16 15:06:20,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:06:20,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:06:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:20,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:06:20,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:20,168 INFO L87 Difference]: Start difference. First operand 3563 states and 3758 transitions. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:20,776 INFO L93 Difference]: Finished difference Result 8193 states and 8673 transitions. [2025-03-16 15:06:20,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:06:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 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 764 [2025-03-16 15:06:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:20,787 INFO L225 Difference]: With dead ends: 8193 [2025-03-16 15:06:20,787 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:06:20,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1530 GetRequests, 1526 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:20,790 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 64 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:20,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 49 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:06:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4275. [2025-03-16 15:06:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0589611605053815) internal successors, (4526), 4274 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4526 transitions. [2025-03-16 15:06:20,823 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4526 transitions. Word has length 764 [2025-03-16 15:06:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:20,823 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4526 transitions. [2025-03-16 15:06:20,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4526 transitions. [2025-03-16 15:06:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 837 [2025-03-16 15:06:20,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:20,828 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:20,835 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-16 15:06:21,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:21,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash 943822082, now seen corresponding path program 1 times [2025-03-16 15:06:21,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:21,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578589124] [2025-03-16 15:06:21,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:21,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 836 statements into 1 equivalence classes. [2025-03-16 15:06:21,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 836 of 836 statements. [2025-03-16 15:06:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2165 backedges. 1380 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-16 15:06:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578589124] [2025-03-16 15:06:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578589124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:21,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:21,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:21,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182906433] [2025-03-16 15:06:21,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:21,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:21,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:21,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:21,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,258 INFO L87 Difference]: Start difference. First operand 4275 states and 4526 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:21,535 INFO L93 Difference]: Finished difference Result 8371 states and 8872 transitions. [2025-03-16 15:06:21,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:21,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 836 [2025-03-16 15:06:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:21,541 INFO L225 Difference]: With dead ends: 8371 [2025-03-16 15:06:21,541 INFO L226 Difference]: Without dead ends: 4275 [2025-03-16 15:06:21,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:21,544 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:21,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 24 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-16 15:06:21,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4275. [2025-03-16 15:06:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4275 states, 4274 states have (on average 1.0498362189985961) internal successors, (4487), 4274 states have internal predecessors, (4487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 4487 transitions. [2025-03-16 15:06:21,574 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 4487 transitions. Word has length 836 [2025-03-16 15:06:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:21,575 INFO L471 AbstractCegarLoop]: Abstraction has 4275 states and 4487 transitions. [2025-03-16 15:06:21,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:21,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 4487 transitions. [2025-03-16 15:06:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2025-03-16 15:06:21,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:21,581 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:21,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:06:21,581 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash -378418948, now seen corresponding path program 1 times [2025-03-16 15:06:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:21,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102806838] [2025-03-16 15:06:21,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:21,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:21,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 931 statements into 1 equivalence classes. [2025-03-16 15:06:21,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 931 of 931 statements. [2025-03-16 15:06:21,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:21,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2748 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 1948 trivial. 0 not checked. [2025-03-16 15:06:22,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:22,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102806838] [2025-03-16 15:06:22,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102806838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:22,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:22,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:22,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085985640] [2025-03-16 15:06:22,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:22,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:22,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:22,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:22,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:22,124 INFO L87 Difference]: Start difference. First operand 4275 states and 4487 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:22,511 INFO L93 Difference]: Finished difference Result 8905 states and 9374 transitions. [2025-03-16 15:06:22,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:22,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 931 [2025-03-16 15:06:22,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:22,518 INFO L225 Difference]: With dead ends: 8905 [2025-03-16 15:06:22,518 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:06:22,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:22,521 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 109 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:22,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 217 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:06:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:06:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:06:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.044060475161987) internal successors, (4834), 4630 states have internal predecessors, (4834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4834 transitions. [2025-03-16 15:06:22,555 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4834 transitions. Word has length 931 [2025-03-16 15:06:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:22,556 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4834 transitions. [2025-03-16 15:06:22,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4834 transitions. [2025-03-16 15:06:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2025-03-16 15:06:22,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:22,563 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:22,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:06:22,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:22,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1863492624, now seen corresponding path program 1 times [2025-03-16 15:06:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:22,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137720762] [2025-03-16 15:06:22,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:22,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:22,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1006 statements into 1 equivalence classes. [2025-03-16 15:06:22,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1006 of 1006 statements. [2025-03-16 15:06:22,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:22,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3378 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 2469 trivial. 0 not checked. [2025-03-16 15:06:23,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:23,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137720762] [2025-03-16 15:06:23,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137720762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:23,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:23,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:23,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507299677] [2025-03-16 15:06:23,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:23,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:23,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:23,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:23,197 INFO L87 Difference]: Start difference. First operand 4631 states and 4834 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:23,462 INFO L93 Difference]: Finished difference Result 9083 states and 9488 transitions. [2025-03-16 15:06:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:23,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 1006 [2025-03-16 15:06:23,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:23,469 INFO L225 Difference]: With dead ends: 9083 [2025-03-16 15:06:23,469 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 15:06:23,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:23,473 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:23,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 225 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 15:06:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 15:06:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4631. [2025-03-16 15:06:23,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0401727861771057) internal successors, (4816), 4630 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4816 transitions. [2025-03-16 15:06:23,511 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4816 transitions. Word has length 1006 [2025-03-16 15:06:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4816 transitions. [2025-03-16 15:06:23,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4816 transitions. [2025-03-16 15:06:23,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1055 [2025-03-16 15:06:23,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:23,519 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:23,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:06:23,519 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:23,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:23,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1290767768, now seen corresponding path program 1 times [2025-03-16 15:06:23,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:23,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873771347] [2025-03-16 15:06:23,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:23,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:23,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1054 statements into 1 equivalence classes. [2025-03-16 15:06:23,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1054 of 1054 statements. [2025-03-16 15:06:23,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:23,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2520 proven. 72 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2025-03-16 15:06:24,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873771347] [2025-03-16 15:06:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873771347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724219255] [2025-03-16 15:06:24,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:24,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:24,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:24,391 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-16 15:06:24,392 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-16 15:06:24,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1054 statements into 1 equivalence classes. [2025-03-16 15:06:24,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1054 of 1054 statements. [2025-03-16 15:06:24,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:24,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:24,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:06:24,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3575 backedges. 2233 proven. 0 refuted. 0 times theorem prover too weak. 1342 trivial. 0 not checked. [2025-03-16 15:06:24,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:24,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724219255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-16 15:06:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105468227] [2025-03-16 15:06:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:06:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:24,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:06:24,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:24,985 INFO L87 Difference]: Start difference. First operand 4631 states and 4816 transitions. Second operand has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:25,593 INFO L93 Difference]: Finished difference Result 9617 states and 10013 transitions. [2025-03-16 15:06:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:06:25,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 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 1054 [2025-03-16 15:06:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:25,602 INFO L225 Difference]: With dead ends: 9617 [2025-03-16 15:06:25,602 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:06:25,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1058 GetRequests, 1053 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:06:25,606 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:25,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 40 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:06:25,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:06:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4987. [2025-03-16 15:06:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0385078219013237) internal successors, (5178), 4986 states have internal predecessors, (5178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5178 transitions. [2025-03-16 15:06:25,662 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5178 transitions. Word has length 1054 [2025-03-16 15:06:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5178 transitions. [2025-03-16 15:06:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5178 transitions. [2025-03-16 15:06:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2025-03-16 15:06:25,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:25,675 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:25,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:25,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:25,875 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:25,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash -963347034, now seen corresponding path program 1 times [2025-03-16 15:06:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165715057] [2025-03-16 15:06:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:25,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1056 statements into 1 equivalence classes. [2025-03-16 15:06:25,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1056 of 1056 statements. [2025-03-16 15:06:25,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:25,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:26,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 1984 proven. 7 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2025-03-16 15:06:26,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165715057] [2025-03-16 15:06:26,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165715057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:26,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70926018] [2025-03-16 15:06:26,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:26,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:26,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:26,471 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:26,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 15:06:26,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1056 statements into 1 equivalence classes. [2025-03-16 15:06:26,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1056 of 1056 statements. [2025-03-16 15:06:26,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:26,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:26,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:06:26,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3254 backedges. 1991 proven. 0 refuted. 0 times theorem prover too weak. 1263 trivial. 0 not checked. [2025-03-16 15:06:26,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:06:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70926018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:06:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:06:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32173173] [2025-03-16 15:06:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:26,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:26,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:26,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:26,820 INFO L87 Difference]: Start difference. First operand 4987 states and 5178 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:27,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:27,111 INFO L93 Difference]: Finished difference Result 9795 states and 10176 transitions. [2025-03-16 15:06:27,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:27,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 1056 [2025-03-16 15:06:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:27,116 INFO L225 Difference]: With dead ends: 9795 [2025-03-16 15:06:27,116 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:06:27,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1059 GetRequests, 1055 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:06:27,121 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:27,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 223 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:06:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:06:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0339092872570195) internal successors, (4787), 4630 states have internal predecessors, (4787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4787 transitions. [2025-03-16 15:06:27,152 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4787 transitions. Word has length 1056 [2025-03-16 15:06:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:27,153 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4787 transitions. [2025-03-16 15:06:27,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4787 transitions. [2025-03-16 15:06:27,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1295 [2025-03-16 15:06:27,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:27,163 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:27,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 15:06:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:27,364 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:27,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1306288626, now seen corresponding path program 1 times [2025-03-16 15:06:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297096259] [2025-03-16 15:06:27,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:27,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:27,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1294 statements into 1 equivalence classes. [2025-03-16 15:06:27,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1294 of 1294 statements. [2025-03-16 15:06:27,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:27,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5568 backedges. 2772 proven. 0 refuted. 0 times theorem prover too weak. 2796 trivial. 0 not checked. [2025-03-16 15:06:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297096259] [2025-03-16 15:06:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297096259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:06:28,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:06:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:06:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834871763] [2025-03-16 15:06:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:06:28,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:06:28,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:28,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:06:28,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:28,066 INFO L87 Difference]: Start difference. First operand 4631 states and 4787 transitions. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:28,341 INFO L93 Difference]: Finished difference Result 9261 states and 9573 transitions. [2025-03-16 15:06:28,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:06:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 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 1294 [2025-03-16 15:06:28,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:28,346 INFO L225 Difference]: With dead ends: 9261 [2025-03-16 15:06:28,346 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:06:28,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:06:28,351 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 53 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:28,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 226 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:06:28,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:06:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:06:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0326133909287256) internal successors, (4781), 4630 states have internal predecessors, (4781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4781 transitions. [2025-03-16 15:06:28,375 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4781 transitions. Word has length 1294 [2025-03-16 15:06:28,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:28,376 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4781 transitions. [2025-03-16 15:06:28,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4781 transitions. [2025-03-16 15:06:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1464 [2025-03-16 15:06:28,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:06:28,386 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:28,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:06:28,386 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:06:28,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:06:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2142024593, now seen corresponding path program 1 times [2025-03-16 15:06:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:06:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462135435] [2025-03-16 15:06:28,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:06:28,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1463 statements into 1 equivalence classes. [2025-03-16 15:06:28,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1463 of 1463 statements. [2025-03-16 15:06:28,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:28,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 2663 proven. 78 refuted. 0 times theorem prover too weak. 3506 trivial. 0 not checked. [2025-03-16 15:06:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:06:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462135435] [2025-03-16 15:06:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462135435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:06:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895180278] [2025-03-16 15:06:29,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:06:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:06:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:06:29,879 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:06:29,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 15:06:29,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1463 statements into 1 equivalence classes. [2025-03-16 15:06:30,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1463 of 1463 statements. [2025-03-16 15:06:30,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:06:30,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:06:30,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:06:30,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:06:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 1632 proven. 39 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-03-16 15:06:30,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:06:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6247 backedges. 1632 proven. 39 refuted. 0 times theorem prover too weak. 4576 trivial. 0 not checked. [2025-03-16 15:06:31,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895180278] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:06:31,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:06:31,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2025-03-16 15:06:31,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899856004] [2025-03-16 15:06:31,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:06:31,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 15:06:31,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:06:31,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 15:06:31,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:06:31,394 INFO L87 Difference]: Start difference. First operand 4631 states and 4781 transitions. Second operand has 8 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:06:32,878 INFO L93 Difference]: Finished difference Result 11751 states and 12163 transitions. [2025-03-16 15:06:32,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 15:06:32,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 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 1463 [2025-03-16 15:06:32,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:06:32,882 INFO L225 Difference]: With dead ends: 11751 [2025-03-16 15:06:32,882 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:06:32,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2933 GetRequests, 2924 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:06:32,889 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 753 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:06:32,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 51 Invalid, 2977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:06:32,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:06:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:06:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:06:32,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1463 [2025-03-16 15:06:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:06:32,890 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:06:32,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 121.125) internal successors, (969), 8 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:06:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:06:32,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:06:32,893 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:06:32,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 15:06:33,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 15:06:33,097 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:06:33,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 15:06:33,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 15:06:33,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 03:06:33 BoogieIcfgContainer [2025-03-16 15:06:33,579 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 15:06:33,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 15:06:33,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 15:06:33,579 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 15:06:33,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:06:03" (3/4) ... [2025-03-16 15:06:33,584 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 15:06:33,602 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 15:06:33,604 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 15:06:33,604 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 15:06:33,605 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 15:06:33,694 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 15:06:33,695 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 15:06:33,695 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 15:06:33,695 INFO L158 Benchmark]: Toolchain (without parser) took 31723.43ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 103.7MB in the beginning and 162.8MB in the end (delta: -59.1MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,695 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 15:06:33,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 421.63ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 72.2MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.04ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 62.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,696 INFO L158 Benchmark]: Boogie Preprocessor took 95.29ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 51.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,696 INFO L158 Benchmark]: IcfgBuilder took 1087.28ms. Allocated memory is still 142.6MB. Free memory was 51.7MB in the beginning and 72.6MB in the end (delta: -20.9MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,696 INFO L158 Benchmark]: TraceAbstraction took 29926.61ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 71.5MB in the beginning and 179.4MB in the end (delta: -107.9MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,697 INFO L158 Benchmark]: Witness Printer took 115.67ms. Allocated memory is still 251.7MB. Free memory was 176.6MB in the beginning and 162.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 15:06:33,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 421.63ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 72.2MB in the end (delta: 31.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.04ms. Allocated memory is still 142.6MB. Free memory was 72.2MB in the beginning and 62.8MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.29ms. Allocated memory is still 142.6MB. Free memory was 62.8MB in the beginning and 51.7MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1087.28ms. Allocated memory is still 142.6MB. Free memory was 51.7MB in the beginning and 72.6MB in the end (delta: -20.9MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29926.61ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 71.5MB in the beginning and 179.4MB in the end (delta: -107.9MB). Peak memory consumption was 126.8MB. Max. memory is 16.1GB. * Witness Printer took 115.67ms. Allocated memory is still 251.7MB. Free memory was 176.6MB in the beginning and 162.8MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 137]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 184 locations, 360 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.4s, OverallIterations: 23, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3366 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3366 mSDsluCounter, 2699 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 1202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14293 IncrementalHoareTripleChecker+Invalid, 15495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1202 mSolverCounterUnsat, 2553 mSDtfsCounter, 14293 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9107 GetRequests, 9039 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4987occurred in iteration=20, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 4984 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 19711 NumberOfCodeBlocks, 19711 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 21903 ConstructedInterpolants, 0 QuantifiedInterpolants, 62072 SizeOfPredicates, 1 NumberOfNonLiveVariables, 8543 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 35 InterpolantComputations, 21 PerfectInterpolantSequences, 60538/62029 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Location Invariant Derived location invariant: ((((((((((((((((a24 == 1) && (10 <= a21)) || (((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (a12 <= 10)) && (0 <= ((long long) a12 + 42)))) || ((((a12 <= 80) && (a24 == 1)) && (12 <= a12)) && (a15 <= 8))) || ((((a24 == 1) && (12849 <= a12)) && (0 <= ((((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) >= 0) ? ((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) : (((-1 * (((((long long) a12 * 10) + 2779120) >= 0) ? ((((long long) a12 * 10) + 2779120) / 9) : (((((long long) a12 * 10) + 2779120) / 9) - 1))) / 10) - 1)) + 43718))) && (8 <= a15))) || (((a24 == 1) && (a21 == 9)) && (81 <= a12))) || (((a24 == 1) && (7 == a21)) && (12 <= a12))) || (((7 <= a15) && (a21 == 8)) && (a24 == 1))) || (((((long long) a12 + 43) <= 0) && (a21 == 9)) && (a15 <= 5))) || (((((long long) a12 + 43) <= 0) && (a21 <= 6)) && (a15 <= 5))) || ((a24 == 1) && (a15 <= 5))) || (((a24 == 1) && (7 == a21)) && (a15 <= 8))) || (((((a12 <= 73282) && (a24 == 1)) && (12 <= a12)) && (a15 <= 8)) && (a21 <= 6))) || ((((7 <= a15) && (a24 == 1)) && (12 <= a12)) && (a15 <= 8))) || (((a24 == 1) && (a15 <= 8)) && (a21 == 9))) || ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 15:06:33,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE