./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7385fd88a67a4d51b868c33a4a2a17411348aca1f3bf817148857f9693eef2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:51:26,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:51:26,145 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:51:26,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:51:26,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:51:26,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:51:26,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:51:26,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:51:26,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:51:26,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:51:26,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:51:26,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:51:26,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:51:26,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:51:26,175 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:51:26,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:51:26,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:51:26,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:51:26,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:51:26,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:26,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:26,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:26,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:51:26,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:51:26,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:51:26,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:51:26,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:51:26,178 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-jdk21/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 -> b7385fd88a67a4d51b868c33a4a2a17411348aca1f3bf817148857f9693eef2c [2025-01-08 23:51:26,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:51:26,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:51:26,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:51:26,412 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:51:26,412 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:51:26,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label13.c [2025-01-08 23:51:27,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8dd7acdad/87cdf056b0b0424e854acd2f57b051ea/FLAGc2d5003e1 [2025-01-08 23:51:28,100 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:51:28,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c [2025-01-08 23:51:28,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8dd7acdad/87cdf056b0b0424e854acd2f57b051ea/FLAGc2d5003e1 [2025-01-08 23:51:28,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8dd7acdad/87cdf056b0b0424e854acd2f57b051ea [2025-01-08 23:51:28,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:51:28,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:51:28,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:28,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:51:28,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:51:28,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:28" (1/1) ... [2025-01-08 23:51:28,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e952a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:28, skipping insertion in model container [2025-01-08 23:51:28,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:28" (1/1) ... [2025-01-08 23:51:28,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:51:28,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c[8099,8112] [2025-01-08 23:51:28,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:29,000 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:51:29,022 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label13.c[8099,8112] [2025-01-08 23:51:29,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:29,369 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:51:29,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29 WrapperNode [2025-01-08 23:51:29,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:29,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:29,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:51:29,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:51:29,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:29,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:29,725 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:51:29,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:29,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:51:29,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:51:29,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:51:29,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:29,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:29,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,052 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-01-08 23:51:30,056 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,318 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:51:30,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:51:30,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:51:30,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:51:30,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (1/1) ... [2025-01-08 23:51:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:30,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:30,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:51:30,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:51:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:51:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:51:30,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:51:30,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:51:30,596 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:51:30,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:51:34,608 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:51:34,608 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:51:34,639 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:51:34,639 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:51:34,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:34 BoogieIcfgContainer [2025-01-08 23:51:34,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:51:34,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:51:34,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:51:34,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:51:34,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:51:28" (1/3) ... [2025-01-08 23:51:34,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab7e5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:34, skipping insertion in model container [2025-01-08 23:51:34,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:29" (2/3) ... [2025-01-08 23:51:34,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab7e5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:34, skipping insertion in model container [2025-01-08 23:51:34,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:34" (3/3) ... [2025-01-08 23:51:34,648 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label13.c [2025-01-08 23:51:34,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:51:34,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label13.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:51:34,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:51:34,738 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;@1e2b51cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:51:34,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:51:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-08 23:51:34,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:34,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:34,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:34,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:34,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1361349908, now seen corresponding path program 1 times [2025-01-08 23:51:34,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484207921] [2025-01-08 23:51:34,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:34,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-08 23:51:34,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-08 23:51:34,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:34,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:35,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484207921] [2025-01-08 23:51:35,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484207921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:35,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:35,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41561167] [2025-01-08 23:51:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:35,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:35,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:35,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:35,063 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:38,587 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-01-08 23:51:38,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:38,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-08 23:51:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:38,602 INFO L225 Difference]: With dead ends: 3035 [2025-01-08 23:51:38,602 INFO L226 Difference]: Without dead ends: 1873 [2025-01-08 23:51:38,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:38,608 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 848 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:38,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:51:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-01-08 23:51:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-01-08 23:51:38,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-01-08 23:51:38,681 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 57 [2025-01-08 23:51:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:38,682 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-01-08 23:51:38,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 2 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-01-08 23:51:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-08 23:51:38,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:38,685 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:51:38,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:51:38,685 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:38,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:38,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1823500456, now seen corresponding path program 1 times [2025-01-08 23:51:38,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:38,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774038056] [2025-01-08 23:51:38,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:38,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:38,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-08 23:51:38,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-08 23:51:38,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:38,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:38,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:38,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774038056] [2025-01-08 23:51:38,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774038056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54355089] [2025-01-08 23:51:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:38,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:38,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:38,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:38,920 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:42,626 INFO L93 Difference]: Finished difference Result 5405 states and 8404 transitions. [2025-01-08 23:51:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:42,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-01-08 23:51:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:42,639 INFO L225 Difference]: With dead ends: 5405 [2025-01-08 23:51:42,639 INFO L226 Difference]: Without dead ends: 3548 [2025-01-08 23:51:42,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:42,644 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 862 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:42,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1040 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:51:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-01-08 23:51:42,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3476. [2025-01-08 23:51:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 1.4897841726618706) internal successors, (5177), 3475 states have internal predecessors, (5177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5177 transitions. [2025-01-08 23:51:42,698 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5177 transitions. Word has length 129 [2025-01-08 23:51:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:42,699 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5177 transitions. [2025-01-08 23:51:42,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5177 transitions. [2025-01-08 23:51:42,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-08 23:51:42,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:42,700 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:51:42,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:51:42,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:42,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:42,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2129536945, now seen corresponding path program 1 times [2025-01-08 23:51:42,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:42,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090524945] [2025-01-08 23:51:42,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:42,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:42,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-08 23:51:42,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-08 23:51:42,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:42,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:42,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090524945] [2025-01-08 23:51:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090524945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:42,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344727374] [2025-01-08 23:51:42,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:42,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:42,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:42,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:42,812 INFO L87 Difference]: Start difference. First operand 3476 states and 5177 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:45,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:45,757 INFO L93 Difference]: Finished difference Result 10140 states and 15128 transitions. [2025-01-08 23:51:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:45,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2025-01-08 23:51:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:45,801 INFO L225 Difference]: With dead ends: 10140 [2025-01-08 23:51:45,802 INFO L226 Difference]: Without dead ends: 6666 [2025-01-08 23:51:45,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:45,812 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 964 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:45,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 847 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:51:45,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2025-01-08 23:51:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6659. [2025-01-08 23:51:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6658 states have (on average 1.364373685791529) internal successors, (9084), 6658 states have internal predecessors, (9084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 9084 transitions. [2025-01-08 23:51:46,006 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 9084 transitions. Word has length 143 [2025-01-08 23:51:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:46,007 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 9084 transitions. [2025-01-08 23:51:46,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 9084 transitions. [2025-01-08 23:51:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-08 23:51:46,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:46,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:46,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:51:46,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:46,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash -69814994, now seen corresponding path program 1 times [2025-01-08 23:51:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:46,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326802208] [2025-01-08 23:51:46,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:46,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-08 23:51:46,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-08 23:51:46,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:46,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:46,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:46,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326802208] [2025-01-08 23:51:46,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326802208] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:46,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:46,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:46,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660262181] [2025-01-08 23:51:46,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:46,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:46,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:46,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:46,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:46,405 INFO L87 Difference]: Start difference. First operand 6659 states and 9084 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:48,687 INFO L93 Difference]: Finished difference Result 14110 states and 19030 transitions. [2025-01-08 23:51:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-01-08 23:51:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:48,702 INFO L225 Difference]: With dead ends: 14110 [2025-01-08 23:51:48,702 INFO L226 Difference]: Without dead ends: 7453 [2025-01-08 23:51:48,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:48,708 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 707 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:48,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1176 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-08 23:51:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-01-08 23:51:48,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7446. [2025-01-08 23:51:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7446 states, 7445 states have (on average 1.3305574210879785) internal successors, (9906), 7445 states have internal predecessors, (9906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 9906 transitions. [2025-01-08 23:51:48,786 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 9906 transitions. Word has length 146 [2025-01-08 23:51:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:48,787 INFO L471 AbstractCegarLoop]: Abstraction has 7446 states and 9906 transitions. [2025-01-08 23:51:48,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 9906 transitions. [2025-01-08 23:51:48,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-08 23:51:48,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:48,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:51:48,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:51:48,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:48,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2092037646, now seen corresponding path program 1 times [2025-01-08 23:51:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:48,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154250650] [2025-01-08 23:51:48,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:48,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:48,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-08 23:51:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-08 23:51:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:48,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154250650] [2025-01-08 23:51:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154250650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:48,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:48,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060587061] [2025-01-08 23:51:48,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:48,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:48,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:48,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:48,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:48,906 INFO L87 Difference]: Start difference. First operand 7446 states and 9906 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:51,491 INFO L93 Difference]: Finished difference Result 17275 states and 24000 transitions. [2025-01-08 23:51:51,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:51:51,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2025-01-08 23:51:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:51,512 INFO L225 Difference]: With dead ends: 17275 [2025-01-08 23:51:51,512 INFO L226 Difference]: Without dead ends: 10618 [2025-01-08 23:51:51,516 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-01-08 23:51:51,517 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 900 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 901 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 901 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:51,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 999 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [901 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:51:51,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2025-01-08 23:51:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 10608. [2025-01-08 23:51:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3126237390402564) internal successors, (13923), 10607 states have internal predecessors, (13923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 13923 transitions. [2025-01-08 23:51:51,650 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 13923 transitions. Word has length 153 [2025-01-08 23:51:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:51,651 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 13923 transitions. [2025-01-08 23:51:51,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 13923 transitions. [2025-01-08 23:51:51,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-08 23:51:51,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:51,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:51:51,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:51:51,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:51,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1997112118, now seen corresponding path program 1 times [2025-01-08 23:51:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:51,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344151804] [2025-01-08 23:51:51,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:51,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-08 23:51:51,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-08 23:51:51,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:51,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:51,906 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:51:51,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:51,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344151804] [2025-01-08 23:51:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344151804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:51,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:51,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:51:51,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408066067] [2025-01-08 23:51:51,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:51,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:51:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:51,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:51:51,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:51:51,908 INFO L87 Difference]: Start difference. First operand 10608 states and 13923 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:56,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:51:56,838 INFO L93 Difference]: Finished difference Result 29882 states and 39625 transitions. [2025-01-08 23:51:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:51:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-01-08 23:51:56,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:51:56,873 INFO L225 Difference]: With dead ends: 29882 [2025-01-08 23:51:56,873 INFO L226 Difference]: Without dead ends: 20063 [2025-01-08 23:51:56,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:51:56,881 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 2376 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 4541 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 5334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 4541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:51:56,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1296 Invalid, 5334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 4541 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-01-08 23:51:56,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20063 states. [2025-01-08 23:51:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20063 to 20062. [2025-01-08 23:51:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20062 states, 20061 states have (on average 1.2496884502268082) internal successors, (25070), 20061 states have internal predecessors, (25070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:57,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20062 states to 20062 states and 25070 transitions. [2025-01-08 23:51:57,048 INFO L78 Accepts]: Start accepts. Automaton has 20062 states and 25070 transitions. Word has length 162 [2025-01-08 23:51:57,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:51:57,048 INFO L471 AbstractCegarLoop]: Abstraction has 20062 states and 25070 transitions. [2025-01-08 23:51:57,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:57,049 INFO L276 IsEmpty]: Start isEmpty. Operand 20062 states and 25070 transitions. [2025-01-08 23:51:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-01-08 23:51:57,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:57,051 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:57,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:51:57,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:57,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:57,052 INFO L85 PathProgramCache]: Analyzing trace with hash 899349446, now seen corresponding path program 1 times [2025-01-08 23:51:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:57,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022877972] [2025-01-08 23:51:57,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:57,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:57,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-08 23:51:57,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-08 23:51:57,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:57,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:51:57,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:57,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022877972] [2025-01-08 23:51:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022877972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:57,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:57,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005923340] [2025-01-08 23:51:57,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:57,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:57,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:57,183 INFO L87 Difference]: Start difference. First operand 20062 states and 25070 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:00,733 INFO L93 Difference]: Finished difference Result 55909 states and 70673 transitions. [2025-01-08 23:52:00,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:00,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 238 [2025-01-08 23:52:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:00,783 INFO L225 Difference]: With dead ends: 55909 [2025-01-08 23:52:00,783 INFO L226 Difference]: Without dead ends: 36636 [2025-01-08 23:52:00,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:00,804 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2887 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:00,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 641 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2887 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:52:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36636 states. [2025-01-08 23:52:01,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36636 to 36629. [2025-01-08 23:52:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36629 states, 36628 states have (on average 1.2235175275745331) internal successors, (44815), 36628 states have internal predecessors, (44815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36629 states to 36629 states and 44815 transitions. [2025-01-08 23:52:01,624 INFO L78 Accepts]: Start accepts. Automaton has 36629 states and 44815 transitions. Word has length 238 [2025-01-08 23:52:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:01,627 INFO L471 AbstractCegarLoop]: Abstraction has 36629 states and 44815 transitions. [2025-01-08 23:52:01,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 36629 states and 44815 transitions. [2025-01-08 23:52:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-08 23:52:01,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:01,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:01,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:52:01,639 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -223668965, now seen corresponding path program 1 times [2025-01-08 23:52:01,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:01,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585101590] [2025-01-08 23:52:01,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:01,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:01,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 23:52:01,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 23:52:01,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:01,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:52:02,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:02,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585101590] [2025-01-08 23:52:02,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585101590] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:02,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:02,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658602610] [2025-01-08 23:52:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:02,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:02,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:02,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:02,051 INFO L87 Difference]: Start difference. First operand 36629 states and 44815 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:05,120 INFO L93 Difference]: Finished difference Result 103154 states and 127129 transitions. [2025-01-08 23:52:05,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2025-01-08 23:52:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:05,196 INFO L225 Difference]: With dead ends: 103154 [2025-01-08 23:52:05,196 INFO L226 Difference]: Without dead ends: 67314 [2025-01-08 23:52:05,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:05,227 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 852 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:05,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 995 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:52:05,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67314 states. [2025-01-08 23:52:05,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67314 to 61011. [2025-01-08 23:52:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61011 states, 61010 states have (on average 1.178019996721849) internal successors, (71871), 61010 states have internal predecessors, (71871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:06,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61011 states to 61011 states and 71871 transitions. [2025-01-08 23:52:06,045 INFO L78 Accepts]: Start accepts. Automaton has 61011 states and 71871 transitions. Word has length 287 [2025-01-08 23:52:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:06,047 INFO L471 AbstractCegarLoop]: Abstraction has 61011 states and 71871 transitions. [2025-01-08 23:52:06,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 61011 states and 71871 transitions. [2025-01-08 23:52:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-01-08 23:52:06,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:06,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:06,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:52:06,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:06,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:06,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2090927943, now seen corresponding path program 1 times [2025-01-08 23:52:06,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:06,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363144913] [2025-01-08 23:52:06,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:06,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-01-08 23:52:06,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-01-08 23:52:06,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:06,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-08 23:52:06,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:06,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363144913] [2025-01-08 23:52:06,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363144913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:06,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:06,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:06,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207543291] [2025-01-08 23:52:06,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:06,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:52:06,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:06,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:52:06,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:06,484 INFO L87 Difference]: Start difference. First operand 61011 states and 71871 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:12,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:12,598 INFO L93 Difference]: Finished difference Result 172612 states and 205167 transitions. [2025-01-08 23:52:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:52:12,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 345 [2025-01-08 23:52:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:12,744 INFO L225 Difference]: With dead ends: 172612 [2025-01-08 23:52:12,744 INFO L226 Difference]: Without dead ends: 112390 [2025-01-08 23:52:12,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:12,789 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 1745 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6027 mSolverCounterSat, 1208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 7235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1208 IncrementalHoareTripleChecker+Valid, 6027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:12,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 653 Invalid, 7235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1208 Valid, 6027 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-08 23:52:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112390 states. [2025-01-08 23:52:13,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112390 to 111474. [2025-01-08 23:52:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111474 states, 111473 states have (on average 1.1708844294134007) internal successors, (130522), 111473 states have internal predecessors, (130522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111474 states to 111474 states and 130522 transitions. [2025-01-08 23:52:13,958 INFO L78 Accepts]: Start accepts. Automaton has 111474 states and 130522 transitions. Word has length 345 [2025-01-08 23:52:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 111474 states and 130522 transitions. [2025-01-08 23:52:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 111474 states and 130522 transitions. [2025-01-08 23:52:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-01-08 23:52:13,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:13,962 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-01-08 23:52:13,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:52:13,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:13,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1455997067, now seen corresponding path program 1 times [2025-01-08 23:52:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253357809] [2025-01-08 23:52:13,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:13,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:52:13,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:52:13,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 348 proven. 25 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-08 23:52:14,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253357809] [2025-01-08 23:52:14,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253357809] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:14,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102753596] [2025-01-08 23:52:14,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:14,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:14,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:14,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:14,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:52:14,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-01-08 23:52:14,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-01-08 23:52:14,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:14,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:14,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:14,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-08 23:52:15,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102753596] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:15,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:52:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607977611] [2025-01-08 23:52:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:15,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:15,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:15,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:15,349 INFO L87 Difference]: Start difference. First operand 111474 states and 130522 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:19,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:19,157 INFO L93 Difference]: Finished difference Result 270940 states and 321164 transitions. [2025-01-08 23:52:19,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:19,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 354 [2025-01-08 23:52:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:19,357 INFO L225 Difference]: With dead ends: 270940 [2025-01-08 23:52:19,357 INFO L226 Difference]: Without dead ends: 173646 [2025-01-08 23:52:19,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:19,405 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 736 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:19,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1128 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:52:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173646 states. [2025-01-08 23:52:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173646 to 119308. [2025-01-08 23:52:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119308 states, 119307 states have (on average 1.1508042277485815) internal successors, (137299), 119307 states have internal predecessors, (137299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119308 states to 119308 states and 137299 transitions. [2025-01-08 23:52:20,964 INFO L78 Accepts]: Start accepts. Automaton has 119308 states and 137299 transitions. Word has length 354 [2025-01-08 23:52:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 119308 states and 137299 transitions. [2025-01-08 23:52:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 119308 states and 137299 transitions. [2025-01-08 23:52:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-08 23:52:20,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:20,979 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:52:20,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:21,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 23:52:21,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:21,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:21,184 INFO L85 PathProgramCache]: Analyzing trace with hash -349581927, now seen corresponding path program 1 times [2025-01-08 23:52:21,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:21,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603282616] [2025-01-08 23:52:21,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:21,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:21,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-08 23:52:21,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-08 23:52:21,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:21,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 332 proven. 113 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-08 23:52:22,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:22,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603282616] [2025-01-08 23:52:22,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603282616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617416322] [2025-01-08 23:52:22,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:22,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:22,413 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:22,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:52:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-08 23:52:22,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-08 23:52:22,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:22,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:22,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:22,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-08 23:52:22,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:22,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617416322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:22,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:22,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:52:22,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88945451] [2025-01-08 23:52:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:22,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:22,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:22,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:22,687 INFO L87 Difference]: Start difference. First operand 119308 states and 137299 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:26,053 INFO L93 Difference]: Finished difference Result 237825 states and 273803 transitions. [2025-01-08 23:52:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:26,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 412 [2025-01-08 23:52:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:26,177 INFO L225 Difference]: With dead ends: 237825 [2025-01-08 23:52:26,177 INFO L226 Difference]: Without dead ends: 119306 [2025-01-08 23:52:26,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 411 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:26,229 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1092 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:26,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1440 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:52:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119306 states. [2025-01-08 23:52:27,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119306 to 116944. [2025-01-08 23:52:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116944 states, 116943 states have (on average 1.1097115688839863) internal successors, (129773), 116943 states have internal predecessors, (129773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116944 states to 116944 states and 129773 transitions. [2025-01-08 23:52:27,768 INFO L78 Accepts]: Start accepts. Automaton has 116944 states and 129773 transitions. Word has length 412 [2025-01-08 23:52:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:27,769 INFO L471 AbstractCegarLoop]: Abstraction has 116944 states and 129773 transitions. [2025-01-08 23:52:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 116944 states and 129773 transitions. [2025-01-08 23:52:27,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-08 23:52:27,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:27,778 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:27,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:27,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:27,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:27,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:27,980 INFO L85 PathProgramCache]: Analyzing trace with hash -768413784, now seen corresponding path program 1 times [2025-01-08 23:52:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569628942] [2025-01-08 23:52:27,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:28,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-08 23:52:28,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-08 23:52:28,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:28,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 446 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:52:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569628942] [2025-01-08 23:52:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569628942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:28,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968698954] [2025-01-08 23:52:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:28,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:28,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:28,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:28,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:28,444 INFO L87 Difference]: Start difference. First operand 116944 states and 129773 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:32,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:32,133 INFO L93 Difference]: Finished difference Result 271678 states and 304331 transitions. [2025-01-08 23:52:32,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:32,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 451 [2025-01-08 23:52:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:32,314 INFO L225 Difference]: With dead ends: 271678 [2025-01-08 23:52:32,314 INFO L226 Difference]: Without dead ends: 155523 [2025-01-08 23:52:32,361 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-01-08 23:52:32,362 INFO L435 NwaCegarLoop]: 1808 mSDtfsCounter, 776 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:32,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1959 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-08 23:52:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155523 states. [2025-01-08 23:52:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155523 to 152357. [2025-01-08 23:52:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152357 states, 152356 states have (on average 1.093261834125338) internal successors, (166565), 152356 states have internal predecessors, (166565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:33,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152357 states to 152357 states and 166565 transitions. [2025-01-08 23:52:33,949 INFO L78 Accepts]: Start accepts. Automaton has 152357 states and 166565 transitions. Word has length 451 [2025-01-08 23:52:33,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:33,950 INFO L471 AbstractCegarLoop]: Abstraction has 152357 states and 166565 transitions. [2025-01-08 23:52:33,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 152357 states and 166565 transitions. [2025-01-08 23:52:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-01-08 23:52:33,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:33,958 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2025-01-08 23:52:33,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:52:33,958 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:33,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1735756191, now seen corresponding path program 1 times [2025-01-08 23:52:33,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:33,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492950448] [2025-01-08 23:52:33,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:33,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-01-08 23:52:33,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-01-08 23:52:33,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:33,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:34,330 INFO L134 CoverageAnalysis]: Checked inductivity of 998 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:52:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492950448] [2025-01-08 23:52:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492950448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:34,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436388012] [2025-01-08 23:52:34,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:34,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:34,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:34,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:34,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:34,332 INFO L87 Difference]: Start difference. First operand 152357 states and 166565 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:38,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:38,178 INFO L93 Difference]: Finished difference Result 336205 states and 370648 transitions. [2025-01-08 23:52:38,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:38,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 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 460 [2025-01-08 23:52:38,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:38,595 INFO L225 Difference]: With dead ends: 336205 [2025-01-08 23:52:38,595 INFO L226 Difference]: Without dead ends: 184637 [2025-01-08 23:52:38,658 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-01-08 23:52:38,659 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 956 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 995 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 995 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:38,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 788 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [995 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:52:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184637 states. [2025-01-08 23:52:40,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184637 to 181472. [2025-01-08 23:52:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181472 states, 181471 states have (on average 1.0972607193435866) internal successors, (199121), 181471 states have internal predecessors, (199121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181472 states to 181472 states and 199121 transitions. [2025-01-08 23:52:40,733 INFO L78 Accepts]: Start accepts. Automaton has 181472 states and 199121 transitions. Word has length 460 [2025-01-08 23:52:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:40,733 INFO L471 AbstractCegarLoop]: Abstraction has 181472 states and 199121 transitions. [2025-01-08 23:52:40,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 181472 states and 199121 transitions. [2025-01-08 23:52:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2025-01-08 23:52:40,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:40,746 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:40,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:52:40,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:40,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:40,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1320879769, now seen corresponding path program 1 times [2025-01-08 23:52:40,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:40,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504301469] [2025-01-08 23:52:40,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-08 23:52:40,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-08 23:52:40,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:40,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 274 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-08 23:52:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504301469] [2025-01-08 23:52:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504301469] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916665572] [2025-01-08 23:52:41,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:41,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:41,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:41,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:52:41,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:52:41,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 522 statements into 1 equivalence classes. [2025-01-08 23:52:41,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 522 of 522 statements. [2025-01-08 23:52:41,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:41,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:41,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:41,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-01-08 23:52:42,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:42,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916665572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:42,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:42,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:52:42,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248141745] [2025-01-08 23:52:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:42,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:42,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:42,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:42,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:42,664 INFO L87 Difference]: Start difference. First operand 181472 states and 199121 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:45,805 INFO L93 Difference]: Finished difference Result 366104 states and 401577 transitions. [2025-01-08 23:52:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:45,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 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 522 [2025-01-08 23:52:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:46,017 INFO L225 Difference]: With dead ends: 366104 [2025-01-08 23:52:46,018 INFO L226 Difference]: Without dead ends: 185421 [2025-01-08 23:52:46,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:52:46,117 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 547 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:46,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1179 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:52:46,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185421 states. [2025-01-08 23:52:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185421 to 183050. [2025-01-08 23:52:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183050 states, 183049 states have (on average 1.0969412561663816) internal successors, (200794), 183049 states have internal predecessors, (200794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183050 states to 183050 states and 200794 transitions. [2025-01-08 23:52:48,019 INFO L78 Accepts]: Start accepts. Automaton has 183050 states and 200794 transitions. Word has length 522 [2025-01-08 23:52:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:48,019 INFO L471 AbstractCegarLoop]: Abstraction has 183050 states and 200794 transitions. [2025-01-08 23:52:48,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 183050 states and 200794 transitions. [2025-01-08 23:52:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-01-08 23:52:48,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:48,032 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:48,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:48,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:48,234 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:48,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash -191772033, now seen corresponding path program 1 times [2025-01-08 23:52:48,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:48,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164573289] [2025-01-08 23:52:48,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:48,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:48,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-01-08 23:52:48,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-01-08 23:52:48,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:48,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-01-08 23:52:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164573289] [2025-01-08 23:52:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164573289] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:48,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611793165] [2025-01-08 23:52:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:48,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:48,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:48,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:48,711 INFO L87 Difference]: Start difference. First operand 183050 states and 200794 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:50,855 INFO L93 Difference]: Finished difference Result 362933 states and 397851 transitions. [2025-01-08 23:52:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:50,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 542 [2025-01-08 23:52:50,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:51,061 INFO L225 Difference]: With dead ends: 362933 [2025-01-08 23:52:51,061 INFO L226 Difference]: Without dead ends: 180672 [2025-01-08 23:52:51,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:51,128 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1665 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1515 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1665 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:51,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1665 Valid, 314 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1515 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-08 23:52:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180672 states. [2025-01-08 23:52:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180672 to 180671. [2025-01-08 23:52:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180671 states, 180670 states have (on average 1.0949853323739414) internal successors, (197831), 180670 states have internal predecessors, (197831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180671 states to 180671 states and 197831 transitions. [2025-01-08 23:52:53,311 INFO L78 Accepts]: Start accepts. Automaton has 180671 states and 197831 transitions. Word has length 542 [2025-01-08 23:52:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:53,312 INFO L471 AbstractCegarLoop]: Abstraction has 180671 states and 197831 transitions. [2025-01-08 23:52:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 180671 states and 197831 transitions. [2025-01-08 23:52:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-01-08 23:52:53,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:53,327 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-08 23:52:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:52:53,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:53,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:53,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1286915216, now seen corresponding path program 1 times [2025-01-08 23:52:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575401165] [2025-01-08 23:52:53,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:53,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-01-08 23:52:53,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-01-08 23:52:53,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:53,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-08 23:52:53,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:53,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575401165] [2025-01-08 23:52:53,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575401165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:53,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:53,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:53,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072201307] [2025-01-08 23:52:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:53,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:53,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:53,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:53,510 INFO L87 Difference]: Start difference. First operand 180671 states and 197831 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)