./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label39.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/Problem12_label39.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 ac1b1988d7562356ff82123079a37b8cde9200cfd597bb0905605a20cdbc8694 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:47:45,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:47:45,075 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:47:45,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:47:45,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:47:45,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:47:45,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:47:45,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:47:45,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:47:45,101 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:47:45,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:47:45,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:47:45,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:47:45,103 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:47:45,103 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:47:45,104 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:47:45,104 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:47:45,104 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:47:45,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:47:45,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:47:45,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:47:45,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:47:45,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:47:45,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:47:45,107 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:47:45,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:47:45,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:47:45,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:47:45,108 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 -> ac1b1988d7562356ff82123079a37b8cde9200cfd597bb0905605a20cdbc8694 [2025-01-08 23:47:45,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:47:45,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:47:45,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:47:45,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:47:45,381 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:47:45,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label39.c [2025-01-08 23:47:46,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e47a7fed/583c205c52f64a83a4116268cb187cb2/FLAGc82bfbc76 [2025-01-08 23:47:47,272 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:47:47,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label39.c [2025-01-08 23:47:47,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e47a7fed/583c205c52f64a83a4116268cb187cb2/FLAGc82bfbc76 [2025-01-08 23:47:47,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e47a7fed/583c205c52f64a83a4116268cb187cb2 [2025-01-08 23:47:47,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:47:47,332 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:47:47,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:47:47,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:47:47,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:47:47,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:47:47" (1/1) ... [2025-01-08 23:47:47,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@329ee5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:47, skipping insertion in model container [2025-01-08 23:47:47,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:47:47" (1/1) ... [2025-01-08 23:47:47,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:47:47,607 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/Problem12_label39.c[2950,2963] [2025-01-08 23:47:48,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:47:48,180 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:47:48,204 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/Problem12_label39.c[2950,2963] [2025-01-08 23:47:48,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:47:48,550 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:47:48,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48 WrapperNode [2025-01-08 23:47:48,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:47:48,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:47:48,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:47:48,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:47:48,561 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:47:48" (1/1) ... [2025-01-08 23:47:48,602 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:47:48" (1/1) ... [2025-01-08 23:47:48,870 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-01-08 23:47:48,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:47:48,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:47:48,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:47:48,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:47:48,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:48,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:48,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,073 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:47:49,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,227 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:47:49,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:47:49,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:47:49,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:47:49,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (1/1) ... [2025-01-08 23:47:49,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:47:49,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:47:49,383 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:47:49,385 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:47:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:47:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:47:49,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:47:49,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:47:49,478 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:47:49,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:47:53,734 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-01-08 23:47:53,735 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:47:53,777 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:47:53,778 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:47:53,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:47:53 BoogieIcfgContainer [2025-01-08 23:47:53,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:47:53,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:47:53,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:47:53,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:47:53,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:47:47" (1/3) ... [2025-01-08 23:47:53,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e92a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:47:53, skipping insertion in model container [2025-01-08 23:47:53,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:47:48" (2/3) ... [2025-01-08 23:47:53,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e92a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:47:53, skipping insertion in model container [2025-01-08 23:47:53,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:47:53" (3/3) ... [2025-01-08 23:47:53,789 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label39.c [2025-01-08 23:47:53,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:47:53,805 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label39.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:47:53,884 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:47:53,894 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;@4f5a2e7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:47:53,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:47:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 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:47:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 23:47:53,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:53,909 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] [2025-01-08 23:47:53,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:53,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:53,915 INFO L85 PathProgramCache]: Analyzing trace with hash 2130108164, now seen corresponding path program 1 times [2025-01-08 23:47:53,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:53,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236883407] [2025-01-08 23:47:53,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:53,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:53,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 23:47:54,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 23:47:54,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:54,156 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:47:54,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:54,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236883407] [2025-01-08 23:47:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236883407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:54,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:54,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:54,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421045557] [2025-01-08 23:47:54,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:54,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:54,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:54,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:54,183 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:47:57,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:47:57,504 INFO L93 Difference]: Finished difference Result 2404 states and 4642 transitions. [2025-01-08 23:47:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:47:57,507 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-01-08 23:47:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:47:57,532 INFO L225 Difference]: With dead ends: 2404 [2025-01-08 23:47:57,535 INFO L226 Difference]: Without dead ends: 1506 [2025-01-08 23:47:57,544 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:47:57,546 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 799 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 3033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:47:57,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 525 Invalid, 3033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-08 23:47:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-01-08 23:47:57,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-01-08 23:47:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6066445182724252) internal successors, (2418), 1505 states have internal predecessors, (2418), 0 states have call successors, (0), 0 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:47:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2418 transitions. [2025-01-08 23:47:57,670 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2418 transitions. Word has length 21 [2025-01-08 23:47:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:47:57,670 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2418 transitions. [2025-01-08 23:47:57,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 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:47:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2418 transitions. [2025-01-08 23:47:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-08 23:47:57,673 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:47:57,673 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:47:57,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:47:57,674 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:47:57,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:47:57,674 INFO L85 PathProgramCache]: Analyzing trace with hash -774047739, now seen corresponding path program 1 times [2025-01-08 23:47:57,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:47:57,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629259513] [2025-01-08 23:47:57,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:47:57,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:47:57,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-08 23:47:57,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-08 23:47:57,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:47:57,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:47:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:47:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:47:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629259513] [2025-01-08 23:47:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629259513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:47:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:47:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:47:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231382892] [2025-01-08 23:47:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:47:58,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:47:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:47:58,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:47:58,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:47:58,007 INFO L87 Difference]: Start difference. First operand 1506 states and 2418 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:48:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:00,928 INFO L93 Difference]: Finished difference Result 4512 states and 7249 transitions. [2025-01-08 23:48:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-08 23:48:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:00,940 INFO L225 Difference]: With dead ends: 4512 [2025-01-08 23:48:00,940 INFO L226 Difference]: Without dead ends: 3008 [2025-01-08 23:48:00,941 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:48:00,942 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 774 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:00,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 449 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:48:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2025-01-08 23:48:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2025-01-08 23:48:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.4156967076820752) internal successors, (4257), 3007 states have internal predecessors, (4257), 0 states have call successors, (0), 0 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:48:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4257 transitions. [2025-01-08 23:48:01,014 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4257 transitions. Word has length 96 [2025-01-08 23:48:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:01,015 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4257 transitions. [2025-01-08 23:48:01,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:48:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4257 transitions. [2025-01-08 23:48:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-08 23:48:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:01,019 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:48:01,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:48:01,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:01,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:01,021 INFO L85 PathProgramCache]: Analyzing trace with hash -124290166, now seen corresponding path program 1 times [2025-01-08 23:48:01,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:01,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36996266] [2025-01-08 23:48:01,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:01,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-08 23:48:01,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-08 23:48:01,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:01,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:48:01,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:01,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36996266] [2025-01-08 23:48:01,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36996266] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:01,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:01,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:01,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775665423] [2025-01-08 23:48:01,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:01,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:48:01,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:01,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:48:01,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:48:01,439 INFO L87 Difference]: Start difference. First operand 3008 states and 4257 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:48:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:05,653 INFO L93 Difference]: Finished difference Result 9769 states and 13601 transitions. [2025-01-08 23:48:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:48:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-08 23:48:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:05,683 INFO L225 Difference]: With dead ends: 9769 [2025-01-08 23:48:05,683 INFO L226 Difference]: Without dead ends: 6763 [2025-01-08 23:48:05,688 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:48:05,689 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 2182 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4712 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2182 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 4712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:05,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2182 Valid, 164 Invalid, 5459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 4712 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-08 23:48:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2025-01-08 23:48:05,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6763. [2025-01-08 23:48:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6763 states, 6762 states have (on average 1.3510795622596865) internal successors, (9136), 6762 states have internal predecessors, (9136), 0 states have call successors, (0), 0 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:48:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6763 states to 6763 states and 9136 transitions. [2025-01-08 23:48:05,835 INFO L78 Accepts]: Start accepts. Automaton has 6763 states and 9136 transitions. Word has length 98 [2025-01-08 23:48:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:05,835 INFO L471 AbstractCegarLoop]: Abstraction has 6763 states and 9136 transitions. [2025-01-08 23:48:05,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:48:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 6763 states and 9136 transitions. [2025-01-08 23:48:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-08 23:48:05,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:05,840 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:48:05,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:48:05,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:05,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 109128746, now seen corresponding path program 1 times [2025-01-08 23:48:05,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:05,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442398058] [2025-01-08 23:48:05,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:05,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:05,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-08 23:48:05,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-08 23:48:05,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:05,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:48:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442398058] [2025-01-08 23:48:06,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442398058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:06,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:06,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:06,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779592728] [2025-01-08 23:48:06,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:06,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:06,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:06,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:06,079 INFO L87 Difference]: Start difference. First operand 6763 states and 9136 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:08,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:08,655 INFO L93 Difference]: Finished difference Result 15777 states and 21635 transitions. [2025-01-08 23:48:08,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2025-01-08 23:48:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:08,680 INFO L225 Difference]: With dead ends: 15777 [2025-01-08 23:48:08,680 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:48:08,689 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:48:08,690 INFO L435 NwaCegarLoop]: 1235 mSDtfsCounter, 739 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:08,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 1243 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:48:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:48:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:48:08,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3334015973786606) internal successors, (13022), 9766 states have internal predecessors, (13022), 0 states have call successors, (0), 0 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:48:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 13022 transitions. [2025-01-08 23:48:08,960 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 13022 transitions. Word has length 162 [2025-01-08 23:48:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:08,961 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 13022 transitions. [2025-01-08 23:48:08,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 13022 transitions. [2025-01-08 23:48:08,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-08 23:48:08,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:08,964 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:48:08,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:48:08,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:08,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1592160052, now seen corresponding path program 1 times [2025-01-08 23:48:08,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:08,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584241412] [2025-01-08 23:48:08,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:08,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:09,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 23:48:09,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 23:48:09,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:09,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:48:09,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:09,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584241412] [2025-01-08 23:48:09,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584241412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:09,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:09,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:09,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244716947] [2025-01-08 23:48:09,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:09,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:09,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:09,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:09,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:09,326 INFO L87 Difference]: Start difference. First operand 9767 states and 13022 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:48:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:11,901 INFO L93 Difference]: Finished difference Result 18781 states and 25285 transitions. [2025-01-08 23:48:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-01-08 23:48:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:11,930 INFO L225 Difference]: With dead ends: 18781 [2025-01-08 23:48:11,930 INFO L226 Difference]: Without dead ends: 9767 [2025-01-08 23:48:11,940 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:48:11,941 INFO L435 NwaCegarLoop]: 1299 mSDtfsCounter, 769 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 3019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:11,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1307 Invalid, 3019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:48:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-01-08 23:48:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-01-08 23:48:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2981773499897604) internal successors, (12678), 9766 states have internal predecessors, (12678), 0 states have call successors, (0), 0 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:48:12,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12678 transitions. [2025-01-08 23:48:12,108 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12678 transitions. Word has length 166 [2025-01-08 23:48:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12678 transitions. [2025-01-08 23:48:12,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:48:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12678 transitions. [2025-01-08 23:48:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-08 23:48:12,117 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:12,117 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:48:12,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:48:12,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:12,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash 389357250, now seen corresponding path program 1 times [2025-01-08 23:48:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:12,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561719416] [2025-01-08 23:48:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-08 23:48:12,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-08 23:48:12,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:12,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:12,512 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:48:12,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:12,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561719416] [2025-01-08 23:48:12,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561719416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092950649] [2025-01-08 23:48:12,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:48:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:12,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:48:12,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:48:12,519 INFO L87 Difference]: Start difference. First operand 9767 states and 12678 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:48:15,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:15,427 INFO L93 Difference]: Finished difference Result 22573 states and 29091 transitions. [2025-01-08 23:48:15,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:48:15,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2025-01-08 23:48:15,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:15,451 INFO L225 Difference]: With dead ends: 22573 [2025-01-08 23:48:15,451 INFO L226 Difference]: Without dead ends: 13522 [2025-01-08 23:48:15,458 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:48:15,459 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3695 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:15,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 628 Invalid, 3902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3695 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:48:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13522 states. [2025-01-08 23:48:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13522 to 12771. [2025-01-08 23:48:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.2293657008613939) internal successors, (15699), 12770 states have internal predecessors, (15699), 0 states have call successors, (0), 0 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:48:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 15699 transitions. [2025-01-08 23:48:15,621 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 15699 transitions. Word has length 175 [2025-01-08 23:48:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:15,621 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 15699 transitions. [2025-01-08 23:48:15,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:48:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 15699 transitions. [2025-01-08 23:48:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-01-08 23:48:15,624 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:15,624 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:48:15,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:48:15,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:15,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash -946102295, now seen corresponding path program 1 times [2025-01-08 23:48:15,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563105160] [2025-01-08 23:48:15,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:15,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-08 23:48:15,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-08 23:48:15,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:15,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:48:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563105160] [2025-01-08 23:48:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563105160] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:48:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470852702] [2025-01-08 23:48:16,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:48:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:48:16,054 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:48:16,056 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:48:16,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-01-08 23:48:16,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-01-08 23:48:16,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:16,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:16,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:48:16,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:48:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:48:16,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:48:16,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470852702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:16,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:48:16,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 23:48:16,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144018811] [2025-01-08 23:48:16,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:16,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:16,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:16,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:48:16,320 INFO L87 Difference]: Start difference. First operand 12771 states and 15699 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:48:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:18,986 INFO L93 Difference]: Finished difference Result 32299 states and 40603 transitions. [2025-01-08 23:48:18,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-01-08 23:48:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:19,037 INFO L225 Difference]: With dead ends: 32299 [2025-01-08 23:48:19,037 INFO L226 Difference]: Without dead ends: 20281 [2025-01-08 23:48:19,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:48:19,051 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 907 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:19,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 309 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:48:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2025-01-08 23:48:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 20281. [2025-01-08 23:48:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20281 states, 20280 states have (on average 1.192603550295858) internal successors, (24186), 20280 states have internal predecessors, (24186), 0 states have call successors, (0), 0 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:48:19,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20281 states to 20281 states and 24186 transitions. [2025-01-08 23:48:19,297 INFO L78 Accepts]: Start accepts. Automaton has 20281 states and 24186 transitions. Word has length 249 [2025-01-08 23:48:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:19,297 INFO L471 AbstractCegarLoop]: Abstraction has 20281 states and 24186 transitions. [2025-01-08 23:48:19,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:48:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20281 states and 24186 transitions. [2025-01-08 23:48:19,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-08 23:48:19,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:19,304 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:48:19,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 23:48:19,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:48:19,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:19,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1460449983, now seen corresponding path program 1 times [2025-01-08 23:48:19,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:19,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509439660] [2025-01-08 23:48:19,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:19,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:19,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-08 23:48:19,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-08 23:48:19,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:19,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-01-08 23:48:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509439660] [2025-01-08 23:48:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509439660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601834562] [2025-01-08 23:48:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:19,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:19,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:19,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:19,758 INFO L87 Difference]: Start difference. First operand 20281 states and 24186 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:48:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:22,145 INFO L93 Difference]: Finished difference Result 39809 states and 47614 transitions. [2025-01-08 23:48:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:22,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 298 [2025-01-08 23:48:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:22,180 INFO L225 Difference]: With dead ends: 39809 [2025-01-08 23:48:22,181 INFO L226 Difference]: Without dead ends: 20281 [2025-01-08 23:48:22,194 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:48:22,194 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 806 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:22,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 999 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:48:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2025-01-08 23:48:22,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 20281. [2025-01-08 23:48:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20281 states, 20280 states have (on average 1.1599112426035503) internal successors, (23523), 20280 states have internal predecessors, (23523), 0 states have call successors, (0), 0 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:48:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20281 states to 20281 states and 23523 transitions. [2025-01-08 23:48:22,408 INFO L78 Accepts]: Start accepts. Automaton has 20281 states and 23523 transitions. Word has length 298 [2025-01-08 23:48:22,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:22,409 INFO L471 AbstractCegarLoop]: Abstraction has 20281 states and 23523 transitions. [2025-01-08 23:48:22,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:48:22,409 INFO L276 IsEmpty]: Start isEmpty. Operand 20281 states and 23523 transitions. [2025-01-08 23:48:22,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-08 23:48:22,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:22,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:48:22,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:48:22,414 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:22,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 54757196, now seen corresponding path program 1 times [2025-01-08 23:48:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308104158] [2025-01-08 23:48:22,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:22,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-01-08 23:48:22,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-01-08 23:48:22,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:22,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:48:22,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:22,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308104158] [2025-01-08 23:48:22,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308104158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:22,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:22,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:22,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206341772] [2025-01-08 23:48:22,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:22,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:22,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:22,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:22,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:22,697 INFO L87 Difference]: Start difference. First operand 20281 states and 23523 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:48:25,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:25,358 INFO L93 Difference]: Finished difference Result 49572 states and 58416 transitions. [2025-01-08 23:48:25,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:25,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 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 320 [2025-01-08 23:48:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:25,395 INFO L225 Difference]: With dead ends: 49572 [2025-01-08 23:48:25,395 INFO L226 Difference]: Without dead ends: 30044 [2025-01-08 23:48:25,404 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:48:25,405 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 792 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:25,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 238 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:48:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30044 states. [2025-01-08 23:48:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30044 to 30044. [2025-01-08 23:48:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30044 states, 30043 states have (on average 1.1400659055353992) internal successors, (34251), 30043 states have internal predecessors, (34251), 0 states have call successors, (0), 0 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:48:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30044 states to 30044 states and 34251 transitions. [2025-01-08 23:48:25,733 INFO L78 Accepts]: Start accepts. Automaton has 30044 states and 34251 transitions. Word has length 320 [2025-01-08 23:48:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:25,733 INFO L471 AbstractCegarLoop]: Abstraction has 30044 states and 34251 transitions. [2025-01-08 23:48:25,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 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:48:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 30044 states and 34251 transitions. [2025-01-08 23:48:25,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-01-08 23:48:25,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:25,739 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:25,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:48:25,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:25,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:25,740 INFO L85 PathProgramCache]: Analyzing trace with hash -2111205707, now seen corresponding path program 1 times [2025-01-08 23:48:25,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:25,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320873589] [2025-01-08 23:48:25,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:25,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:25,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-08 23:48:25,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-08 23:48:25,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:25,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:48:26,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320873589] [2025-01-08 23:48:26,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320873589] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:48:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496578525] [2025-01-08 23:48:26,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:26,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:48:26,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:48:26,239 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:48:26,241 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:48:26,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-01-08 23:48:26,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-01-08 23:48:26,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:26,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:26,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:48:26,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:48:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 23:48:26,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:48:26,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496578525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:26,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:48:26,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:48:26,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899717443] [2025-01-08 23:48:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:26,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:26,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:26,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:26,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:48:26,718 INFO L87 Difference]: Start difference. First operand 30044 states and 34251 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:48:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:29,380 INFO L93 Difference]: Finished difference Result 82616 states and 93793 transitions. [2025-01-08 23:48:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:29,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 326 [2025-01-08 23:48:29,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:29,454 INFO L225 Difference]: With dead ends: 82616 [2025-01-08 23:48:29,454 INFO L226 Difference]: Without dead ends: 53325 [2025-01-08 23:48:29,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:48:29,474 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 461 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:29,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 602 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:48:29,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53325 states. [2025-01-08 23:48:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53325 to 49570. [2025-01-08 23:48:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49570 states, 49569 states have (on average 1.107869838003591) internal successors, (54916), 49569 states have internal predecessors, (54916), 0 states have call successors, (0), 0 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:48:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49570 states to 49570 states and 54916 transitions. [2025-01-08 23:48:30,066 INFO L78 Accepts]: Start accepts. Automaton has 49570 states and 54916 transitions. Word has length 326 [2025-01-08 23:48:30,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:30,067 INFO L471 AbstractCegarLoop]: Abstraction has 49570 states and 54916 transitions. [2025-01-08 23:48:30,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:48:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 49570 states and 54916 transitions. [2025-01-08 23:48:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-08 23:48:30,071 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:30,071 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:48:30,079 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:48:30,272 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:48:30,272 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1316757756, now seen corresponding path program 1 times [2025-01-08 23:48:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:30,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594677462] [2025-01-08 23:48:30,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:30,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-08 23:48:30,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-08 23:48:30,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-08 23:48:31,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:31,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594677462] [2025-01-08 23:48:31,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594677462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:31,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:31,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:31,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557284969] [2025-01-08 23:48:31,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:31,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:31,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:31,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:31,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:31,042 INFO L87 Difference]: Start difference. First operand 49570 states and 54916 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:48:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:33,665 INFO L93 Difference]: Finished difference Result 110403 states and 122187 transitions. [2025-01-08 23:48:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:33,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 352 [2025-01-08 23:48:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:33,742 INFO L225 Difference]: With dead ends: 110403 [2025-01-08 23:48:33,742 INFO L226 Difference]: Without dead ends: 61586 [2025-01-08 23:48:33,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:48:33,786 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 850 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:33,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 906 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:48:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61586 states. [2025-01-08 23:48:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61586 to 57080. [2025-01-08 23:48:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57080 states, 57079 states have (on average 1.1013682790518404) internal successors, (62865), 57079 states have internal predecessors, (62865), 0 states have call successors, (0), 0 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:48:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57080 states to 57080 states and 62865 transitions. [2025-01-08 23:48:34,426 INFO L78 Accepts]: Start accepts. Automaton has 57080 states and 62865 transitions. Word has length 352 [2025-01-08 23:48:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:34,426 INFO L471 AbstractCegarLoop]: Abstraction has 57080 states and 62865 transitions. [2025-01-08 23:48:34,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:48:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 57080 states and 62865 transitions. [2025-01-08 23:48:34,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 522 [2025-01-08 23:48:34,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:34,441 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:48:34,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:48:34,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:34,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:34,442 INFO L85 PathProgramCache]: Analyzing trace with hash -221197717, now seen corresponding path program 1 times [2025-01-08 23:48:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:34,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568026092] [2025-01-08 23:48:34,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:34,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 521 statements into 1 equivalence classes. [2025-01-08 23:48:34,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 521 of 521 statements. [2025-01-08 23:48:34,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:34,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 617 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-08 23:48:34,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:34,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568026092] [2025-01-08 23:48:34,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568026092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:34,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:34,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:34,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70828233] [2025-01-08 23:48:34,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:34,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:34,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:34,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:34,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:34,832 INFO L87 Difference]: Start difference. First operand 57080 states and 62865 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:37,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:37,489 INFO L93 Difference]: Finished difference Result 117913 states and 129591 transitions. [2025-01-08 23:48:37,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:37,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 521 [2025-01-08 23:48:37,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:37,554 INFO L225 Difference]: With dead ends: 117913 [2025-01-08 23:48:37,554 INFO L226 Difference]: Without dead ends: 61586 [2025-01-08 23:48:37,582 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:48:37,583 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 663 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 621 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 621 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:37,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 278 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [621 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:48:37,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61586 states. [2025-01-08 23:48:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61586 to 54827. [2025-01-08 23:48:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54827 states, 54826 states have (on average 1.0987852478750957) internal successors, (60242), 54826 states have internal predecessors, (60242), 0 states have call successors, (0), 0 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:48:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54827 states to 54827 states and 60242 transitions. [2025-01-08 23:48:38,253 INFO L78 Accepts]: Start accepts. Automaton has 54827 states and 60242 transitions. Word has length 521 [2025-01-08 23:48:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:38,253 INFO L471 AbstractCegarLoop]: Abstraction has 54827 states and 60242 transitions. [2025-01-08 23:48:38,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 54827 states and 60242 transitions. [2025-01-08 23:48:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-01-08 23:48:38,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:38,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:48:38,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:48:38,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:38,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:38,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1157810942, now seen corresponding path program 1 times [2025-01-08 23:48:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516445463] [2025-01-08 23:48:38,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:38,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-01-08 23:48:38,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-01-08 23:48:38,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:38,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-08 23:48:38,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:38,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516445463] [2025-01-08 23:48:38,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516445463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:38,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:38,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961536302] [2025-01-08 23:48:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:38,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:38,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:38,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:38,990 INFO L87 Difference]: Start difference. First operand 54827 states and 60242 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:48:42,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:42,069 INFO L93 Difference]: Finished difference Result 125423 states and 138840 transitions. [2025-01-08 23:48:42,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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 529 [2025-01-08 23:48:42,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:42,180 INFO L225 Difference]: With dead ends: 125423 [2025-01-08 23:48:42,180 INFO L226 Difference]: Without dead ends: 71349 [2025-01-08 23:48:42,221 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:48:42,222 INFO L435 NwaCegarLoop]: 1349 mSDtfsCounter, 756 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:42,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1357 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:48:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71349 states. [2025-01-08 23:48:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71349 to 69096. [2025-01-08 23:48:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69096 states, 69095 states have (on average 1.0930313336710327) internal successors, (75523), 69095 states have internal predecessors, (75523), 0 states have call successors, (0), 0 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:48:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69096 states to 69096 states and 75523 transitions. [2025-01-08 23:48:43,005 INFO L78 Accepts]: Start accepts. Automaton has 69096 states and 75523 transitions. Word has length 529 [2025-01-08 23:48:43,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:43,006 INFO L471 AbstractCegarLoop]: Abstraction has 69096 states and 75523 transitions. [2025-01-08 23:48:43,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 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:48:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 69096 states and 75523 transitions. [2025-01-08 23:48:43,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-01-08 23:48:43,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:43,016 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:48:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:48:43,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:43,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:43,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2018469104, now seen corresponding path program 1 times [2025-01-08 23:48:43,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:43,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946899438] [2025-01-08 23:48:43,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-08 23:48:43,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-08 23:48:43,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:43,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 446 proven. 230 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-01-08 23:48:43,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:43,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946899438] [2025-01-08 23:48:43,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946899438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:48:43,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966113166] [2025-01-08 23:48:43,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:43,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:48:43,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:48:43,557 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:48:43,559 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:48:43,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-01-08 23:48:43,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-01-08 23:48:43,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:43,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:43,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:48:43,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:48:43,907 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:48:43,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:48:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966113166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:43,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:48:43,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 23:48:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306058893] [2025-01-08 23:48:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:43,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:43,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:43,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:43,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:48:43,911 INFO L87 Difference]: Start difference. First operand 69096 states and 75523 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:48:46,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:46,661 INFO L93 Difference]: Finished difference Result 156214 states and 171546 transitions. [2025-01-08 23:48:46,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:46,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 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 532 [2025-01-08 23:48:46,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:46,749 INFO L225 Difference]: With dead ends: 156214 [2025-01-08 23:48:46,749 INFO L226 Difference]: Without dead ends: 87871 [2025-01-08 23:48:46,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:48:46,786 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 661 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:46,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1015 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:48:46,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87871 states. [2025-01-08 23:48:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87871 to 87871. [2025-01-08 23:48:47,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87871 states, 87870 states have (on average 1.0964948218959827) internal successors, (96349), 87870 states have internal predecessors, (96349), 0 states have call successors, (0), 0 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:48:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87871 states to 87871 states and 96349 transitions. [2025-01-08 23:48:48,018 INFO L78 Accepts]: Start accepts. Automaton has 87871 states and 96349 transitions. Word has length 532 [2025-01-08 23:48:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:48,019 INFO L471 AbstractCegarLoop]: Abstraction has 87871 states and 96349 transitions. [2025-01-08 23:48:48,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:48:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 87871 states and 96349 transitions. [2025-01-08 23:48:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-01-08 23:48:48,028 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:48,028 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:48:48,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:48:48,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:48:48,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:48,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:48,230 INFO L85 PathProgramCache]: Analyzing trace with hash -849233251, now seen corresponding path program 1 times [2025-01-08 23:48:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:48,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543279001] [2025-01-08 23:48:48,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:48,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:48,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-01-08 23:48:48,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-01-08 23:48:48,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:48,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-08 23:48:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543279001] [2025-01-08 23:48:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543279001] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:48,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:48,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262856750] [2025-01-08 23:48:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:48,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:48,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:48,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:48,562 INFO L87 Difference]: Start difference. First operand 87871 states and 96349 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:51,045 INFO L93 Difference]: Finished difference Result 178744 states and 195638 transitions. [2025-01-08 23:48:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 541 [2025-01-08 23:48:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:51,144 INFO L225 Difference]: With dead ends: 178744 [2025-01-08 23:48:51,144 INFO L226 Difference]: Without dead ends: 91626 [2025-01-08 23:48:51,196 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:48:51,196 INFO L435 NwaCegarLoop]: 993 mSDtfsCounter, 761 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:51,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 1000 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:48:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91626 states. [2025-01-08 23:48:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91626 to 82614. [2025-01-08 23:48:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82614 states, 82613 states have (on average 1.0780869838887341) internal successors, (89064), 82613 states have internal predecessors, (89064), 0 states have call successors, (0), 0 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:48:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82614 states to 82614 states and 89064 transitions. [2025-01-08 23:48:52,298 INFO L78 Accepts]: Start accepts. Automaton has 82614 states and 89064 transitions. Word has length 541 [2025-01-08 23:48:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:52,298 INFO L471 AbstractCegarLoop]: Abstraction has 82614 states and 89064 transitions. [2025-01-08 23:48:52,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:48:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 82614 states and 89064 transitions. [2025-01-08 23:48:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2025-01-08 23:48:52,312 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:52,312 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:52,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:48:52,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 314305406, now seen corresponding path program 1 times [2025-01-08 23:48:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684052104] [2025-01-08 23:48:52,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:52,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 567 statements into 1 equivalence classes. [2025-01-08 23:48:52,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 567 of 567 statements. [2025-01-08 23:48:52,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:52,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-01-08 23:48:52,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684052104] [2025-01-08 23:48:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684052104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:52,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375623328] [2025-01-08 23:48:52,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:52,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:52,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:52,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:52,797 INFO L87 Difference]: Start difference. First operand 82614 states and 89064 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:48:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:48:55,296 INFO L93 Difference]: Finished difference Result 196017 states and 211674 transitions. [2025-01-08 23:48:55,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:48:55,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 567 [2025-01-08 23:48:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:48:55,418 INFO L225 Difference]: With dead ends: 196017 [2025-01-08 23:48:55,418 INFO L226 Difference]: Without dead ends: 114156 [2025-01-08 23:48:55,464 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:48:55,465 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 699 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2117 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:48:55,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1229 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2117 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:48:55,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114156 states. [2025-01-08 23:48:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114156 to 108148. [2025-01-08 23:48:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108148 states, 108147 states have (on average 1.070801779059983) internal successors, (115804), 108147 states have internal predecessors, (115804), 0 states have call successors, (0), 0 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:48:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108148 states to 108148 states and 115804 transitions. [2025-01-08 23:48:56,846 INFO L78 Accepts]: Start accepts. Automaton has 108148 states and 115804 transitions. Word has length 567 [2025-01-08 23:48:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:48:56,847 INFO L471 AbstractCegarLoop]: Abstraction has 108148 states and 115804 transitions. [2025-01-08 23:48:56,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 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:48:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 108148 states and 115804 transitions. [2025-01-08 23:48:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-01-08 23:48:56,867 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:48:56,868 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:56,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:48:56,868 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:48:56,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:48:56,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1094774660, now seen corresponding path program 1 times [2025-01-08 23:48:56,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:48:56,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886994715] [2025-01-08 23:48:56,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:48:56,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:48:56,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-01-08 23:48:56,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-01-08 23:48:56,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:48:56,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:48:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-08 23:48:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:48:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886994715] [2025-01-08 23:48:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886994715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:48:57,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:48:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:48:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509889203] [2025-01-08 23:48:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:48:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:48:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:48:57,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:48:57,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:48:57,449 INFO L87 Difference]: Start difference. First operand 108148 states and 115804 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:49:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:49:00,272 INFO L93 Difference]: Finished difference Result 225306 states and 241716 transitions. [2025-01-08 23:49:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:49:00,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 617 [2025-01-08 23:49:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:49:00,385 INFO L225 Difference]: With dead ends: 225306 [2025-01-08 23:49:00,385 INFO L226 Difference]: Without dead ends: 117911 [2025-01-08 23:49:00,433 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:49:00,433 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 770 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:49:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 581 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:49:00,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117911 states. [2025-01-08 23:49:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117911 to 98385. [2025-01-08 23:49:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98385 states, 98384 states have (on average 1.070438282647585) internal successors, (105314), 98384 states have internal predecessors, (105314), 0 states have call successors, (0), 0 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:49:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98385 states to 98385 states and 105314 transitions. [2025-01-08 23:49:01,675 INFO L78 Accepts]: Start accepts. Automaton has 98385 states and 105314 transitions. Word has length 617 [2025-01-08 23:49:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:49:01,675 INFO L471 AbstractCegarLoop]: Abstraction has 98385 states and 105314 transitions. [2025-01-08 23:49:01,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:49:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 98385 states and 105314 transitions. [2025-01-08 23:49:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2025-01-08 23:49:01,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:49:01,688 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:49:01,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:49:01,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:49:01,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:49:01,689 INFO L85 PathProgramCache]: Analyzing trace with hash 420140779, now seen corresponding path program 1 times [2025-01-08 23:49:01,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:49:01,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729645218] [2025-01-08 23:49:01,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:49:01,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:49:01,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 650 statements into 1 equivalence classes. [2025-01-08 23:49:01,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 650 of 650 statements. [2025-01-08 23:49:01,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:49:01,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:49:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 531 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2025-01-08 23:49:01,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:49:01,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729645218] [2025-01-08 23:49:01,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729645218] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:49:01,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:49:01,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:49:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109134807] [2025-01-08 23:49:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:49:01,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:49:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:49:01,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:49:01,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:49:01,881 INFO L87 Difference]: Start difference. First operand 98385 states and 105314 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)