./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-03 09:43:49,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:43:49,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:43:49,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:43:49,329 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:43:49,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:43:49,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:43:49,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:43:49,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:43:49,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:43:49,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:43:49,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:43:49,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:43:49,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:43:49,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:43:49,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:43:49,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:43:49,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:49,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:43:49,357 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:43:49,357 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-03 09:43:49,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:43:49,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:43:49,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:43:49,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:43:49,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:43:49,576 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-03 09:43:50,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5407779cd/612124d062b840c68c4085860e2843c5/FLAG9c12cbbb4 [2025-03-03 09:43:50,913 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:43:50,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-1a.c [2025-03-03 09:43:50,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5407779cd/612124d062b840c68c4085860e2843c5/FLAG9c12cbbb4 [2025-03-03 09:43:50,934 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5407779cd/612124d062b840c68c4085860e2843c5 [2025-03-03 09:43:50,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:43:50,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:43:50,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:50,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:43:50,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:43:50,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:50" (1/1) ... [2025-03-03 09:43:50,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@360e961e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:50, skipping insertion in model container [2025-03-03 09:43:50,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:43:50" (1/1) ... [2025-03-03 09:43:50,964 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:43:51,114 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-03 09:43:51,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:51,128 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:43:51,168 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-03 09:43:51,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:43:51,180 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:43:51,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51 WrapperNode [2025-03-03 09:43:51,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:43:51,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:51,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:43:51,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:43:51,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,221 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 526 [2025-03-03 09:43:51,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:43:51,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:43:51,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:43:51,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:43:51,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,241 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:43:51,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:43:51,249 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:43:51,249 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:43:51,249 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:43:51,250 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (1/1) ... [2025-03-03 09:43:51,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:43:51,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:51,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:43:51,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:43:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:43:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:43:51,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:43:51,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:43:51,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:43:51,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:43:51,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume false; [2025-03-03 09:43:51,740 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: assume !false; [2025-03-03 09:43:51,778 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 09:43:51,778 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:43:51,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:43:51,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:43:51,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:51 BoogieIcfgContainer [2025-03-03 09:43:51,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:43:51,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:43:51,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:43:51,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:43:51,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:43:50" (1/3) ... [2025-03-03 09:43:51,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5104fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:51, skipping insertion in model container [2025-03-03 09:43:51,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:43:51" (2/3) ... [2025-03-03 09:43:51,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5104fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:43:51, skipping insertion in model container [2025-03-03 09:43:51,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:51" (3/3) ... [2025-03-03 09:43:51,800 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-1a.c [2025-03-03 09:43:51,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:43:51,809 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_3.BV.c.cil-1a.c that has 1 procedures, 134 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:43:51,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:43:51,856 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;@1b7a5b93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:43:51,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:43:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 134 states, 132 states have (on average 1.7121212121212122) internal successors, (226), 133 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:51,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:43:51,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:51,865 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:51,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:51,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash 494150078, now seen corresponding path program 1 times [2025-03-03 09:43:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:51,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214897590] [2025-03-03 09:43:51,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:51,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:43:51,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:43:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:51,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214897590] [2025-03-03 09:43:52,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214897590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:52,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:52,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718339343] [2025-03-03 09:43:52,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:52,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:52,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:52,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,065 INFO L87 Difference]: Start difference. First operand has 134 states, 132 states have (on average 1.7121212121212122) internal successors, (226), 133 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:52,181 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2025-03-03 09:43:52,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:52,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-03 09:43:52,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:52,188 INFO L225 Difference]: With dead ends: 263 [2025-03-03 09:43:52,188 INFO L226 Difference]: Without dead ends: 121 [2025-03-03 09:43:52,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,191 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 334 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-03 09:43:52,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 334 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-03 09:43:52,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-03 09:43:52,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.525) internal successors, (183), 120 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 183 transitions. [2025-03-03 09:43:52,216 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 183 transitions. Word has length 25 [2025-03-03 09:43:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:52,216 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 183 transitions. [2025-03-03 09:43:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 183 transitions. [2025-03-03 09:43:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 09:43:52,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:52,217 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 09:43:52,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:43:52,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:52,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1232434682, now seen corresponding path program 1 times [2025-03-03 09:43:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:52,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589030316] [2025-03-03 09:43:52,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:52,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 09:43:52,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 09:43:52,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:52,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:43:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589030316] [2025-03-03 09:43:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589030316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974050734] [2025-03-03 09:43:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:52,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:52,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:52,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,294 INFO L87 Difference]: Start difference. First operand 121 states and 183 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:52,424 INFO L93 Difference]: Finished difference Result 246 states and 376 transitions. [2025-03-03 09:43:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:52,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 09:43:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:52,425 INFO L225 Difference]: With dead ends: 246 [2025-03-03 09:43:52,425 INFO L226 Difference]: Without dead ends: 136 [2025-03-03 09:43:52,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,426 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 256 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-03 09:43:52,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 256 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-03 09:43:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-03-03 09:43:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.5037037037037038) internal successors, (203), 135 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2025-03-03 09:43:52,433 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 37 [2025-03-03 09:43:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:52,434 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2025-03-03 09:43:52,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2025-03-03 09:43:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:43:52,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:52,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:43:52,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:43:52,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:52,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1508954569, now seen corresponding path program 1 times [2025-03-03 09:43:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173868262] [2025-03-03 09:43:52,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:52,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:52,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 09:43:52,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:43:52,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:52,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:43:52,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:52,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173868262] [2025-03-03 09:43:52,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173868262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:52,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:52,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:52,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942977056] [2025-03-03 09:43:52,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:52,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:52,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:52,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:52,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,518 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:52,622 INFO L93 Difference]: Finished difference Result 278 states and 420 transitions. [2025-03-03 09:43:52,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:52,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2025-03-03 09:43:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:52,623 INFO L225 Difference]: With dead ends: 278 [2025-03-03 09:43:52,623 INFO L226 Difference]: Without dead ends: 153 [2025-03-03 09:43:52,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,624 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 269 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-03 09:43:52,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 269 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-03 09:43:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-03 09:43:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.480263157894737) internal successors, (225), 152 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 225 transitions. [2025-03-03 09:43:52,633 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 225 transitions. Word has length 51 [2025-03-03 09:43:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:52,634 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 225 transitions. [2025-03-03 09:43:52,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 225 transitions. [2025-03-03 09:43:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 09:43:52,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:52,635 INFO L218 NwaCegarLoop]: trace histogram [4, 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-03 09:43:52,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:43:52,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:52,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1500616061, now seen corresponding path program 1 times [2025-03-03 09:43:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252548187] [2025-03-03 09:43:52,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:52,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 09:43:52,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 09:43:52,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:52,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:43:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252548187] [2025-03-03 09:43:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252548187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34024210] [2025-03-03 09:43:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:52,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:52,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:52,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,745 INFO L87 Difference]: Start difference. First operand 153 states and 225 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:52,775 INFO L93 Difference]: Finished difference Result 434 states and 641 transitions. [2025-03-03 09:43:52,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:52,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 70 [2025-03-03 09:43:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:52,777 INFO L225 Difference]: With dead ends: 434 [2025-03-03 09:43:52,777 INFO L226 Difference]: Without dead ends: 292 [2025-03-03 09:43:52,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,778 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 134 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 380 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-03 09:43:52,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 380 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-03-03 09:43:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2025-03-03 09:43:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.4639175257731958) internal successors, (426), 291 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 426 transitions. [2025-03-03 09:43:52,791 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 426 transitions. Word has length 70 [2025-03-03 09:43:52,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:52,791 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 426 transitions. [2025-03-03 09:43:52,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 426 transitions. [2025-03-03 09:43:52,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:43:52,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:52,793 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-03-03 09:43:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:43:52,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:52,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash -84552353, now seen corresponding path program 1 times [2025-03-03 09:43:52,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243579978] [2025-03-03 09:43:52,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:52,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:43:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:43:52,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:52,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:43:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:52,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243579978] [2025-03-03 09:43:52,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243579978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:52,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:52,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:52,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710363091] [2025-03-03 09:43:52,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:52,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:52,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:52,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,848 INFO L87 Difference]: Start difference. First operand 292 states and 426 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:52,869 INFO L93 Difference]: Finished difference Result 594 states and 864 transitions. [2025-03-03 09:43:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:52,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 71 [2025-03-03 09:43:52,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:52,871 INFO L225 Difference]: With dead ends: 594 [2025-03-03 09:43:52,871 INFO L226 Difference]: Without dead ends: 313 [2025-03-03 09:43:52,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,873 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 11 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 361 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-03 09:43:52,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 361 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-03 09:43:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2025-03-03 09:43:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4519230769230769) internal successors, (453), 312 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 453 transitions. [2025-03-03 09:43:52,889 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 453 transitions. Word has length 71 [2025-03-03 09:43:52,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:52,890 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 453 transitions. [2025-03-03 09:43:52,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 453 transitions. [2025-03-03 09:43:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 09:43:52,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:52,891 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 1] [2025-03-03 09:43:52,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:43:52,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:52,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1109246274, now seen corresponding path program 1 times [2025-03-03 09:43:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293799802] [2025-03-03 09:43:52,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:52,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 09:43:52,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 09:43:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:43:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293799802] [2025-03-03 09:43:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293799802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:52,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:52,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:52,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181790750] [2025-03-03 09:43:52,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:52,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:52,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:52,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:52,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,941 INFO L87 Difference]: Start difference. First operand 313 states and 453 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:52,960 INFO L93 Difference]: Finished difference Result 641 states and 924 transitions. [2025-03-03 09:43:52,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:52,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 71 [2025-03-03 09:43:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:52,962 INFO L225 Difference]: With dead ends: 641 [2025-03-03 09:43:52,962 INFO L226 Difference]: Without dead ends: 339 [2025-03-03 09:43:52,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:52,963 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 21 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 331 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-03 09:43:52,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 331 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:52,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-03 09:43:52,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-03-03 09:43:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 1.4378698224852071) internal successors, (486), 338 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 486 transitions. [2025-03-03 09:43:52,972 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 486 transitions. Word has length 71 [2025-03-03 09:43:52,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:52,972 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 486 transitions. [2025-03-03 09:43:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 486 transitions. [2025-03-03 09:43:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 09:43:52,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:52,975 INFO L218 NwaCegarLoop]: trace histogram [5, 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, 1] [2025-03-03 09:43:52,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:43:52,975 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:52,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -2050214532, now seen corresponding path program 1 times [2025-03-03 09:43:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331641738] [2025-03-03 09:43:52,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:52,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 09:43:52,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 09:43:52,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:52,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-03 09:43:53,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:53,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331641738] [2025-03-03 09:43:53,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331641738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:53,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:53,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:53,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678944133] [2025-03-03 09:43:53,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:53,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:53,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:53,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,022 INFO L87 Difference]: Start difference. First operand 339 states and 486 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:53,123 INFO L93 Difference]: Finished difference Result 683 states and 999 transitions. [2025-03-03 09:43:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:53,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 88 [2025-03-03 09:43:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:53,126 INFO L225 Difference]: With dead ends: 683 [2025-03-03 09:43:53,126 INFO L226 Difference]: Without dead ends: 381 [2025-03-03 09:43:53,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,127 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 274 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-03 09:43:53,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 274 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:53,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-03-03 09:43:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-03-03 09:43:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 1.4157894736842105) internal successors, (538), 380 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 538 transitions. [2025-03-03 09:43:53,135 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 538 transitions. Word has length 88 [2025-03-03 09:43:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:53,135 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 538 transitions. [2025-03-03 09:43:53,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 538 transitions. [2025-03-03 09:43:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 09:43:53,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:53,137 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1] [2025-03-03 09:43:53,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:43:53,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:53,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:53,138 INFO L85 PathProgramCache]: Analyzing trace with hash 574101662, now seen corresponding path program 1 times [2025-03-03 09:43:53,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:53,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457629116] [2025-03-03 09:43:53,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 09:43:53,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 09:43:53,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:53,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 09:43:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:53,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457629116] [2025-03-03 09:43:53,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457629116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:53,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821327469] [2025-03-03 09:43:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:53,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:53,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:53,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:53,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,215 INFO L87 Difference]: Start difference. First operand 381 states and 538 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:53,248 INFO L93 Difference]: Finished difference Result 544 states and 773 transitions. [2025-03-03 09:43:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:53,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 108 [2025-03-03 09:43:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:53,251 INFO L225 Difference]: With dead ends: 544 [2025-03-03 09:43:53,251 INFO L226 Difference]: Without dead ends: 542 [2025-03-03 09:43:53,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,251 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 150 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 321 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-03 09:43:53,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 321 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-03 09:43:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-03-03 09:43:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4251386321626618) internal successors, (771), 541 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 771 transitions. [2025-03-03 09:43:53,264 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 771 transitions. Word has length 108 [2025-03-03 09:43:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:53,264 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 771 transitions. [2025-03-03 09:43:53,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 771 transitions. [2025-03-03 09:43:53,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 09:43:53,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:53,268 INFO L218 NwaCegarLoop]: trace histogram [7, 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, 1] [2025-03-03 09:43:53,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 09:43:53,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:53,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1257208250, now seen corresponding path program 1 times [2025-03-03 09:43:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:53,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505955163] [2025-03-03 09:43:53,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:53,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:53,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 09:43:53,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 09:43:53,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:53,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 09:43:53,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:53,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505955163] [2025-03-03 09:43:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505955163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970448106] [2025-03-03 09:43:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:53,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:53,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:53,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:53,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,350 INFO L87 Difference]: Start difference. First operand 542 states and 771 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:53,497 INFO L93 Difference]: Finished difference Result 1173 states and 1727 transitions. [2025-03-03 09:43:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2025-03-03 09:43:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:53,500 INFO L225 Difference]: With dead ends: 1173 [2025-03-03 09:43:53,500 INFO L226 Difference]: Without dead ends: 665 [2025-03-03 09:43:53,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,501 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 51 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 253 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-03 09:43:53,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 253 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-03 09:43:53,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2025-03-03 09:43:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 664 states have (on average 1.4593373493975903) internal successors, (969), 664 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 969 transitions. [2025-03-03 09:43:53,525 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 969 transitions. Word has length 128 [2025-03-03 09:43:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:53,525 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 969 transitions. [2025-03-03 09:43:53,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 969 transitions. [2025-03-03 09:43:53,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 09:43:53,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:53,527 INFO L218 NwaCegarLoop]: trace histogram [9, 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, 1] [2025-03-03 09:43:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:43:53,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:53,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash 285814174, now seen corresponding path program 1 times [2025-03-03 09:43:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:53,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428377107] [2025-03-03 09:43:53,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 09:43:53,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 09:43:53,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:53,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-03 09:43:53,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:53,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428377107] [2025-03-03 09:43:53,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428377107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:53,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:53,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517914487] [2025-03-03 09:43:53,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:53,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:53,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:53,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:53,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,601 INFO L87 Difference]: Start difference. First operand 665 states and 969 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:53,736 INFO L93 Difference]: Finished difference Result 1536 states and 2315 transitions. [2025-03-03 09:43:53,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:53,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 154 [2025-03-03 09:43:53,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:53,739 INFO L225 Difference]: With dead ends: 1536 [2025-03-03 09:43:53,739 INFO L226 Difference]: Without dead ends: 857 [2025-03-03 09:43:53,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,740 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 47 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 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-03 09:43:53,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-03 09:43:53,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 854. [2025-03-03 09:43:53,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 853 states have (on average 1.4314185228604923) internal successors, (1221), 853 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1221 transitions. [2025-03-03 09:43:53,756 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1221 transitions. Word has length 154 [2025-03-03 09:43:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 854 states and 1221 transitions. [2025-03-03 09:43:53,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1221 transitions. [2025-03-03 09:43:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 09:43:53,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:53,758 INFO L218 NwaCegarLoop]: trace histogram [10, 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, 1] [2025-03-03 09:43:53,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 09:43:53,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:53,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:53,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1410787915, now seen corresponding path program 1 times [2025-03-03 09:43:53,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:53,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191209740] [2025-03-03 09:43:53,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 09:43:53,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 09:43:53,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:53,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-03 09:43:53,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:53,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191209740] [2025-03-03 09:43:53,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191209740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:53,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:53,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166279693] [2025-03-03 09:43:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:53,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:53,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:53,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:53,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,824 INFO L87 Difference]: Start difference. First operand 854 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:53,958 INFO L93 Difference]: Finished difference Result 1794 states and 2591 transitions. [2025-03-03 09:43:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:53,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-03-03 09:43:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:53,961 INFO L225 Difference]: With dead ends: 1794 [2025-03-03 09:43:53,961 INFO L226 Difference]: Without dead ends: 932 [2025-03-03 09:43:53,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:53,965 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 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-03 09:43:53,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:53,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-03 09:43:53,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-03-03 09:43:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 928 states have (on average 1.4191810344827587) internal successors, (1317), 928 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1317 transitions. [2025-03-03 09:43:53,985 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1317 transitions. Word has length 175 [2025-03-03 09:43:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:53,985 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1317 transitions. [2025-03-03 09:43:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1317 transitions. [2025-03-03 09:43:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 09:43:53,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:53,988 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 1] [2025-03-03 09:43:53,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:43:53,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:53,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -759185994, now seen corresponding path program 1 times [2025-03-03 09:43:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:53,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463710292] [2025-03-03 09:43:53,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:54,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 09:43:54,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 09:43:54,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:54,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-03 09:43:54,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:54,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463710292] [2025-03-03 09:43:54,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463710292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:54,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:54,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:54,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765871398] [2025-03-03 09:43:54,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:54,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:54,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:54,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:54,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,072 INFO L87 Difference]: Start difference. First operand 929 states and 1317 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:54,211 INFO L93 Difference]: Finished difference Result 1947 states and 2786 transitions. [2025-03-03 09:43:54,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:54,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-03-03 09:43:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:54,215 INFO L225 Difference]: With dead ends: 1947 [2025-03-03 09:43:54,215 INFO L226 Difference]: Without dead ends: 1016 [2025-03-03 09:43:54,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,217 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 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-03 09:43:54,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:54,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2025-03-03 09:43:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1013. [2025-03-03 09:43:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 1012 states have (on average 1.4110671936758894) internal successors, (1428), 1012 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1428 transitions. [2025-03-03 09:43:54,241 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1428 transitions. Word has length 199 [2025-03-03 09:43:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:54,241 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1428 transitions. [2025-03-03 09:43:54,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1428 transitions. [2025-03-03 09:43:54,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 09:43:54,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:54,245 INFO L218 NwaCegarLoop]: trace histogram [11, 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, 1] [2025-03-03 09:43:54,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:43:54,245 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:54,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:54,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1005499081, now seen corresponding path program 1 times [2025-03-03 09:43:54,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:54,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137851665] [2025-03-03 09:43:54,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:54,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:54,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 09:43:54,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 09:43:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-03 09:43:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137851665] [2025-03-03 09:43:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137851665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011889942] [2025-03-03 09:43:54,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:54,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:54,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:54,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,331 INFO L87 Difference]: Start difference. First operand 1013 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:54,488 INFO L93 Difference]: Finished difference Result 2112 states and 3005 transitions. [2025-03-03 09:43:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-03-03 09:43:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:54,492 INFO L225 Difference]: With dead ends: 2112 [2025-03-03 09:43:54,492 INFO L226 Difference]: Without dead ends: 1109 [2025-03-03 09:43:54,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,493 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 48 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 246 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-03 09:43:54,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 246 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:54,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-03 09:43:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1106. [2025-03-03 09:43:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1105 states have (on average 1.411764705882353) internal successors, (1560), 1105 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1560 transitions. [2025-03-03 09:43:54,511 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1560 transitions. Word has length 199 [2025-03-03 09:43:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:54,512 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1560 transitions. [2025-03-03 09:43:54,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1560 transitions. [2025-03-03 09:43:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 09:43:54,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:54,514 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1] [2025-03-03 09:43:54,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:43:54,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -227467202, now seen corresponding path program 1 times [2025-03-03 09:43:54,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:54,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075608857] [2025-03-03 09:43:54,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:54,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:54,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 09:43:54,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 09:43:54,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:54,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:54,590 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-03 09:43:54,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:54,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075608857] [2025-03-03 09:43:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075608857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:54,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:54,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:54,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319806846] [2025-03-03 09:43:54,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:54,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:54,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:54,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,592 INFO L87 Difference]: Start difference. First operand 1106 states and 1560 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-03 09:43:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:54,620 INFO L93 Difference]: Finished difference Result 3241 states and 4579 transitions. [2025-03-03 09:43:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:54,621 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 229 [2025-03-03 09:43:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:54,626 INFO L225 Difference]: With dead ends: 3241 [2025-03-03 09:43:54,626 INFO L226 Difference]: Without dead ends: 2172 [2025-03-03 09:43:54,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,628 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 136 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 508 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-03 09:43:54,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 508 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:54,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2025-03-03 09:43:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2170. [2025-03-03 09:43:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2170 states, 2169 states have (on average 1.4126325495620102) internal successors, (3064), 2169 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 3064 transitions. [2025-03-03 09:43:54,663 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 3064 transitions. Word has length 229 [2025-03-03 09:43:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:54,664 INFO L471 AbstractCegarLoop]: Abstraction has 2170 states and 3064 transitions. [2025-03-03 09:43:54,664 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-03 09:43:54,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 3064 transitions. [2025-03-03 09:43:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 09:43:54,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:54,667 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1] [2025-03-03 09:43:54,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 09:43:54,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:54,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:54,667 INFO L85 PathProgramCache]: Analyzing trace with hash -473780289, now seen corresponding path program 1 times [2025-03-03 09:43:54,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:54,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034469264] [2025-03-03 09:43:54,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:54,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:54,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 09:43:54,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 09:43:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2025-03-03 09:43:54,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:54,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034469264] [2025-03-03 09:43:54,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034469264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:54,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:54,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182332437] [2025-03-03 09:43:54,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:54,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:54,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:54,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:54,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,728 INFO L87 Difference]: Start difference. First operand 2170 states and 3064 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:54,864 INFO L93 Difference]: Finished difference Result 4549 states and 6475 transitions. [2025-03-03 09:43:54,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:54,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 229 [2025-03-03 09:43:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:54,871 INFO L225 Difference]: With dead ends: 4549 [2025-03-03 09:43:54,871 INFO L226 Difference]: Without dead ends: 2386 [2025-03-03 09:43:54,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,874 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 49 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 243 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-03 09:43:54,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 243 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:54,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-03 09:43:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2380. [2025-03-03 09:43:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2380 states, 2379 states have (on average 1.4190836485918452) internal successors, (3376), 2379 states have internal predecessors, (3376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3376 transitions. [2025-03-03 09:43:54,915 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3376 transitions. Word has length 229 [2025-03-03 09:43:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:54,915 INFO L471 AbstractCegarLoop]: Abstraction has 2380 states and 3376 transitions. [2025-03-03 09:43:54,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3376 transitions. [2025-03-03 09:43:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-03-03 09:43:54,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:54,919 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1] [2025-03-03 09:43:54,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 09:43:54,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1070628408, now seen corresponding path program 1 times [2025-03-03 09:43:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:54,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670814213] [2025-03-03 09:43:54,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:54,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-03-03 09:43:54,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-03-03 09:43:54,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:54,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-03-03 09:43:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670814213] [2025-03-03 09:43:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670814213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:54,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:54,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936057739] [2025-03-03 09:43:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:54,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:54,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:54,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:54,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:54,997 INFO L87 Difference]: Start difference. First operand 2380 states and 3376 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:55,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:55,144 INFO L93 Difference]: Finished difference Result 4729 states and 6709 transitions. [2025-03-03 09:43:55,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:55,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 264 [2025-03-03 09:43:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:55,152 INFO L225 Difference]: With dead ends: 4729 [2025-03-03 09:43:55,153 INFO L226 Difference]: Without dead ends: 2368 [2025-03-03 09:43:55,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:55,155 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 51 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 239 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-03 09:43:55,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 239 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2025-03-03 09:43:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2362. [2025-03-03 09:43:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.4070309191020753) internal successors, (3322), 2361 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:55,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 3322 transitions. [2025-03-03 09:43:55,223 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 3322 transitions. Word has length 264 [2025-03-03 09:43:55,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:55,223 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 3322 transitions. [2025-03-03 09:43:55,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 3322 transitions. [2025-03-03 09:43:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 09:43:55,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:55,227 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1] [2025-03-03 09:43:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 09:43:55,227 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1268610640, now seen corresponding path program 1 times [2025-03-03 09:43:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976254399] [2025-03-03 09:43:55,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:55,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:55,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 09:43:55,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 09:43:55,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:55,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2025-03-03 09:43:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:55,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976254399] [2025-03-03 09:43:55,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976254399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:55,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:55,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:55,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518268736] [2025-03-03 09:43:55,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:55,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:55,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:55,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:55,334 INFO L87 Difference]: Start difference. First operand 2362 states and 3322 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:55,380 INFO L93 Difference]: Finished difference Result 6975 states and 9808 transitions. [2025-03-03 09:43:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 274 [2025-03-03 09:43:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:55,393 INFO L225 Difference]: With dead ends: 6975 [2025-03-03 09:43:55,393 INFO L226 Difference]: Without dead ends: 4650 [2025-03-03 09:43:55,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:55,396 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 73 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 340 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-03 09:43:55,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 340 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2025-03-03 09:43:55,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4648. [2025-03-03 09:43:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4647 states have (on average 1.4021949644932215) internal successors, (6516), 4647 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 6516 transitions. [2025-03-03 09:43:55,479 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 6516 transitions. Word has length 274 [2025-03-03 09:43:55,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:55,480 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 6516 transitions. [2025-03-03 09:43:55,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:55,480 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 6516 transitions. [2025-03-03 09:43:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 09:43:55,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:55,486 INFO L218 NwaCegarLoop]: trace histogram [12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:43:55,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:43:55,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:55,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:55,486 INFO L85 PathProgramCache]: Analyzing trace with hash 262698130, now seen corresponding path program 1 times [2025-03-03 09:43:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216693183] [2025-03-03 09:43:55,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:55,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:55,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 09:43:55,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 09:43:55,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:55,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 315 proven. 25 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-03-03 09:43:55,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216693183] [2025-03-03 09:43:55,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216693183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:55,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839192052] [2025-03-03 09:43:55,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:55,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:55,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:43:55,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 09:43:55,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 09:43:55,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:55,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:55,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:43:55,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 09:43:55,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839192052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:55,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:55,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 09:43:55,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258513646] [2025-03-03 09:43:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:55,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:55,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:55,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:43:55,806 INFO L87 Difference]: Start difference. First operand 4648 states and 6516 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-03 09:43:55,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:55,947 INFO L93 Difference]: Finished difference Result 9242 states and 12959 transitions. [2025-03-03 09:43:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:55,947 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 274 [2025-03-03 09:43:55,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:55,986 INFO L225 Difference]: With dead ends: 9242 [2025-03-03 09:43:55,986 INFO L226 Difference]: Without dead ends: 4660 [2025-03-03 09:43:55,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 274 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-03 09:43:55,990 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 271 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-03 09:43:55,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 271 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4660 states. [2025-03-03 09:43:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4660 to 4648. [2025-03-03 09:43:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4647 states have (on average 1.3789541639767593) internal successors, (6408), 4647 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 6408 transitions. [2025-03-03 09:43:56,071 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 6408 transitions. Word has length 274 [2025-03-03 09:43:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:56,072 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 6408 transitions. [2025-03-03 09:43:56,072 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-03 09:43:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 6408 transitions. [2025-03-03 09:43:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 09:43:56,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:56,078 INFO L218 NwaCegarLoop]: trace histogram [14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:43:56,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:56,278 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-03 09:43:56,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1995551401, now seen corresponding path program 1 times [2025-03-03 09:43:56,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255058575] [2025-03-03 09:43:56,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:56,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 09:43:56,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 09:43:56,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:56,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 382 proven. 25 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2025-03-03 09:43:56,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255058575] [2025-03-03 09:43:56,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255058575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:56,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507362709] [2025-03-03 09:43:56,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:56,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:56,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:56,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:43:56,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 09:43:56,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 09:43:56,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:56,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:56,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:43:56,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 09:43:56,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507362709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:56,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 09:43:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307025903] [2025-03-03 09:43:56,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:56,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:56,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:56,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:43:56,547 INFO L87 Difference]: Start difference. First operand 4648 states and 6408 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:56,689 INFO L93 Difference]: Finished difference Result 9728 states and 13313 transitions. [2025-03-03 09:43:56,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 301 [2025-03-03 09:43:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:56,703 INFO L225 Difference]: With dead ends: 9728 [2025-03-03 09:43:56,704 INFO L226 Difference]: Without dead ends: 5146 [2025-03-03 09:43:56,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 301 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-03 09:43:56,708 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 61 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 227 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-03 09:43:56,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 227 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:56,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2025-03-03 09:43:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 4822. [2025-03-03 09:43:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4822 states, 4821 states have (on average 1.3777224642190418) internal successors, (6642), 4821 states have internal predecessors, (6642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4822 states to 4822 states and 6642 transitions. [2025-03-03 09:43:56,785 INFO L78 Accepts]: Start accepts. Automaton has 4822 states and 6642 transitions. Word has length 301 [2025-03-03 09:43:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:56,785 INFO L471 AbstractCegarLoop]: Abstraction has 4822 states and 6642 transitions. [2025-03-03 09:43:56,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4822 states and 6642 transitions. [2025-03-03 09:43:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-03-03 09:43:56,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:56,791 INFO L218 NwaCegarLoop]: trace histogram [14, 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, 1] [2025-03-03 09:43:56,797 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-03 09:43:56,991 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-03 09:43:56,991 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 883529065, now seen corresponding path program 1 times [2025-03-03 09:43:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:56,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904334238] [2025-03-03 09:43:56,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:57,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-03-03 09:43:57,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-03-03 09:43:57,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:57,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 09:43:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904334238] [2025-03-03 09:43:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904334238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:43:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:43:57,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521145767] [2025-03-03 09:43:57,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:57,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:57,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:57,100 INFO L87 Difference]: Start difference. First operand 4822 states and 6642 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:57,226 INFO L93 Difference]: Finished difference Result 9902 states and 13523 transitions. [2025-03-03 09:43:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:57,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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-03 09:43:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:57,234 INFO L225 Difference]: With dead ends: 9902 [2025-03-03 09:43:57,234 INFO L226 Difference]: Without dead ends: 4642 [2025-03-03 09:43:57,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:43:57,239 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 39 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 276 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-03 09:43:57,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 276 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:43:57,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4642 states. [2025-03-03 09:43:57,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4642 to 4624. [2025-03-03 09:43:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4624 states, 4623 states have (on average 1.373134328358209) internal successors, (6348), 4623 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4624 states to 4624 states and 6348 transitions. [2025-03-03 09:43:57,306 INFO L78 Accepts]: Start accepts. Automaton has 4624 states and 6348 transitions. Word has length 302 [2025-03-03 09:43:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 4624 states and 6348 transitions. [2025-03-03 09:43:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4624 states and 6348 transitions. [2025-03-03 09:43:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 09:43:57,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:57,311 INFO L218 NwaCegarLoop]: trace histogram [13, 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] [2025-03-03 09:43:57,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 09:43:57,312 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:57,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1960349864, now seen corresponding path program 1 times [2025-03-03 09:43:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449283744] [2025-03-03 09:43:57,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:57,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:57,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 09:43:57,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 09:43:57,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 354 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-03 09:43:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449283744] [2025-03-03 09:43:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449283744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:57,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462285176] [2025-03-03 09:43:57,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:57,427 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:57,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:43:57,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 09:43:57,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 09:43:57,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:57,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:57,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:43:57,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2025-03-03 09:43:57,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:43:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462285176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:43:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:43:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 09:43:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275941640] [2025-03-03 09:43:57,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:43:57,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:43:57,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:57,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:43:57,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:43:57,855 INFO L87 Difference]: Start difference. First operand 4624 states and 6348 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:57,895 INFO L93 Difference]: Finished difference Result 6939 states and 9508 transitions. [2025-03-03 09:43:57,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:43:57,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 312 [2025-03-03 09:43:57,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:57,903 INFO L225 Difference]: With dead ends: 6939 [2025-03-03 09:43:57,903 INFO L226 Difference]: Without dead ends: 4626 [2025-03-03 09:43:57,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 312 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-03 09:43:57,906 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 58 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:57,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 478 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:43:57,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2025-03-03 09:43:57,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4612. [2025-03-03 09:43:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.368900455432661) internal successors, (6312), 4611 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:57,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6312 transitions. [2025-03-03 09:43:57,988 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6312 transitions. Word has length 312 [2025-03-03 09:43:57,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:57,989 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 6312 transitions. [2025-03-03 09:43:57,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:57,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6312 transitions. [2025-03-03 09:43:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-03 09:43:57,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:57,997 INFO L218 NwaCegarLoop]: trace histogram [13, 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-03 09:43:58,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:58,201 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-03 09:43:58,201 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:58,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:58,201 INFO L85 PathProgramCache]: Analyzing trace with hash -462489975, now seen corresponding path program 1 times [2025-03-03 09:43:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589894950] [2025-03-03 09:43:58,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:58,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 09:43:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 09:43:58,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-03 09:43:58,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:58,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589894950] [2025-03-03 09:43:58,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589894950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:58,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60467245] [2025-03-03 09:43:58,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:58,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:58,320 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:58,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:43:58,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-03 09:43:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-03 09:43:58,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:58,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:43:58,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-03 09:43:58,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-03 09:43:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60467245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:58,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:58,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 09:43:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409466335] [2025-03-03 09:43:58,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:58,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:43:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:58,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:43:58,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:43:58,594 INFO L87 Difference]: Start difference. First operand 4612 states and 6312 transitions. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:43:59,048 INFO L93 Difference]: Finished difference Result 7149 states and 9886 transitions. [2025-03-03 09:43:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:43:59,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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 312 [2025-03-03 09:43:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:43:59,055 INFO L225 Difference]: With dead ends: 7149 [2025-03-03 09:43:59,055 INFO L226 Difference]: Without dead ends: 4638 [2025-03-03 09:43:59,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:43:59,059 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 224 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:43:59,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1906 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:43:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2025-03-03 09:43:59,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 4612. [2025-03-03 09:43:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 4611 states have (on average 1.3662979830839297) internal successors, (6300), 4611 states have internal predecessors, (6300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6300 transitions. [2025-03-03 09:43:59,143 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6300 transitions. Word has length 312 [2025-03-03 09:43:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:43:59,143 INFO L471 AbstractCegarLoop]: Abstraction has 4612 states and 6300 transitions. [2025-03-03 09:43:59,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:43:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6300 transitions. [2025-03-03 09:43:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-03 09:43:59,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:43:59,148 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1] [2025-03-03 09:43:59,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:43:59,353 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-03 09:43:59,353 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:43:59,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:43:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1215613929, now seen corresponding path program 1 times [2025-03-03 09:43:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:43:59,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311953638] [2025-03-03 09:43:59,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:43:59,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-03 09:43:59,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-03 09:43:59,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:59,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 474 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 09:43:59,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:43:59,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311953638] [2025-03-03 09:43:59,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311953638] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:43:59,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453056756] [2025-03-03 09:43:59,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:43:59,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:43:59,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:43:59,449 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:43:59,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-03 09:43:59,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-03 09:43:59,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-03 09:43:59,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:43:59,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:43:59,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:43:59,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:43:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-03 09:43:59,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:43:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 356 proven. 25 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-03 09:43:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453056756] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:43:59,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:43:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-03 09:43:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243383376] [2025-03-03 09:43:59,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:43:59,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:43:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:43:59,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:43:59,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:43:59,726 INFO L87 Difference]: Start difference. First operand 4612 states and 6300 transitions. Second operand has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:00,106 INFO L93 Difference]: Finished difference Result 5962 states and 8203 transitions. [2025-03-03 09:44:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:44:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 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 313 [2025-03-03 09:44:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:00,110 INFO L225 Difference]: With dead ends: 5962 [2025-03-03 09:44:00,110 INFO L226 Difference]: Without dead ends: 2308 [2025-03-03 09:44:00,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:44:00,114 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 330 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:00,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 997 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:44:00,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2025-03-03 09:44:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2290. [2025-03-03 09:44:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2289 states have (on average 1.36435124508519) internal successors, (3123), 2289 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3123 transitions. [2025-03-03 09:44:00,139 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3123 transitions. Word has length 313 [2025-03-03 09:44:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 2290 states and 3123 transitions. [2025-03-03 09:44:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.2) internal successors, (322), 10 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3123 transitions. [2025-03-03 09:44:00,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 09:44:00,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:00,143 INFO L218 NwaCegarLoop]: trace histogram [13, 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, 1] [2025-03-03 09:44:00,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 09:44:00,343 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-03 09:44:00,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:00,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:00,344 INFO L85 PathProgramCache]: Analyzing trace with hash -721324953, now seen corresponding path program 1 times [2025-03-03 09:44:00,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:00,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173191951] [2025-03-03 09:44:00,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:00,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:00,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 09:44:00,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 09:44:00,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:00,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 09:44:00,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:00,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173191951] [2025-03-03 09:44:00,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173191951] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:00,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120731505] [2025-03-03 09:44:00,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:00,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:00,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:00,455 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:00,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:44:00,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 09:44:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 09:44:00,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:00,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:00,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:00,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 09:44:00,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 476 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2025-03-03 09:44:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120731505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:00,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 09:44:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092721096] [2025-03-03 09:44:00,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:00,691 INFO L87 Difference]: Start difference. First operand 2290 states and 3123 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:00,990 INFO L93 Difference]: Finished difference Result 5724 states and 7929 transitions. [2025-03-03 09:44:00,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:44:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 316 [2025-03-03 09:44:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:00,995 INFO L225 Difference]: With dead ends: 5724 [2025-03-03 09:44:00,996 INFO L226 Difference]: Without dead ends: 3303 [2025-03-03 09:44:00,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 632 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-03 09:44:00,998 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 205 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 784 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-03 09:44:00,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 784 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:44:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2025-03-03 09:44:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2488. [2025-03-03 09:44:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2488 states, 2487 states have (on average 1.3739445114595898) internal successors, (3417), 2487 states have internal predecessors, (3417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2488 states to 2488 states and 3417 transitions. [2025-03-03 09:44:01,028 INFO L78 Accepts]: Start accepts. Automaton has 2488 states and 3417 transitions. Word has length 316 [2025-03-03 09:44:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:01,029 INFO L471 AbstractCegarLoop]: Abstraction has 2488 states and 3417 transitions. [2025-03-03 09:44:01,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:01,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2488 states and 3417 transitions. [2025-03-03 09:44:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 09:44:01,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:44:01,033 INFO L218 NwaCegarLoop]: trace histogram [15, 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, 1] [2025-03-03 09:44:01,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 09:44:01,234 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-03 09:44:01,235 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:44:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:44:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 325628543, now seen corresponding path program 1 times [2025-03-03 09:44:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:44:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222540343] [2025-03-03 09:44:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:44:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 09:44:01,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 09:44:01,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:01,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:01,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 09:44:01,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:44:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222540343] [2025-03-03 09:44:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222540343] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:44:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078324334] [2025-03-03 09:44:01,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:44:01,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:44:01,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:44:01,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:44:01,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:44:01,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 09:44:01,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 09:44:01,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:44:01,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:44:01,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:44:01,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:44:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 09:44:01,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:44:01,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1259 backedges. 653 proven. 5 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2025-03-03 09:44:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078324334] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:44:01,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:44:01,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 09:44:01,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497906956] [2025-03-03 09:44:01,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:44:01,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:44:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:44:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:44:01,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:44:01,553 INFO L87 Difference]: Start difference. First operand 2488 states and 3417 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:44:01,745 INFO L93 Difference]: Finished difference Result 3535 states and 4808 transitions. [2025-03-03 09:44:01,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:44:01,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 342 [2025-03-03 09:44:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:44:01,746 INFO L225 Difference]: With dead ends: 3535 [2025-03-03 09:44:01,746 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:44:01,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 683 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-03 09:44:01,748 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:44:01,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 571 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:44:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:44:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:44:01,749 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-03 09:44:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:44:01,750 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 342 [2025-03-03 09:44:01,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:44:01,750 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:44:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:44:01,750 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:44:01,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:44:01,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:44:01,759 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-03 09:44:01,953 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-03 09:44:01,955 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-03 09:44:01,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:44:02,945 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:44:02,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:44:02 BoogieIcfgContainer [2025-03-03 09:44:02,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:44:02,968 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:44:02,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:44:02,969 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:44:02,969 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:43:51" (3/4) ... [2025-03-03 09:44:02,970 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:44:02,979 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-03 09:44:02,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:44:02,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:44:02,981 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:44:03,055 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:44:03,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:44:03,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:44:03,058 INFO L158 Benchmark]: Toolchain (without parser) took 12120.06ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 111.6MB in the beginning and 296.7MB in the end (delta: -185.1MB). Peak memory consumption was 187.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:03,059 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:03,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.67ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 96.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 09:44:03,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.67ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:03,059 INFO L158 Benchmark]: Boogie Preprocessor took 26.62ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:44:03,059 INFO L158 Benchmark]: IcfgBuilder took 544.65ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 55.2MB in the end (delta: 36.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 09:44:03,059 INFO L158 Benchmark]: TraceAbstraction took 11171.23ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 54.7MB in the beginning and 305.1MB in the end (delta: -250.4MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. [2025-03-03 09:44:03,060 INFO L158 Benchmark]: Witness Printer took 87.82ms. Allocated memory is still 520.1MB. Free memory was 305.1MB in the beginning and 296.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:44:03,060 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.20ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.67ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 96.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.67ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 93.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.62ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 91.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 544.65ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 55.2MB in the end (delta: 36.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11171.23ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 54.7MB in the beginning and 305.1MB in the end (delta: -250.4MB). Peak memory consumption was 253.5MB. Max. memory is 16.1GB. * Witness Printer took 87.82ms. Allocated memory is still 520.1MB. Free memory was 305.1MB in the beginning and 296.7MB in the end (delta: 8.4MB). 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, 134 locations, 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, 1919 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1919 mSDsluCounter, 10606 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5587 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4370 IncrementalHoareTripleChecker+Invalid, 4739 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 5019 mSDtfsCounter, 4370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3547 GetRequests, 3480 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4822occurred in iteration=19, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 1255 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 7014 NumberOfCodeBlocks, 7014 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8261 ConstructedInterpolants, 0 QuantifiedInterpolants, 11581 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3959 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 25352/25615 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__hit != 0)) && (4416 == s__state)) && (blastFlag <= 4)) || (((s__hit == 0) && (2 == blastFlag)) && (48 == ag_Z))) || ((((s__hit == 0) && (48 == ag_Z)) && (4416 == s__state)) && (blastFlag <= 4))) || ((((4368 == s__state) && (ag_Y <= 208)) && (s__hit != 0)) && (blastFlag == 0))) || ((((s__hit == 0) && (48 == ag_Z)) && (12292 == s__state)) && (blastFlag == 0))) || (((((4352 == s__state) && (3 == s__s3__tmp__next_state___0)) && (ag_Y <= 208)) && (s__hit != 0)) && (blastFlag <= 4))) || ((((ag_Y <= 208) && (4384 == s__state)) && (blastFlag == 1)) && (s__hit != 0))) || ((((s__hit == 0) && (4384 == s__state)) && (blastFlag == 1)) && (48 == ag_Z))) || (((((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))) || (((ag_Y <= 208) && (2 == blastFlag)) && (s__hit != 0))) || ((((s__hit == 0) && (4368 == s__state)) && (48 == ag_Z)) && (blastFlag == 0))) || (((((4432 <= s__state) && (s__hit == 0)) && (48 == ag_Z)) && (s__state <= 4528)) && (blastFlag <= 4))) || (((((4352 == s__state) && (s__hit == 0)) && (48 == ag_Z)) && (4560 == s__s3__tmp__next_state___0)) && (blastFlag <= 4))) || (3 == s__state)) || (((((4432 <= s__state) && (ag_Y <= 208)) && (s__hit != 0)) && (s__state <= 4528)) && (blastFlag <= 4))) || (((s__hit == 0) && (48 == ag_Z)) && (48 == s__state))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:44:03,072 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