./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label50.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_label50.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 c0a29c0650858169a7f06788e2d55d3441e7b25ce879ddd70ee1db162c004af4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:55:35,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:55:35,235 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:55:35,240 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:55:35,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:55:35,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:55:35,264 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:55:35,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:55:35,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:55:35,265 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:55:35,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:55:35,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:55:35,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:55:35,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:55:35,267 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:55:35,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:55:35,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:55:35,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:55:35,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:55:35,268 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 -> c0a29c0650858169a7f06788e2d55d3441e7b25ce879ddd70ee1db162c004af4 [2025-01-08 23:55:35,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:55:35,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:55:35,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:55:35,480 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:55:35,481 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:55:35,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label50.c [2025-01-08 23:55:36,606 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4567ccf99/1f0daa9a27de4a7588148c03b7a786f6/FLAG56ac8fd27 [2025-01-08 23:55:37,088 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:55:37,088 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label50.c [2025-01-08 23:55:37,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4567ccf99/1f0daa9a27de4a7588148c03b7a786f6/FLAG56ac8fd27 [2025-01-08 23:55:37,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4567ccf99/1f0daa9a27de4a7588148c03b7a786f6 [2025-01-08 23:55:37,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:55:37,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:55:37,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:55:37,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:55:37,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:55:37,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:55:37" (1/1) ... [2025-01-08 23:55:37,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4259f1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:37, skipping insertion in model container [2025-01-08 23:55:37,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:55:37" (1/1) ... [2025-01-08 23:55:37,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:55:37,451 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_label50.c[8814,8827] [2025-01-08 23:55:37,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:55:37,930 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:55:37,946 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_label50.c[8814,8827] [2025-01-08 23:55:38,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:55:38,270 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:55:38,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38 WrapperNode [2025-01-08 23:55:38,272 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:55:38,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:55:38,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:55:38,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:55:38,279 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:55:38" (1/1) ... [2025-01-08 23:55:38,329 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:55:38" (1/1) ... [2025-01-08 23:55:38,665 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:55:38,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:55:38,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:55:38,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:55:38,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:55:38,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:38,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:38,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:38,996 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:55:38,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:38,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:55:39,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:55:39,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:55:39,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:55:39,258 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (1/1) ... [2025-01-08 23:55:39,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:55:39,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:39,283 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:55:39,285 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:55:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:55:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:55:39,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:55:39,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:55:39,354 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:55:39,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:55:43,648 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:55:43,649 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:55:43,676 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:55:43,677 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:55:43,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:55:43 BoogieIcfgContainer [2025-01-08 23:55:43,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:55:43,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:55:43,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:55:43,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:55:43,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:55:37" (1/3) ... [2025-01-08 23:55:43,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761ecc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:55:43, skipping insertion in model container [2025-01-08 23:55:43,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:55:38" (2/3) ... [2025-01-08 23:55:43,685 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761ecc26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:55:43, skipping insertion in model container [2025-01-08 23:55:43,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:55:43" (3/3) ... [2025-01-08 23:55:43,686 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label50.c [2025-01-08 23:55:43,697 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:55:43,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label50.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:55:43,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:55:43,770 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;@2ddbea05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:55:43,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:55:43,775 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:55:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-08 23:55:43,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:43,781 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, 1, 1, 1, 1, 1] [2025-01-08 23:55:43,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:43,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2137131158, now seen corresponding path program 1 times [2025-01-08 23:55:43,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:43,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807846625] [2025-01-08 23:55:43,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:43,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-08 23:55:43,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-08 23:55:43,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:43,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:44,301 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:55:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807846625] [2025-01-08 23:55:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807846625] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:44,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086271578] [2025-01-08 23:55:44,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:44,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:44,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:44,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:44,327 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 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:55:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:49,616 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-01-08 23:55:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-01-08 23:55:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:49,639 INFO L225 Difference]: With dead ends: 3829 [2025-01-08 23:55:49,639 INFO L226 Difference]: Without dead ends: 2664 [2025-01-08 23:55:49,644 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:55:49,646 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 2669 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2669 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:49,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2669 Valid, 1059 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-01-08 23:55:49,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-01-08 23:55:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-01-08 23:55:49,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 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:55:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-01-08 23:55:49,761 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 62 [2025-01-08 23:55:49,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:49,761 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-01-08 23:55:49,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:55:49,762 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-01-08 23:55:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-08 23:55:49,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:49,767 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:49,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:55:49,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:49,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 16759728, now seen corresponding path program 1 times [2025-01-08 23:55:49,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:49,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406073845] [2025-01-08 23:55:49,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-08 23:55:49,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-08 23:55:49,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:49,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:55:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406073845] [2025-01-08 23:55:50,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406073845] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:50,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048866156] [2025-01-08 23:55:50,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:50,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:50,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:50,405 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:55:50,408 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:55:50,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-08 23:55:50,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-08 23:55:50,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:50,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:50,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:55:50,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:50,719 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-01-08 23:55:50,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048866156] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:50,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:55:50,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936031275] [2025-01-08 23:55:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:50,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:50,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:50,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:55:50,724 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 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:55:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:53,615 INFO L93 Difference]: Finished difference Result 6142 states and 9712 transitions. [2025-01-08 23:55:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:53,615 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 187 [2025-01-08 23:55:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:53,628 INFO L225 Difference]: With dead ends: 6142 [2025-01-08 23:55:53,628 INFO L226 Difference]: Without dead ends: 4268 [2025-01-08 23:55:53,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:55:53,631 INFO L435 NwaCegarLoop]: 1040 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:53,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1189 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:55:53,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-01-08 23:55:53,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4254. [2025-01-08 23:55:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4253 states have (on average 1.3515165765342112) internal successors, (5748), 4253 states have internal predecessors, (5748), 0 states have call successors, (0), 0 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:55:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5748 transitions. [2025-01-08 23:55:53,687 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5748 transitions. Word has length 187 [2025-01-08 23:55:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:53,687 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 5748 transitions. [2025-01-08 23:55:53,687 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:55:53,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5748 transitions. [2025-01-08 23:55:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-08 23:55:53,690 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:53,690 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:53,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:55:53,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:53,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:53,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash -461941155, now seen corresponding path program 1 times [2025-01-08 23:55:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:53,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260484591] [2025-01-08 23:55:53,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:53,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 23:55:53,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 23:55:53,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:53,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:55:54,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:54,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260484591] [2025-01-08 23:55:54,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260484591] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:54,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:54,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:54,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832744422] [2025-01-08 23:55:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:54,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:54,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:54,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:54,058 INFO L87 Difference]: Start difference. First operand 4254 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:55:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:56,765 INFO L93 Difference]: Finished difference Result 10899 states and 15275 transitions. [2025-01-08 23:55:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:56,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-01-08 23:55:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:56,785 INFO L225 Difference]: With dead ends: 10899 [2025-01-08 23:55:56,785 INFO L226 Difference]: Without dead ends: 7434 [2025-01-08 23:55:56,790 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:55:56,791 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 906 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:56,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 956 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:55:56,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2025-01-08 23:55:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 7426. [2025-01-08 23:55:56,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7425 states have (on average 1.288888888888889) internal successors, (9570), 7425 states have internal predecessors, (9570), 0 states have call successors, (0), 0 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:55:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9570 transitions. [2025-01-08 23:55:56,889 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9570 transitions. Word has length 229 [2025-01-08 23:55:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:56,890 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 9570 transitions. [2025-01-08 23:55:56,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:55:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9570 transitions. [2025-01-08 23:55:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 23:55:56,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:56,892 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:56,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:55:56,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:56,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 255196602, now seen corresponding path program 1 times [2025-01-08 23:55:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:56,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745439315] [2025-01-08 23:55:56,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:56,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:55:56,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:55:56,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:56,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:55:57,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:57,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745439315] [2025-01-08 23:55:57,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745439315] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:57,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174299365] [2025-01-08 23:55:57,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:57,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:57,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:57,039 INFO L87 Difference]: Start difference. First operand 7426 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:55:59,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:59,614 INFO L93 Difference]: Finished difference Result 19621 states and 25905 transitions. [2025-01-08 23:55:59,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 243 [2025-01-08 23:55:59,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:59,645 INFO L225 Difference]: With dead ends: 19621 [2025-01-08 23:55:59,645 INFO L226 Difference]: Without dead ends: 12984 [2025-01-08 23:55:59,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:59,653 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:59,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 642 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:55:59,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12984 states. [2025-01-08 23:55:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12984 to 12975. [2025-01-08 23:55:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 12974 states have (on average 1.2720826267920455) internal successors, (16504), 12974 states have internal predecessors, (16504), 0 states have call successors, (0), 0 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:55:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 16504 transitions. [2025-01-08 23:55:59,827 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 16504 transitions. Word has length 243 [2025-01-08 23:55:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 16504 transitions. [2025-01-08 23:55:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 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:55:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 16504 transitions. [2025-01-08 23:55:59,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-01-08 23:55:59,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:59,834 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:59,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:55:59,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:59,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1869538277, now seen corresponding path program 1 times [2025-01-08 23:55:59,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:59,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103226971] [2025-01-08 23:55:59,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:59,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:59,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-01-08 23:55:59,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-01-08 23:55:59,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:59,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:00,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:00,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103226971] [2025-01-08 23:56:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103226971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158545626] [2025-01-08 23:56:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:00,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:56:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:00,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:56:00,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:56:00,005 INFO L87 Difference]: Start difference. First operand 12975 states and 16504 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:56:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:06,020 INFO L93 Difference]: Finished difference Result 45028 states and 58441 transitions. [2025-01-08 23:56:06,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:56:06,021 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-01-08 23:56:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:06,074 INFO L225 Difference]: With dead ends: 45028 [2025-01-08 23:56:06,074 INFO L226 Difference]: Without dead ends: 32842 [2025-01-08 23:56:06,086 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:56:06,087 INFO L435 NwaCegarLoop]: 977 mSDtfsCounter, 1605 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 7395 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1605 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 8007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 7395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:06,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1605 Valid, 1267 Invalid, 8007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [612 Valid, 7395 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-01-08 23:56:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32842 states. [2025-01-08 23:56:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32842 to 32694. [2025-01-08 23:56:06,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32694 states, 32693 states have (on average 1.230630410179549) internal successors, (40233), 32693 states have internal predecessors, (40233), 0 states have call successors, (0), 0 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:56:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 40233 transitions. [2025-01-08 23:56:06,437 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 40233 transitions. Word has length 259 [2025-01-08 23:56:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:06,438 INFO L471 AbstractCegarLoop]: Abstraction has 32694 states and 40233 transitions. [2025-01-08 23:56:06,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:56:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 40233 transitions. [2025-01-08 23:56:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-01-08 23:56:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:06,443 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:56:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:56:06,443 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:06,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:06,444 INFO L85 PathProgramCache]: Analyzing trace with hash 240030989, now seen corresponding path program 1 times [2025-01-08 23:56:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791905184] [2025-01-08 23:56:06,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:06,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-01-08 23:56:06,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-01-08 23:56:06,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:06,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:56:06,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:06,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791905184] [2025-01-08 23:56:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791905184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:06,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527851477] [2025-01-08 23:56:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:06,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:06,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:06,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:06,581 INFO L87 Difference]: Start difference. First operand 32694 states and 40233 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:56:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:09,377 INFO L93 Difference]: Finished difference Result 79567 states and 100187 transitions. [2025-01-08 23:56:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:09,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 261 [2025-01-08 23:56:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:09,441 INFO L225 Difference]: With dead ends: 79567 [2025-01-08 23:56:09,441 INFO L226 Difference]: Without dead ends: 47662 [2025-01-08 23:56:09,465 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:56:09,466 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 837 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2427 mSolverCounterSat, 884 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 884 IncrementalHoareTripleChecker+Valid, 2427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:09,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1038 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [884 Valid, 2427 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:56:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47662 states. [2025-01-08 23:56:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47662 to 47652. [2025-01-08 23:56:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47652 states, 47651 states have (on average 1.2129021426622737) internal successors, (57796), 47651 states have internal predecessors, (57796), 0 states have call successors, (0), 0 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:56:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47652 states to 47652 states and 57796 transitions. [2025-01-08 23:56:09,882 INFO L78 Accepts]: Start accepts. Automaton has 47652 states and 57796 transitions. Word has length 261 [2025-01-08 23:56:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:09,883 INFO L471 AbstractCegarLoop]: Abstraction has 47652 states and 57796 transitions. [2025-01-08 23:56:09,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:56:09,884 INFO L276 IsEmpty]: Start isEmpty. Operand 47652 states and 57796 transitions. [2025-01-08 23:56:09,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-08 23:56:09,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:09,887 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, 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, 1, 1, 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:56:09,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:56:09,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:09,888 INFO L85 PathProgramCache]: Analyzing trace with hash -50270365, now seen corresponding path program 1 times [2025-01-08 23:56:09,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:09,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124976885] [2025-01-08 23:56:09,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:09,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-08 23:56:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-08 23:56:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:09,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:56:10,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:10,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124976885] [2025-01-08 23:56:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124976885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:56:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316793364] [2025-01-08 23:56:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:10,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:10,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:10,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:10,068 INFO L87 Difference]: Start difference. First operand 47652 states and 57796 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:56:13,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:13,274 INFO L93 Difference]: Finished difference Result 126774 states and 155036 transitions. [2025-01-08 23:56:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:13,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 292 [2025-01-08 23:56:13,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:13,370 INFO L225 Difference]: With dead ends: 126774 [2025-01-08 23:56:13,371 INFO L226 Difference]: Without dead ends: 79911 [2025-01-08 23:56:13,408 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:56:13,409 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 853 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 994 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.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:13,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 994 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:56:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79911 states. [2025-01-08 23:56:14,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79911 to 74397. [2025-01-08 23:56:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74397 states, 74396 states have (on average 1.1730066132587773) internal successors, (87267), 74396 states have internal predecessors, (87267), 0 states have call successors, (0), 0 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:56:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74397 states to 74397 states and 87267 transitions. [2025-01-08 23:56:14,285 INFO L78 Accepts]: Start accepts. Automaton has 74397 states and 87267 transitions. Word has length 292 [2025-01-08 23:56:14,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:14,286 INFO L471 AbstractCegarLoop]: Abstraction has 74397 states and 87267 transitions. [2025-01-08 23:56:14,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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:56:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 74397 states and 87267 transitions. [2025-01-08 23:56:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-08 23:56:14,293 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:14,293 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:56:14,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:56:14,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:14,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:14,294 INFO L85 PathProgramCache]: Analyzing trace with hash -897840504, now seen corresponding path program 1 times [2025-01-08 23:56:14,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:14,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357101802] [2025-01-08 23:56:14,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:14,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:14,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-08 23:56:14,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-08 23:56:14,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:56:14,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:14,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357101802] [2025-01-08 23:56:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357101802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:14,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:14,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:14,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194924293] [2025-01-08 23:56:14,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:14,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:14,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:14,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:14,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:14,501 INFO L87 Difference]: Start difference. First operand 74397 states and 87267 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:56:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:17,512 INFO L93 Difference]: Finished difference Result 169263 states and 201386 transitions. [2025-01-08 23:56:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 350 [2025-01-08 23:56:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:17,622 INFO L225 Difference]: With dead ends: 169263 [2025-01-08 23:56:17,622 INFO L226 Difference]: Without dead ends: 95655 [2025-01-08 23:56:17,665 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:56:17,665 INFO L435 NwaCegarLoop]: 1793 mSDtfsCounter, 808 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:17,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1944 Invalid, 3264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:56:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95655 states. [2025-01-08 23:56:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95655 to 94862. [2025-01-08 23:56:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94862 states, 94861 states have (on average 1.1516745554021146) internal successors, (109249), 94861 states have internal predecessors, (109249), 0 states have call successors, (0), 0 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:56:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94862 states to 94862 states and 109249 transitions. [2025-01-08 23:56:18,645 INFO L78 Accepts]: Start accepts. Automaton has 94862 states and 109249 transitions. Word has length 350 [2025-01-08 23:56:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:18,645 INFO L471 AbstractCegarLoop]: Abstraction has 94862 states and 109249 transitions. [2025-01-08 23:56:18,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:56:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 94862 states and 109249 transitions. [2025-01-08 23:56:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-08 23:56:18,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:18,651 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:56:18,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:56:18,651 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:18,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:18,651 INFO L85 PathProgramCache]: Analyzing trace with hash 791566505, now seen corresponding path program 1 times [2025-01-08 23:56:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:18,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274057745] [2025-01-08 23:56:18,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-08 23:56:18,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-08 23:56:18,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:18,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 409 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-08 23:56:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:18,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274057745] [2025-01-08 23:56:18,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274057745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:18,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:18,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:18,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071139290] [2025-01-08 23:56:18,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:18,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:56:18,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:18,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:56:18,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:56:18,816 INFO L87 Difference]: Start difference. First operand 94862 states and 109249 transitions. Second operand has 4 states, 4 states have (on average 75.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:56:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:24,513 INFO L93 Difference]: Finished difference Result 253700 states and 294030 transitions. [2025-01-08 23:56:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:56:24,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.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 359 [2025-01-08 23:56:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:24,723 INFO L225 Difference]: With dead ends: 253700 [2025-01-08 23:56:24,724 INFO L226 Difference]: Without dead ends: 159627 [2025-01-08 23:56:24,787 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:56:24,788 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1735 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 6587 mSolverCounterSat, 1152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1735 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 7739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1152 IncrementalHoareTripleChecker+Valid, 6587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:24,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1735 Valid, 664 Invalid, 7739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1152 Valid, 6587 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-08 23:56:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159627 states. [2025-01-08 23:56:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159627 to 158701. [2025-01-08 23:56:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158701 states, 158700 states have (on average 1.147019533711405) internal successors, (182032), 158700 states have internal predecessors, (182032), 0 states have call successors, (0), 0 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:56:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158701 states to 158701 states and 182032 transitions. [2025-01-08 23:56:26,463 INFO L78 Accepts]: Start accepts. Automaton has 158701 states and 182032 transitions. Word has length 359 [2025-01-08 23:56:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 158701 states and 182032 transitions. [2025-01-08 23:56:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.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:56:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 158701 states and 182032 transitions. [2025-01-08 23:56:26,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-08 23:56:26,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:26,467 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:56:26,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:56:26,467 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:26,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:26,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1969983478, now seen corresponding path program 1 times [2025-01-08 23:56:26,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:26,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730306252] [2025-01-08 23:56:26,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:26,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:26,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-08 23:56:26,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-08 23:56:26,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:26,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 358 proven. 25 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-08 23:56:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730306252] [2025-01-08 23:56:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730306252] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446879824] [2025-01-08 23:56:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:27,392 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:56:27,394 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:56:27,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-08 23:56:27,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-08 23:56:27,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:27,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:27,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:56:27,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-08 23:56:27,776 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:27,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446879824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:27,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:27,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:56:27,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441807652] [2025-01-08 23:56:27,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:27,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:27,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:27,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:27,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:56:27,778 INFO L87 Difference]: Start difference. First operand 158701 states and 182032 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:56:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:31,901 INFO L93 Difference]: Finished difference Result 373265 states and 432926 transitions. [2025-01-08 23:56:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:31,901 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 359 [2025-01-08 23:56:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:32,192 INFO L225 Difference]: With dead ends: 373265 [2025-01-08 23:56:32,192 INFO L226 Difference]: Without dead ends: 232679 [2025-01-08 23:56:32,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 358 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:56:32,240 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 738 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 3221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:32,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1123 Invalid, 3221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:56:32,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232679 states. [2025-01-08 23:56:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232679 to 163382. [2025-01-08 23:56:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163382 states, 163381 states have (on average 1.1255164309191399) internal successors, (183888), 163381 states have internal predecessors, (183888), 0 states have call successors, (0), 0 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:56:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163382 states to 163382 states and 183888 transitions. [2025-01-08 23:56:34,319 INFO L78 Accepts]: Start accepts. Automaton has 163382 states and 183888 transitions. Word has length 359 [2025-01-08 23:56:34,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:34,319 INFO L471 AbstractCegarLoop]: Abstraction has 163382 states and 183888 transitions. [2025-01-08 23:56:34,320 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:56:34,320 INFO L276 IsEmpty]: Start isEmpty. Operand 163382 states and 183888 transitions. [2025-01-08 23:56:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2025-01-08 23:56:34,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:34,326 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2025-01-08 23:56:34,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:56:34,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:34,526 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 955227057, now seen corresponding path program 1 times [2025-01-08 23:56:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:34,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110725601] [2025-01-08 23:56:34,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:34,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-08 23:56:34,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-08 23:56:34,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:34,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 288 proven. 113 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-01-08 23:56:35,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110725601] [2025-01-08 23:56:35,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110725601] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:56:35,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816532098] [2025-01-08 23:56:35,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:35,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:35,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:56:35,639 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:56:35,640 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:56:35,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 388 statements into 1 equivalence classes. [2025-01-08 23:56:35,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 388 of 388 statements. [2025-01-08 23:56:35,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:35,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:35,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:56:35,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:56:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-08 23:56:35,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:56:35,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816532098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:35,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:56:35,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:56:35,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303661434] [2025-01-08 23:56:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:35,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:35,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:35,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:35,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:56:35,874 INFO L87 Difference]: Start difference. First operand 163382 states and 183888 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:56:38,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:38,880 INFO L93 Difference]: Finished difference Result 325973 states and 366981 transitions. [2025-01-08 23:56:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:38,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 388 [2025-01-08 23:56:38,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:39,311 INFO L225 Difference]: With dead ends: 325973 [2025-01-08 23:56:39,311 INFO L226 Difference]: Without dead ends: 163380 [2025-01-08 23:56:39,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:56:39,374 INFO L435 NwaCegarLoop]: 1356 mSDtfsCounter, 1120 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2465 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:39,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 1436 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2465 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:56:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163380 states. [2025-01-08 23:56:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163380 to 161018. [2025-01-08 23:56:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161018 states, 161017 states have (on average 1.090866181831732) internal successors, (175648), 161017 states have internal predecessors, (175648), 0 states have call successors, (0), 0 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:56:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161018 states to 161018 states and 175648 transitions. [2025-01-08 23:56:41,067 INFO L78 Accepts]: Start accepts. Automaton has 161018 states and 175648 transitions. Word has length 388 [2025-01-08 23:56:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:41,068 INFO L471 AbstractCegarLoop]: Abstraction has 161018 states and 175648 transitions. [2025-01-08 23:56:41,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:56:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 161018 states and 175648 transitions. [2025-01-08 23:56:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-01-08 23:56:41,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:41,078 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, 5, 5, 5, 5, 5, 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:56:41,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:56:41,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:56:41,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:41,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:41,279 INFO L85 PathProgramCache]: Analyzing trace with hash 774638708, now seen corresponding path program 1 times [2025-01-08 23:56:41,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373402695] [2025-01-08 23:56:41,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:41,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:41,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-01-08 23:56:41,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-01-08 23:56:41,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:41,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:56:41,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:41,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373402695] [2025-01-08 23:56:41,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373402695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:41,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264011961] [2025-01-08 23:56:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:41,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:41,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:41,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:41,767 INFO L87 Difference]: Start difference. First operand 161018 states and 175648 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:56:45,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:45,084 INFO L93 Difference]: Finished difference Result 348807 states and 383153 transitions. [2025-01-08 23:56:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:45,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 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 456 [2025-01-08 23:56:45,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:45,297 INFO L225 Difference]: With dead ends: 348807 [2025-01-08 23:56:45,297 INFO L226 Difference]: Without dead ends: 188578 [2025-01-08 23:56:45,376 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:56:45,376 INFO L435 NwaCegarLoop]: 1782 mSDtfsCounter, 781 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 3259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:45,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1934 Invalid, 3259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [710 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:56:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188578 states. [2025-01-08 23:56:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188578 to 181475. [2025-01-08 23:56:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181475 states, 181474 states have (on average 1.0783748636168267) internal successors, (195697), 181474 states have internal predecessors, (195697), 0 states have call successors, (0), 0 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:56:47,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181475 states to 181475 states and 195697 transitions. [2025-01-08 23:56:47,465 INFO L78 Accepts]: Start accepts. Automaton has 181475 states and 195697 transitions. Word has length 456 [2025-01-08 23:56:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:47,466 INFO L471 AbstractCegarLoop]: Abstraction has 181475 states and 195697 transitions. [2025-01-08 23:56:47,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 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:56:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 181475 states and 195697 transitions. [2025-01-08 23:56:47,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-01-08 23:56:47,477 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:47,477 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:47,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:56:47,477 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:47,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1514717642, now seen corresponding path program 1 times [2025-01-08 23:56:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:47,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072109673] [2025-01-08 23:56:47,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:47,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-01-08 23:56:47,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-01-08 23:56:47,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:47,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-08 23:56:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072109673] [2025-01-08 23:56:47,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072109673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:47,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:47,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341546959] [2025-01-08 23:56:47,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:47,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:47,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:47,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:47,833 INFO L87 Difference]: Start difference. First operand 181475 states and 195697 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:56:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:52,339 INFO L93 Difference]: Finished difference Result 436286 states and 470984 transitions. [2025-01-08 23:56:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 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 466 [2025-01-08 23:56:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:52,676 INFO L225 Difference]: With dead ends: 436286 [2025-01-08 23:56:52,676 INFO L226 Difference]: Without dead ends: 255600 [2025-01-08 23:56:52,768 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:56:52,769 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 961 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3065 mSolverCounterSat, 677 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 3742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 677 IncrementalHoareTripleChecker+Valid, 3065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:52,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 548 Invalid, 3742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [677 Valid, 3065 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:56:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255600 states. [2025-01-08 23:56:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255600 to 239753. [2025-01-08 23:56:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239753 states, 239752 states have (on average 1.0815008842470553) internal successors, (259292), 239752 states have internal predecessors, (259292), 0 states have call successors, (0), 0 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:56:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239753 states to 239753 states and 259292 transitions. [2025-01-08 23:56:55,545 INFO L78 Accepts]: Start accepts. Automaton has 239753 states and 259292 transitions. Word has length 466 [2025-01-08 23:56:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:56:55,546 INFO L471 AbstractCegarLoop]: Abstraction has 239753 states and 259292 transitions. [2025-01-08 23:56:55,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:56:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 239753 states and 259292 transitions. [2025-01-08 23:56:55,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-08 23:56:55,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:56:55,564 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, 6, 6, 6, 6, 6, 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] [2025-01-08 23:56:55,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:56:55,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:56:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:56:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 265742452, now seen corresponding path program 1 times [2025-01-08 23:56:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:56:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831149822] [2025-01-08 23:56:55,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:56:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:56:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-08 23:56:55,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-08 23:56:55,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:56:55,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:56:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:56:56,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:56:56,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831149822] [2025-01-08 23:56:56,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831149822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:56:56,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:56:56,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:56:56,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968726573] [2025-01-08 23:56:56,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:56:56,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:56:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:56:56,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:56:56,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:56:56,105 INFO L87 Difference]: Start difference. First operand 239753 states and 259292 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 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:56:59,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:56:59,451 INFO L93 Difference]: Finished difference Result 477936 states and 516990 transitions. [2025-01-08 23:56:59,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:56:59,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 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 519 [2025-01-08 23:56:59,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:56:59,792 INFO L225 Difference]: With dead ends: 477936 [2025-01-08 23:56:59,792 INFO L226 Difference]: Without dead ends: 238972 [2025-01-08 23:56:59,909 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:56:59,910 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 926 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 3090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:56:59,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 696 Invalid, 3090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:57:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238972 states.