./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.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/bitvector/s3_clnt_3.BV.c.cil-1a.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 ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:03:09,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:03:09,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:03:09,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:03:09,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:03:09,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:03:09,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:03:09,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:03:09,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:03:09,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:03:09,943 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:03:09,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:03:09,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:03:09,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:03:09,943 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:03:09,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:03:09,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:03:09,944 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:03:09,945 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:03:09,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:09,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:03:09,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:03:09,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:03:09,947 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 -> ae696ef581cbe995636ab4900ea04e2b993d78100fba8db2a87ca7d99c3a6d1e [2025-03-16 14:03:10,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:03:10,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:03:10,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:03:10,154 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:03:10,154 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:03:10,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2025-03-16 14:03:11,257 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84af6fa4/a0020be179394a70b13e50b1fe4cc343/FLAG74a078811 [2025-03-16 14:03:11,491 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:03:11,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2025-03-16 14:03:11,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84af6fa4/a0020be179394a70b13e50b1fe4cc343/FLAG74a078811 [2025-03-16 14:03:11,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c84af6fa4/a0020be179394a70b13e50b1fe4cc343 [2025-03-16 14:03:11,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:03:11,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:03:11,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:11,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:03:11,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:03:11,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@387cf83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11, skipping insertion in model container [2025-03-16 14:03:11,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:03:11,697 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2025-03-16 14:03:11,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:11,709 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:03:11,749 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/bitvector/s3_clnt_3.BV.c.cil-1a.c[37883,37896] [2025-03-16 14:03:11,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:03:11,758 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:03:11,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11 WrapperNode [2025-03-16 14:03:11,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:03:11,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:11,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:03:11,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:03:11,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,773 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,802 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 526 [2025-03-16 14:03:11,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:03:11,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:03:11,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:03:11,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:03:11,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 14:03:11,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,827 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:03:11,838 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:03:11,838 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:03:11,838 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:03:11,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (1/1) ... [2025-03-16 14:03:11,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:03:11,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:11,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:03:11,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:03:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:03:11,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:03:11,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:03:11,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:03:11,942 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:03:11,943 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:03:12,286 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume false; [2025-03-16 14:03:12,286 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume !false; [2025-03-16 14:03:12,317 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-16 14:03:12,317 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:03:12,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:03:12,337 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:03:12,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:12 BoogieIcfgContainer [2025-03-16 14:03:12,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:03:12,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:03:12,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:03:12,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:03:12,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:03:11" (1/3) ... [2025-03-16 14:03:12,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b2563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:12, skipping insertion in model container [2025-03-16 14:03:12,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:03:11" (2/3) ... [2025-03-16 14:03:12,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b2563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:03:12, skipping insertion in model container [2025-03-16 14:03:12,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:12" (3/3) ... [2025-03-16 14:03:12,345 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2025-03-16 14:03:12,354 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:03:12,356 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_3.BV.c.cil-1a.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:03:12,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:03:12,407 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;@278f1ad6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:03:12,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:03:12,411 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.734375) internal successors, (222), 129 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 14:03:12,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:12,416 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] [2025-03-16 14:03:12,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:12,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:12,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1086945817, now seen corresponding path program 1 times [2025-03-16 14:03:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:12,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665097493] [2025-03-16 14:03:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:12,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:12,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 14:03:12,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 14:03:12,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:12,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:12,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665097493] [2025-03-16 14:03:12,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665097493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:12,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:12,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:12,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859037538] [2025-03-16 14:03:12,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:12,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:12,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:12,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:12,632 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.734375) internal successors, (222), 129 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:12,767 INFO L93 Difference]: Finished difference Result 255 states and 436 transitions. [2025-03-16 14:03:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:12,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-16 14:03:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:12,775 INFO L225 Difference]: With dead ends: 255 [2025-03-16 14:03:12,775 INFO L226 Difference]: Without dead ends: 118 [2025-03-16 14:03:12,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:12,780 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:12,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 326 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:12,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-16 14:03:12,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-16 14:03:12,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 117 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 180 transitions. [2025-03-16 14:03:12,807 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 180 transitions. Word has length 23 [2025-03-16 14:03:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:12,807 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 180 transitions. [2025-03-16 14:03:12,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 180 transitions. [2025-03-16 14:03:12,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 14:03:12,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:12,808 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 14:03:12,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:03:12,809 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:12,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1104836805, now seen corresponding path program 1 times [2025-03-16 14:03:12,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:12,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285747583] [2025-03-16 14:03:12,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:12,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:12,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 14:03:12,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 14:03:12,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:12,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:03:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285747583] [2025-03-16 14:03:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285747583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:12,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170240044] [2025-03-16 14:03:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:12,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:12,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:12,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:12,888 INFO L87 Difference]: Start difference. First operand 118 states and 180 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,003 INFO L93 Difference]: Finished difference Result 241 states and 371 transitions. [2025-03-16 14:03:13,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 14:03:13,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,004 INFO L225 Difference]: With dead ends: 241 [2025-03-16 14:03:13,004 INFO L226 Difference]: Without dead ends: 132 [2025-03-16 14:03:13,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,005 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 251 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:13,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-16 14:03:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-03-16 14:03:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.5190839694656488) internal successors, (199), 131 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2025-03-16 14:03:13,010 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 34 [2025-03-16 14:03:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2025-03-16 14:03:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2025-03-16 14:03:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 14:03:13,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,013 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:13,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:03:13,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2133652344, now seen corresponding path program 1 times [2025-03-16 14:03:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088302931] [2025-03-16 14:03:13,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 14:03:13,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 14:03:13,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 14:03:13,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088302931] [2025-03-16 14:03:13,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088302931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:13,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375414622] [2025-03-16 14:03:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,094 INFO L87 Difference]: Start difference. First operand 132 states and 199 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,199 INFO L93 Difference]: Finished difference Result 271 states and 413 transitions. [2025-03-16 14:03:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 47 [2025-03-16 14:03:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,200 INFO L225 Difference]: With dead ends: 271 [2025-03-16 14:03:13,201 INFO L226 Difference]: Without dead ends: 148 [2025-03-16 14:03:13,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,201 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 264 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:13,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-16 14:03:13,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-16 14:03:13,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.4965986394557824) internal successors, (220), 147 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2025-03-16 14:03:13,207 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 47 [2025-03-16 14:03:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,207 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2025-03-16 14:03:13,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2025-03-16 14:03:13,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 14:03:13,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,209 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:13,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:03:13,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1293726871, now seen corresponding path program 1 times [2025-03-16 14:03:13,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88554592] [2025-03-16 14:03:13,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 14:03:13,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 14:03:13,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:03:13,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88554592] [2025-03-16 14:03:13,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88554592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:13,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174406185] [2025-03-16 14:03:13,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,304 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,325 INFO L93 Difference]: Finished difference Result 419 states and 620 transitions. [2025-03-16 14:03:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 65 [2025-03-16 14:03:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,326 INFO L225 Difference]: With dead ends: 419 [2025-03-16 14:03:13,328 INFO L226 Difference]: Without dead ends: 280 [2025-03-16 14:03:13,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,329 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 130 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 334 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-16 14:03:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2025-03-16 14:03:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.48014440433213) internal successors, (410), 277 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 410 transitions. [2025-03-16 14:03:13,346 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 410 transitions. Word has length 65 [2025-03-16 14:03:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,346 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 410 transitions. [2025-03-16 14:03:13,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 410 transitions. [2025-03-16 14:03:13,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 14:03:13,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,348 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:13,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:03:13,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1676158312, now seen corresponding path program 1 times [2025-03-16 14:03:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489157329] [2025-03-16 14:03:13,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 14:03:13,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 14:03:13,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:03:13,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489157329] [2025-03-16 14:03:13,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489157329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:13,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41344705] [2025-03-16 14:03:13,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,457 INFO L87 Difference]: Start difference. First operand 278 states and 410 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,495 INFO L93 Difference]: Finished difference Result 808 states and 1195 transitions. [2025-03-16 14:03:13,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 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 65 [2025-03-16 14:03:13,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,501 INFO L225 Difference]: With dead ends: 808 [2025-03-16 14:03:13,501 INFO L226 Difference]: Without dead ends: 541 [2025-03-16 14:03:13,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,502 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 134 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 375 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-16 14:03:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-16 14:03:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.461111111111111) internal successors, (789), 540 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 789 transitions. [2025-03-16 14:03:13,521 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 789 transitions. Word has length 65 [2025-03-16 14:03:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,521 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 789 transitions. [2025-03-16 14:03:13,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 789 transitions. [2025-03-16 14:03:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 14:03:13,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,523 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:13,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:03:13,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1221181840, now seen corresponding path program 1 times [2025-03-16 14:03:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603876801] [2025-03-16 14:03:13,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 14:03:13,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 14:03:13,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 14:03:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603876801] [2025-03-16 14:03:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603876801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:13,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094548280] [2025-03-16 14:03:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,578 INFO L87 Difference]: Start difference. First operand 541 states and 789 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,603 INFO L93 Difference]: Finished difference Result 1111 states and 1616 transitions. [2025-03-16 14:03:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 66 [2025-03-16 14:03:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,606 INFO L225 Difference]: With dead ends: 1111 [2025-03-16 14:03:13,606 INFO L226 Difference]: Without dead ends: 581 [2025-03-16 14:03:13,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,607 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 11 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 356 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-16 14:03:13,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-03-16 14:03:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.45) internal successors, (841), 580 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 841 transitions. [2025-03-16 14:03:13,621 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 841 transitions. Word has length 66 [2025-03-16 14:03:13,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,621 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 841 transitions. [2025-03-16 14:03:13,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 841 transitions. [2025-03-16 14:03:13,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 14:03:13,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,627 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:13,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:03:13,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1345255087, now seen corresponding path program 1 times [2025-03-16 14:03:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430200198] [2025-03-16 14:03:13,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 14:03:13,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 14:03:13,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 14:03:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430200198] [2025-03-16 14:03:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430200198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:03:13,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857442227] [2025-03-16 14:03:13,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,678 INFO L87 Difference]: Start difference. First operand 581 states and 841 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,701 INFO L93 Difference]: Finished difference Result 1201 states and 1732 transitions. [2025-03-16 14:03:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 66 [2025-03-16 14:03:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,704 INFO L225 Difference]: With dead ends: 1201 [2025-03-16 14:03:13,704 INFO L226 Difference]: Without dead ends: 631 [2025-03-16 14:03:13,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,706 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 21 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 327 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-16 14:03:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 631. [2025-03-16 14:03:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 630 states have (on average 1.4365079365079365) internal successors, (905), 630 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 905 transitions. [2025-03-16 14:03:13,727 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 905 transitions. Word has length 66 [2025-03-16 14:03:13,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,727 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 905 transitions. [2025-03-16 14:03:13,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 905 transitions. [2025-03-16 14:03:13,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 14:03:13,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,729 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-03-16 14:03:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:03:13,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash 676799609, now seen corresponding path program 1 times [2025-03-16 14:03:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402586031] [2025-03-16 14:03:13,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 14:03:13,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 14:03:13,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-16 14:03:13,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402586031] [2025-03-16 14:03:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402586031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:13,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000313710] [2025-03-16 14:03:13,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,799 INFO L87 Difference]: Start difference. First operand 631 states and 905 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:13,900 INFO L93 Difference]: Finished difference Result 1281 states and 1878 transitions. [2025-03-16 14:03:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:13,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 82 [2025-03-16 14:03:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:13,903 INFO L225 Difference]: With dead ends: 1281 [2025-03-16 14:03:13,904 INFO L226 Difference]: Without dead ends: 711 [2025-03-16 14:03:13,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,905 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:13,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 269 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-16 14:03:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2025-03-16 14:03:13,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 710 states have (on average 1.4154929577464788) internal successors, (1005), 710 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1005 transitions. [2025-03-16 14:03:13,920 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1005 transitions. Word has length 82 [2025-03-16 14:03:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:13,921 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1005 transitions. [2025-03-16 14:03:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1005 transitions. [2025-03-16 14:03:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 14:03:13,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:13,924 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:03:13,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2143011019, now seen corresponding path program 1 times [2025-03-16 14:03:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730052330] [2025-03-16 14:03:13,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:13,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 14:03:13,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 14:03:13,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:13,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:03:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730052330] [2025-03-16 14:03:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730052330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:13,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911593545] [2025-03-16 14:03:13,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:13,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:13,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:13,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:13,998 INFO L87 Difference]: Start difference. First operand 711 states and 1005 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:14,034 INFO L93 Difference]: Finished difference Result 1018 states and 1449 transitions. [2025-03-16 14:03:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 101 [2025-03-16 14:03:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:14,038 INFO L225 Difference]: With dead ends: 1018 [2025-03-16 14:03:14,038 INFO L226 Difference]: Without dead ends: 1016 [2025-03-16 14:03:14,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,042 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 150 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:14,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 317 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-16 14:03:14,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2025-03-16 14:03:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 1.4246305418719212) internal successors, (1446), 1015 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1446 transitions. [2025-03-16 14:03:14,057 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1446 transitions. Word has length 101 [2025-03-16 14:03:14,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:14,057 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1446 transitions. [2025-03-16 14:03:14,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1446 transitions. [2025-03-16 14:03:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 14:03:14,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:14,059 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:03:14,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1453054643, now seen corresponding path program 1 times [2025-03-16 14:03:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863296626] [2025-03-16 14:03:14,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:14,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 14:03:14,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 14:03:14,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:14,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:14,128 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 14:03:14,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:14,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863296626] [2025-03-16 14:03:14,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863296626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:14,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:14,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:14,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188507338] [2025-03-16 14:03:14,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:14,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:14,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:14,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,130 INFO L87 Difference]: Start difference. First operand 1016 states and 1446 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:14,281 INFO L93 Difference]: Finished difference Result 2211 states and 3268 transitions. [2025-03-16 14:03:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 120 [2025-03-16 14:03:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:14,287 INFO L225 Difference]: With dead ends: 2211 [2025-03-16 14:03:14,287 INFO L226 Difference]: Without dead ends: 1250 [2025-03-16 14:03:14,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,288 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 51 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:14,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 249 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:14,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-16 14:03:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-16 14:03:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.465172137710168) internal successors, (1830), 1249 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1830 transitions. [2025-03-16 14:03:14,310 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1830 transitions. Word has length 120 [2025-03-16 14:03:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:14,310 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1830 transitions. [2025-03-16 14:03:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1830 transitions. [2025-03-16 14:03:14,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 14:03:14,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:14,312 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:14,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:03:14,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:14,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:14,313 INFO L85 PathProgramCache]: Analyzing trace with hash 661035027, now seen corresponding path program 1 times [2025-03-16 14:03:14,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:14,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306258066] [2025-03-16 14:03:14,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:14,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:14,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 14:03:14,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 14:03:14,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:14,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 14:03:14,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:14,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306258066] [2025-03-16 14:03:14,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306258066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:14,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:14,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275454558] [2025-03-16 14:03:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:14,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:14,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:14,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,373 INFO L87 Difference]: Start difference. First operand 1250 states and 1830 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:14,500 INFO L93 Difference]: Finished difference Result 2913 states and 4420 transitions. [2025-03-16 14:03:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-03-16 14:03:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:14,507 INFO L225 Difference]: With dead ends: 2913 [2025-03-16 14:03:14,507 INFO L226 Difference]: Without dead ends: 1622 [2025-03-16 14:03:14,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,509 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:14,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 242 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-16 14:03:14,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1616. [2025-03-16 14:03:14,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1615 states have (on average 1.4377708978328174) internal successors, (2322), 1615 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2322 transitions. [2025-03-16 14:03:14,559 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2322 transitions. Word has length 144 [2025-03-16 14:03:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:14,559 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2322 transitions. [2025-03-16 14:03:14,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2322 transitions. [2025-03-16 14:03:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-16 14:03:14,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:14,563 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 8, 8, 8, 8, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:14,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:03:14,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:14,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1495117070, now seen corresponding path program 1 times [2025-03-16 14:03:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:14,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238720665] [2025-03-16 14:03:14,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:14,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:14,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-16 14:03:14,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-16 14:03:14,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:14,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-16 14:03:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:14,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238720665] [2025-03-16 14:03:14,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238720665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:14,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:14,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337264356] [2025-03-16 14:03:14,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:14,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:14,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:14,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,639 INFO L87 Difference]: Start difference. First operand 1616 states and 2322 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:14,782 INFO L93 Difference]: Finished difference Result 3411 states and 4954 transitions. [2025-03-16 14:03:14,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 164 [2025-03-16 14:03:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:14,787 INFO L225 Difference]: With dead ends: 3411 [2025-03-16 14:03:14,788 INFO L226 Difference]: Without dead ends: 1766 [2025-03-16 14:03:14,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,789 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 48 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:14,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 242 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2025-03-16 14:03:14,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1760. [2025-03-16 14:03:14,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1759 states have (on average 1.4258101193860149) internal successors, (2508), 1759 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2508 transitions. [2025-03-16 14:03:14,822 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2508 transitions. Word has length 164 [2025-03-16 14:03:14,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:14,822 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2508 transitions. [2025-03-16 14:03:14,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2508 transitions. [2025-03-16 14:03:14,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 14:03:14,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:14,825 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:14,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:03:14,825 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:14,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 608557423, now seen corresponding path program 1 times [2025-03-16 14:03:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135865074] [2025-03-16 14:03:14,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:14,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:03:14,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:03:14,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:14,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-16 14:03:14,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:14,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135865074] [2025-03-16 14:03:14,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135865074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:14,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:14,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479103705] [2025-03-16 14:03:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:14,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:14,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:14,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:14,901 INFO L87 Difference]: Start difference. First operand 1760 states and 2508 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:15,033 INFO L93 Difference]: Finished difference Result 3705 states and 5332 transitions. [2025-03-16 14:03:15,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:15,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 187 [2025-03-16 14:03:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:15,038 INFO L225 Difference]: With dead ends: 3705 [2025-03-16 14:03:15,038 INFO L226 Difference]: Without dead ends: 1928 [2025-03-16 14:03:15,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,040 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 48 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:15,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 242 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:15,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2025-03-16 14:03:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1922. [2025-03-16 14:03:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1922 states, 1921 states have (on average 1.418011452368558) internal successors, (2724), 1921 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 2724 transitions. [2025-03-16 14:03:15,073 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 2724 transitions. Word has length 187 [2025-03-16 14:03:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:15,073 INFO L471 AbstractCegarLoop]: Abstraction has 1922 states and 2724 transitions. [2025-03-16 14:03:15,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 2724 transitions. [2025-03-16 14:03:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 14:03:15,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:15,076 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:15,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:03:15,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1912951152, now seen corresponding path program 1 times [2025-03-16 14:03:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:15,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874550397] [2025-03-16 14:03:15,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:15,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:03:15,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:03:15,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:15,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:15,146 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-03-16 14:03:15,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874550397] [2025-03-16 14:03:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874550397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116859743] [2025-03-16 14:03:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:15,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:15,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:15,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,148 INFO L87 Difference]: Start difference. First operand 1922 states and 2724 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:15,285 INFO L93 Difference]: Finished difference Result 4023 states and 5758 transitions. [2025-03-16 14:03:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 187 [2025-03-16 14:03:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:15,291 INFO L225 Difference]: With dead ends: 4023 [2025-03-16 14:03:15,291 INFO L226 Difference]: Without dead ends: 2108 [2025-03-16 14:03:15,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,293 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 48 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:15,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:15,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2025-03-16 14:03:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2102. [2025-03-16 14:03:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 2101 states have (on average 1.419324131366016) internal successors, (2982), 2101 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 2982 transitions. [2025-03-16 14:03:15,337 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 2982 transitions. Word has length 187 [2025-03-16 14:03:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:15,338 INFO L471 AbstractCegarLoop]: Abstraction has 2102 states and 2982 transitions. [2025-03-16 14:03:15,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 2982 transitions. [2025-03-16 14:03:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 14:03:15,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:15,341 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:15,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:03:15,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:15,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1728406793, now seen corresponding path program 1 times [2025-03-16 14:03:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:15,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149971624] [2025-03-16 14:03:15,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:15,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:15,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 14:03:15,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 14:03:15,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:15,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:15,417 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 379 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-16 14:03:15,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:15,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149971624] [2025-03-16 14:03:15,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149971624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:15,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:15,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:15,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214494995] [2025-03-16 14:03:15,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:15,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:15,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:15,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:15,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,418 INFO L87 Difference]: Start difference. First operand 2102 states and 2982 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:15,460 INFO L93 Difference]: Finished difference Result 6178 states and 8780 transitions. [2025-03-16 14:03:15,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:15,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 216 [2025-03-16 14:03:15,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:15,473 INFO L225 Difference]: With dead ends: 6178 [2025-03-16 14:03:15,473 INFO L226 Difference]: Without dead ends: 4137 [2025-03-16 14:03:15,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,477 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 136 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:15,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 503 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4137 states. [2025-03-16 14:03:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4137 to 4135. [2025-03-16 14:03:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4135 states, 4134 states have (on average 1.4201741654571842) internal successors, (5871), 4134 states have internal predecessors, (5871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4135 states to 4135 states and 5871 transitions. [2025-03-16 14:03:15,556 INFO L78 Accepts]: Start accepts. Automaton has 4135 states and 5871 transitions. Word has length 216 [2025-03-16 14:03:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:15,556 INFO L471 AbstractCegarLoop]: Abstraction has 4135 states and 5871 transitions. [2025-03-16 14:03:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 4135 states and 5871 transitions. [2025-03-16 14:03:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-16 14:03:15,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:15,561 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:15,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:03:15,562 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:15,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -424013064, now seen corresponding path program 1 times [2025-03-16 14:03:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468922205] [2025-03-16 14:03:15,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:15,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:15,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-16 14:03:15,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-16 14:03:15,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:15,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-16 14:03:15,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468922205] [2025-03-16 14:03:15,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468922205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:15,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:15,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:15,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917655239] [2025-03-16 14:03:15,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:15,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:15,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:15,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:15,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,638 INFO L87 Difference]: Start difference. First operand 4135 states and 5871 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) 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 14:03:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:15,794 INFO L93 Difference]: Finished difference Result 8689 states and 12442 transitions. [2025-03-16 14:03:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:15,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) 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 216 [2025-03-16 14:03:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:15,807 INFO L225 Difference]: With dead ends: 8689 [2025-03-16 14:03:15,807 INFO L226 Difference]: Without dead ends: 4555 [2025-03-16 14:03:15,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:15,811 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 49 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:15,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 238 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4555 states. [2025-03-16 14:03:15,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4555 to 4543. [2025-03-16 14:03:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4543 states, 4542 states have (on average 1.4273447820343461) internal successors, (6483), 4542 states have internal predecessors, (6483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4543 states to 4543 states and 6483 transitions. [2025-03-16 14:03:15,924 INFO L78 Accepts]: Start accepts. Automaton has 4543 states and 6483 transitions. Word has length 216 [2025-03-16 14:03:15,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:15,924 INFO L471 AbstractCegarLoop]: Abstraction has 4543 states and 6483 transitions. [2025-03-16 14:03:15,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) 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 14:03:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4543 states and 6483 transitions. [2025-03-16 14:03:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-16 14:03:15,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:15,931 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:15,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:03:15,931 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2009115803, now seen corresponding path program 1 times [2025-03-16 14:03:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420326330] [2025-03-16 14:03:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:15,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-16 14:03:15,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-16 14:03:15,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:15,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 413 trivial. 0 not checked. [2025-03-16 14:03:16,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:16,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420326330] [2025-03-16 14:03:16,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420326330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:16,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:16,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:16,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974845921] [2025-03-16 14:03:16,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:16,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:16,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:16,008 INFO L87 Difference]: Start difference. First operand 4543 states and 6483 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:16,158 INFO L93 Difference]: Finished difference Result 9037 states and 12898 transitions. [2025-03-16 14:03:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:16,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 250 [2025-03-16 14:03:16,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:16,171 INFO L225 Difference]: With dead ends: 9037 [2025-03-16 14:03:16,171 INFO L226 Difference]: Without dead ends: 4519 [2025-03-16 14:03:16,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:16,176 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 51 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:16,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 234 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2025-03-16 14:03:16,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4507. [2025-03-16 14:03:16,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 4506 states have (on average 1.414780292942743) internal successors, (6375), 4506 states have internal predecessors, (6375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 6375 transitions. [2025-03-16 14:03:16,286 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 6375 transitions. Word has length 250 [2025-03-16 14:03:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:16,286 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 6375 transitions. [2025-03-16 14:03:16,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 6375 transitions. [2025-03-16 14:03:16,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 14:03:16,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:16,292 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:16,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:03:16,293 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:16,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash -817850604, now seen corresponding path program 1 times [2025-03-16 14:03:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:16,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900668230] [2025-03-16 14:03:16,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:16,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:03:16,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:03:16,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:16,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 285 proven. 22 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-03-16 14:03:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900668230] [2025-03-16 14:03:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900668230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653158010] [2025-03-16 14:03:16,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:16,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:16,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:16,439 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:16,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:03:16,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 14:03:16,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 14:03:16,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:16,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:16,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:03:16,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 14:03:16,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653158010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:16,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:03:16,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:03:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863905893] [2025-03-16 14:03:16,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:16,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:16,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:16,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:16,631 INFO L87 Difference]: Start difference. First operand 4507 states and 6375 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:16,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:16,761 INFO L93 Difference]: Finished difference Result 8965 states and 12682 transitions. [2025-03-16 14:03:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:16,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 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 261 [2025-03-16 14:03:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:16,770 INFO L225 Difference]: With dead ends: 8965 [2025-03-16 14:03:16,771 INFO L226 Difference]: Without dead ends: 4519 [2025-03-16 14:03:16,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:16,775 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 36 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:16,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 266 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:16,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4519 states. [2025-03-16 14:03:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4519 to 4507. [2025-03-16 14:03:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 4506 states have (on average 1.3908122503328895) internal successors, (6267), 4506 states have internal predecessors, (6267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 6267 transitions. [2025-03-16 14:03:16,837 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 6267 transitions. Word has length 261 [2025-03-16 14:03:16,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:16,838 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 6267 transitions. [2025-03-16 14:03:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:16,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 6267 transitions. [2025-03-16 14:03:16,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-16 14:03:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:16,843 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:16,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:03:17,043 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,SelfDestructingSolverStorable17 [2025-03-16 14:03:17,044 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1243766795, now seen corresponding path program 1 times [2025-03-16 14:03:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442866777] [2025-03-16 14:03:17,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:17,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:17,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 14:03:17,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 14:03:17,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:17,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 344 proven. 22 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-16 14:03:17,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:17,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442866777] [2025-03-16 14:03:17,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442866777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:17,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757321546] [2025-03-16 14:03:17,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:17,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:17,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:03:17,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:03:17,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-16 14:03:17,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-16 14:03:17,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:17,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:17,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:03:17,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:03:17,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757321546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:17,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:03:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:03:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322701918] [2025-03-16 14:03:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:17,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:17,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:17,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:17,306 INFO L87 Difference]: Start difference. First operand 4507 states and 6267 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:17,458 INFO L93 Difference]: Finished difference Result 9439 states and 13024 transitions. [2025-03-16 14:03:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 286 [2025-03-16 14:03:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:17,468 INFO L225 Difference]: With dead ends: 9439 [2025-03-16 14:03:17,469 INFO L226 Difference]: Without dead ends: 4993 [2025-03-16 14:03:17,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:17,473 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 61 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:17,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 223 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4993 states. [2025-03-16 14:03:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4993 to 4669. [2025-03-16 14:03:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4669 states, 4668 states have (on average 1.3901028277634961) internal successors, (6489), 4668 states have internal predecessors, (6489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4669 states to 4669 states and 6489 transitions. [2025-03-16 14:03:17,564 INFO L78 Accepts]: Start accepts. Automaton has 4669 states and 6489 transitions. Word has length 286 [2025-03-16 14:03:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:17,565 INFO L471 AbstractCegarLoop]: Abstraction has 4669 states and 6489 transitions. [2025-03-16 14:03:17,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 4669 states and 6489 transitions. [2025-03-16 14:03:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-16 14:03:17,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:17,571 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 12, 12, 12, 10, 10, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:17,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:17,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:17,772 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:17,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:17,772 INFO L85 PathProgramCache]: Analyzing trace with hash 918254392, now seen corresponding path program 1 times [2025-03-16 14:03:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:17,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48090948] [2025-03-16 14:03:17,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:17,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:17,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-16 14:03:17,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-16 14:03:17,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:17,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:17,891 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:03:17,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:17,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48090948] [2025-03-16 14:03:17,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48090948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:17,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:03:17,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:03:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030941676] [2025-03-16 14:03:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:17,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:17,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:17,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:17,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:17,894 INFO L87 Difference]: Start difference. First operand 4669 states and 6489 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:18,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:18,038 INFO L93 Difference]: Finished difference Result 9601 states and 13222 transitions. [2025-03-16 14:03:18,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:18,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 287 [2025-03-16 14:03:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:18,046 INFO L225 Difference]: With dead ends: 9601 [2025-03-16 14:03:18,046 INFO L226 Difference]: Without dead ends: 4501 [2025-03-16 14:03:18,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:03:18,051 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 39 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:18,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 271 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:18,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4501 states. [2025-03-16 14:03:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4501 to 4483. [2025-03-16 14:03:18,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4483 states, 4482 states have (on average 1.3848728246318607) internal successors, (6207), 4482 states have internal predecessors, (6207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 6207 transitions. [2025-03-16 14:03:18,119 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 6207 transitions. Word has length 287 [2025-03-16 14:03:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:18,120 INFO L471 AbstractCegarLoop]: Abstraction has 4483 states and 6207 transitions. [2025-03-16 14:03:18,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 6207 transitions. [2025-03-16 14:03:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-16 14:03:18,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:18,125 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:18,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:03:18,125 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:18,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1134563840, now seen corresponding path program 1 times [2025-03-16 14:03:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103150671] [2025-03-16 14:03:18,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:18,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:18,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-16 14:03:18,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-16 14:03:18,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:18,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-16 14:03:18,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103150671] [2025-03-16 14:03:18,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103150671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:18,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046757073] [2025-03-16 14:03:18,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:18,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:18,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:18,236 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 14:03:18,237 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 14:03:18,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-16 14:03:18,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-16 14:03:18,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:18,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:18,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:03:18,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-16 14:03:18,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-16 14:03:18,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046757073] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:18,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:18,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-16 14:03:18,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884224620] [2025-03-16 14:03:18,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:18,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 14:03:18,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:18,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 14:03:18,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:03:18,514 INFO L87 Difference]: Start difference. First operand 4483 states and 6207 transitions. Second operand has 11 states, 11 states have (on average 20.09090909090909) internal successors, (221), 11 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:18,892 INFO L93 Difference]: Finished difference Result 11402 states and 15893 transitions. [2025-03-16 14:03:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:03:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.09090909090909) internal successors, (221), 11 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-03-16 14:03:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:18,902 INFO L225 Difference]: With dead ends: 11402 [2025-03-16 14:03:18,902 INFO L226 Difference]: Without dead ends: 6728 [2025-03-16 14:03:18,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-16 14:03:18,908 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 270 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:18,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1174 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:03:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6728 states. [2025-03-16 14:03:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6728 to 4483. [2025-03-16 14:03:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4483 states, 4482 states have (on average 1.3821954484605088) internal successors, (6195), 4482 states have internal predecessors, (6195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4483 states to 4483 states and 6195 transitions. [2025-03-16 14:03:18,971 INFO L78 Accepts]: Start accepts. Automaton has 4483 states and 6195 transitions. Word has length 298 [2025-03-16 14:03:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:18,971 INFO L471 AbstractCegarLoop]: Abstraction has 4483 states and 6195 transitions. [2025-03-16 14:03:18,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.09090909090909) internal successors, (221), 11 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4483 states and 6195 transitions. [2025-03-16 14:03:18,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-16 14:03:18,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:18,976 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:18,982 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 14:03:19,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:19,180 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:19,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:19,180 INFO L85 PathProgramCache]: Analyzing trace with hash 289674444, now seen corresponding path program 1 times [2025-03-16 14:03:19,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:19,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475224090] [2025-03-16 14:03:19,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:19,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:19,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 14:03:19,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:03:19,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:19,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 442 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 14:03:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475224090] [2025-03-16 14:03:19,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475224090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:19,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898122364] [2025-03-16 14:03:19,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:19,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:19,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:19,279 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 14:03:19,281 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 14:03:19,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-16 14:03:19,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-16 14:03:19,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:19,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 14:03:19,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-16 14:03:19,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 977 backedges. 320 proven. 22 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2025-03-16 14:03:19,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898122364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:19,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:19,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-16 14:03:19,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657954417] [2025-03-16 14:03:19,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:19,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 14:03:19,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:19,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 14:03:19,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 14:03:19,532 INFO L87 Difference]: Start difference. First operand 4483 states and 6195 transitions. Second operand has 10 states, 10 states have (on average 31.3) internal successors, (313), 10 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:20,084 INFO L93 Difference]: Finished difference Result 9723 states and 13787 transitions. [2025-03-16 14:03:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 14:03:20,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 31.3) internal successors, (313), 10 states have internal predecessors, (313), 0 states have call successors, (0), 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 299 [2025-03-16 14:03:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:20,090 INFO L225 Difference]: With dead ends: 9723 [2025-03-16 14:03:20,090 INFO L226 Difference]: Without dead ends: 3901 [2025-03-16 14:03:20,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2025-03-16 14:03:20,095 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 334 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:20,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 1329 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:03:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3901 states. [2025-03-16 14:03:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3901 to 3438. [2025-03-16 14:03:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.384928716904277) internal successors, (4760), 3437 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4760 transitions. [2025-03-16 14:03:20,149 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4760 transitions. Word has length 299 [2025-03-16 14:03:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:20,149 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4760 transitions. [2025-03-16 14:03:20,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.3) internal successors, (313), 10 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4760 transitions. [2025-03-16 14:03:20,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-03-16 14:03:20,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:20,154 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:20,161 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 14:03:20,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:20,355 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:20,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:20,355 INFO L85 PathProgramCache]: Analyzing trace with hash -414024846, now seen corresponding path program 1 times [2025-03-16 14:03:20,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:20,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345646149] [2025-03-16 14:03:20,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:20,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:20,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 14:03:20,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 14:03:20,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:20,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 440 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 14:03:20,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:20,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345646149] [2025-03-16 14:03:20,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345646149] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:20,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105250334] [2025-03-16 14:03:20,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:20,450 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 14:03:20,451 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 14:03:20,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-03-16 14:03:20,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-03-16 14:03:20,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:20,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:20,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 809 trivial. 0 not checked. [2025-03-16 14:03:20,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:03:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105250334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:03:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:03:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:03:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942059016] [2025-03-16 14:03:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:03:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:03:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:20,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:03:20,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:03:20,797 INFO L87 Difference]: Start difference. First operand 3438 states and 4760 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:20,814 INFO L93 Difference]: Finished difference Result 3446 states and 4767 transitions. [2025-03-16 14:03:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:03:20,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 300 [2025-03-16 14:03:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:20,818 INFO L225 Difference]: With dead ends: 3446 [2025-03-16 14:03:20,818 INFO L226 Difference]: Without dead ends: 2223 [2025-03-16 14:03:20,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:03:20,820 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 54 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:20,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:03:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2025-03-16 14:03:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2219. [2025-03-16 14:03:20,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 2218 states have (on average 1.376014427412083) internal successors, (3052), 2218 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 3052 transitions. [2025-03-16 14:03:20,840 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 3052 transitions. Word has length 300 [2025-03-16 14:03:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:20,840 INFO L471 AbstractCegarLoop]: Abstraction has 2219 states and 3052 transitions. [2025-03-16 14:03:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 3052 transitions. [2025-03-16 14:03:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-16 14:03:20,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:20,844 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:20,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 14:03:21,044 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,SelfDestructingSolverStorable22 [2025-03-16 14:03:21,044 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:21,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:21,045 INFO L85 PathProgramCache]: Analyzing trace with hash -492703584, now seen corresponding path program 1 times [2025-03-16 14:03:21,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:21,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804358797] [2025-03-16 14:03:21,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:21,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:21,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-16 14:03:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-16 14:03:21,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:21,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 14:03:21,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804358797] [2025-03-16 14:03:21,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804358797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:21,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342993780] [2025-03-16 14:03:21,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:21,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:21,129 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 14:03:21,131 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 14:03:21,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-16 14:03:21,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-16 14:03:21,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:21,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:21,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:21,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 14:03:21,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 979 backedges. 444 proven. 11 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-03-16 14:03:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342993780] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:21,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 14:03:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572444329] [2025-03-16 14:03:21,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:21,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:03:21,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:21,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:03:21,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:21,335 INFO L87 Difference]: Start difference. First operand 2219 states and 3052 transitions. Second operand has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:21,633 INFO L93 Difference]: Finished difference Result 5551 states and 7756 transitions. [2025-03-16 14:03:21,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:03:21,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 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 302 [2025-03-16 14:03:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:21,639 INFO L225 Difference]: With dead ends: 5551 [2025-03-16 14:03:21,639 INFO L226 Difference]: Without dead ends: 3198 [2025-03-16 14:03:21,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-16 14:03:21,641 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 205 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:21,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 771 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:03:21,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3198 states. [2025-03-16 14:03:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3198 to 2407. [2025-03-16 14:03:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2407 states, 2406 states have (on average 1.3865336658354115) internal successors, (3336), 2406 states have internal predecessors, (3336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 3336 transitions. [2025-03-16 14:03:21,667 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 3336 transitions. Word has length 302 [2025-03-16 14:03:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:21,667 INFO L471 AbstractCegarLoop]: Abstraction has 2407 states and 3336 transitions. [2025-03-16 14:03:21,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 3336 transitions. [2025-03-16 14:03:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-16 14:03:21,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:03:21,671 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:03:21,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:21,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:21,872 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:03:21,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:03:21,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1431013632, now seen corresponding path program 1 times [2025-03-16 14:03:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:03:21,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211926499] [2025-03-16 14:03:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:03:21,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-16 14:03:21,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-16 14:03:21,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:21,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 597 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:03:21,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:03:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211926499] [2025-03-16 14:03:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211926499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:03:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647461979] [2025-03-16 14:03:21,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:03:21,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:21,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:03:21,957 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 14:03:21,959 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 14:03:22,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-16 14:03:22,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-16 14:03:22,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:03:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:03:22,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:03:22,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:03:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 597 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:03:22,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:03:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 597 proven. 4 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-16 14:03:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647461979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 14:03:22,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 14:03:22,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 14:03:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556087004] [2025-03-16 14:03:22,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 14:03:22,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 14:03:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:03:22,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 14:03:22,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:03:22,158 INFO L87 Difference]: Start difference. First operand 2407 states and 3336 transitions. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:03:22,308 INFO L93 Difference]: Finished difference Result 3422 states and 4695 transitions. [2025-03-16 14:03:22,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:03:22,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 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 326 [2025-03-16 14:03:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:03:22,310 INFO L225 Difference]: With dead ends: 3422 [2025-03-16 14:03:22,310 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:03:22,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:03:22,312 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 128 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:03:22,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 356 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:03:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:03:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:03:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:03:22,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 326 [2025-03-16 14:03:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:03:22,314 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:03:22,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:03:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:03:22,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:03:22,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:03:22,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 14:03:22,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:03:22,519 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, 1, 1] [2025-03-16 14:03:22,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:03:25,380 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:03:25,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:03:25 BoogieIcfgContainer [2025-03-16 14:03:25,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:03:25,395 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:03:25,395 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:03:25,396 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:03:25,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:03:12" (3/4) ... [2025-03-16 14:03:25,397 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:03:25,409 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-16 14:03:25,412 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:03:25,412 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:03:25,413 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:03:25,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:03:25,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:03:25,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:03:25,489 INFO L158 Benchmark]: Toolchain (without parser) took 13967.76ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 112.4MB in the beginning and 185.5MB in the end (delta: -73.2MB). Peak memory consumption was 269.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:25,489 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:25,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.27ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 96.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:03:25,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.52ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:25,489 INFO L158 Benchmark]: Boogie Preprocessor took 29.86ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:03:25,489 INFO L158 Benchmark]: IcfgBuilder took 500.10ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 56.0MB in the end (delta: 36.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:03:25,490 INFO L158 Benchmark]: TraceAbstraction took 13055.72ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 55.5MB in the beginning and 198.1MB in the end (delta: -142.6MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. [2025-03-16 14:03:25,490 INFO L158 Benchmark]: Witness Printer took 92.68ms. Allocated memory is still 486.5MB. Free memory was 198.1MB in the beginning and 185.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:03:25,492 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.44ms. Allocated memory is still 201.3MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.27ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 96.9MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.52ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.3MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.86ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 500.10ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 56.0MB in the end (delta: 36.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13055.72ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 55.5MB in the beginning and 198.1MB in the end (delta: -142.6MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. * Witness Printer took 92.68ms. Allocated memory is still 486.5MB. Free memory was 198.1MB in the beginning and 185.5MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. 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: 624]: 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, 130 locations, 222 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 25, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2086 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2086 mSDsluCounter, 9568 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4664 mSDsCounter, 415 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4329 IncrementalHoareTripleChecker+Invalid, 4744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 415 mSolverCounterUnsat, 4904 mSDtfsCounter, 4329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3392 GetRequests, 3324 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4669occurred in iteration=19, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 3909 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 6464 NumberOfCodeBlocks, 6464 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 7653 ConstructedInterpolants, 0 QuantifiedInterpolants, 10246 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3873 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 22546/22767 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: 109]: Location Invariant Derived location invariant: ((((((((((((((((((((ag_Y <= 208) && (s__state <= 208)) && (s__hit != 0)) || ((((4368 == s__state) && (ag_Y <= 208)) && (s__hit != 0)) && (blastFlag == 0))) || ((2 == blastFlag) && (48 == ag_Z))) || (((s__hit != 0) && (4416 == s__state)) && (blastFlag <= 4))) || ((((s__hit == 0) && (48 == ag_Z)) && (12292 == s__state)) && (blastFlag == 0))) || (((4384 == s__state) && (blastFlag == 1)) && (s__hit != 0))) || (((48 == ag_Z) && (4416 == s__state)) && (blastFlag <= 4))) || ((((4432 <= s__state) && (48 == ag_Z)) && (s__state <= 4528)) && (blastFlag <= 4))) || (((((s__hit == 0) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (4560 == s__state)) && (blastFlag <= 4))) || ((((ag_Y <= 208) && (s__hit != 0)) && (12292 == s__state)) && (blastFlag == 0))) || (((4384 == s__state) && (blastFlag == 1)) && (48 == ag_Z))) || (((4352 == s__state) && (3 == s__s3__tmp__next_state___0)) && (s__hit != 0))) || ((((4432 <= s__state) && (s__hit != 0)) && (s__state <= 4528)) && (blastFlag <= 4))) || ((48 == ag_Z) && (48 == s__state))) || ((((s__hit == 0) && (4368 == s__state)) && (48 == ag_Z)) && (blastFlag == 0))) || (((((4352 == s__state) && (s__hit == 0)) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (blastFlag <= 4))) || (3 == s__state)) || ((2 == blastFlag) && (s__hit != 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:03:25,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE