./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label18.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/Problem03_label18.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 d08db41ae0d7ec8078cc06035e9e84ddb6f4cbeccb0dd0eb818a13f85c4c66c1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:55:33,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:55:33,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:55:33,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:55:33,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:55:33,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:55:33,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:55:33,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:55:33,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:55:33,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:55:33,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:55:33,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:55:33,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:55:33,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:55:33,730 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:55:33,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:55:33,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:55:33,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:55:33,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:55:33,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:33,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:55:33,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:55:33,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:55:33,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:55:33,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:33,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:55:33,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:55:33,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:55:33,734 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 -> d08db41ae0d7ec8078cc06035e9e84ddb6f4cbeccb0dd0eb818a13f85c4c66c1 [2025-01-08 22:55:33,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:55:33,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:55:33,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:55:33,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:55:33,965 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:55:33,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label18.c [2025-01-08 22:55:35,081 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89c36dd34/3ffa228cf68b416b8e2fc9e25a18bbcd/FLAG773292667 [2025-01-08 22:55:35,483 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:55:35,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label18.c [2025-01-08 22:55:35,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89c36dd34/3ffa228cf68b416b8e2fc9e25a18bbcd/FLAG773292667 [2025-01-08 22:55:35,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89c36dd34/3ffa228cf68b416b8e2fc9e25a18bbcd [2025-01-08 22:55:35,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:55:35,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:55:35,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:55:35,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:55:35,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:55:35,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:55:35" (1/1) ... [2025-01-08 22:55:35,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ac6e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:35, skipping insertion in model container [2025-01-08 22:55:35,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:55:35" (1/1) ... [2025-01-08 22:55:35,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:55:36,016 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/Problem03_label18.c[61636,61649] [2025-01-08 22:55:36,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:55:36,049 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:55:36,167 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/Problem03_label18.c[61636,61649] [2025-01-08 22:55:36,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:55:36,187 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:55:36,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36 WrapperNode [2025-01-08 22:55:36,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:55:36,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:55:36,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:55:36,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:55:36,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,216 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,298 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:55:36,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:55:36,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:55:36,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:55:36,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:55:36,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,356 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 22:55:36,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:55:36,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:55:36,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:55:36,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:55:36,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (1/1) ... [2025-01-08 22:55:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:36,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:36,466 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 22:55:36,469 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 22:55:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:55:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:55:36,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:55:36,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:55:36,554 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:55:36,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:55:37,991 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:55:37,991 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:55:38,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:55:38,005 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:55:38,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:38 BoogieIcfgContainer [2025-01-08 22:55:38,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:55:38,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:55:38,007 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:55:38,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:55:38,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:55:35" (1/3) ... [2025-01-08 22:55:38,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f91ce49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:55:38, skipping insertion in model container [2025-01-08 22:55:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:36" (2/3) ... [2025-01-08 22:55:38,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f91ce49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:55:38, skipping insertion in model container [2025-01-08 22:55:38,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:38" (3/3) ... [2025-01-08 22:55:38,017 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label18.c [2025-01-08 22:55:38,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:55:38,042 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label18.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:55:38,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:55:38,114 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;@1a5e04d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:55:38,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:55:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 22:55:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-08 22:55:38,133 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:38,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:38,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:38,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:38,138 INFO L85 PathProgramCache]: Analyzing trace with hash -374974210, now seen corresponding path program 1 times [2025-01-08 22:55:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125097946] [2025-01-08 22:55:38,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:38,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 22:55:38,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 22:55:38,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:38,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:38,940 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 22:55:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:38,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125097946] [2025-01-08 22:55:38,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125097946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:38,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:38,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240798724] [2025-01-08 22:55:38,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:38,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:38,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:38,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:38,968 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:39,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:39,800 INFO L93 Difference]: Finished difference Result 810 states and 1442 transitions. [2025-01-08 22:55:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:39,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-01-08 22:55:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:39,808 INFO L225 Difference]: With dead ends: 810 [2025-01-08 22:55:39,809 INFO L226 Difference]: Without dead ends: 444 [2025-01-08 22:55:39,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:39,812 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 51 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:39,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 231 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:55:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-08 22:55:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-08 22:55:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 1.4288939051918736) internal successors, (633), 443 states have internal predecessors, (633), 0 states have call successors, (0), 0 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 22:55:39,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 633 transitions. [2025-01-08 22:55:39,866 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 633 transitions. Word has length 203 [2025-01-08 22:55:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:39,869 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 633 transitions. [2025-01-08 22:55:39,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 633 transitions. [2025-01-08 22:55:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-08 22:55:39,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:39,872 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:55:39,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:55:39,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:39,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1618029441, now seen corresponding path program 1 times [2025-01-08 22:55:39,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:39,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935200893] [2025-01-08 22:55:39,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:39,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:39,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-08 22:55:39,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-08 22:55:39,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:39,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:40,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935200893] [2025-01-08 22:55:40,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935200893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:40,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:40,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:40,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864801095] [2025-01-08 22:55:40,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:40,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:40,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:40,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:40,069 INFO L87 Difference]: Start difference. First operand 444 states and 633 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 22:55:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:40,734 INFO L93 Difference]: Finished difference Result 1312 states and 1878 transitions. [2025-01-08 22:55:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 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 211 [2025-01-08 22:55:40,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:40,737 INFO L225 Difference]: With dead ends: 1312 [2025-01-08 22:55:40,738 INFO L226 Difference]: Without dead ends: 870 [2025-01-08 22:55:40,739 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 22:55:40,740 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:40,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 94 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-01-08 22:55:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 856. [2025-01-08 22:55:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 855 states have (on average 1.3941520467836257) internal successors, (1192), 855 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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 22:55:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1192 transitions. [2025-01-08 22:55:40,771 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1192 transitions. Word has length 211 [2025-01-08 22:55:40,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:40,771 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1192 transitions. [2025-01-08 22:55:40,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 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 22:55:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1192 transitions. [2025-01-08 22:55:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-08 22:55:40,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:40,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-01-08 22:55:40,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:55:40,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:40,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -379760200, now seen corresponding path program 1 times [2025-01-08 22:55:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:40,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321110214] [2025-01-08 22:55:40,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:40,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:40,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-08 22:55:40,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-08 22:55:40,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:40,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:55:40,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:40,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321110214] [2025-01-08 22:55:40,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321110214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:40,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:40,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:40,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856361113] [2025-01-08 22:55:40,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:40,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:40,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:40,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:40,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:40,936 INFO L87 Difference]: Start difference. First operand 856 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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 22:55:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:41,142 INFO L93 Difference]: Finished difference Result 2548 states and 3550 transitions. [2025-01-08 22:55:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 223 [2025-01-08 22:55:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:41,148 INFO L225 Difference]: With dead ends: 2548 [2025-01-08 22:55:41,148 INFO L226 Difference]: Without dead ends: 1694 [2025-01-08 22:55:41,149 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 22:55:41,150 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 361 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:41,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 586 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:55:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-01-08 22:55:41,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1691. [2025-01-08 22:55:41,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1690 states have (on average 1.393491124260355) internal successors, (2355), 1690 states have internal predecessors, (2355), 0 states have call successors, (0), 0 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 22:55:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2355 transitions. [2025-01-08 22:55:41,187 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2355 transitions. Word has length 223 [2025-01-08 22:55:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:41,187 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2355 transitions. [2025-01-08 22:55:41,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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 22:55:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2355 transitions. [2025-01-08 22:55:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-08 22:55:41,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:41,192 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-01-08 22:55:41,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:55:41,192 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:41,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash -292999348, now seen corresponding path program 1 times [2025-01-08 22:55:41,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:41,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321262117] [2025-01-08 22:55:41,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:41,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:41,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-08 22:55:41,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-08 22:55:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:55:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:41,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321262117] [2025-01-08 22:55:41,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321262117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:41,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:41,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:41,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213166432] [2025-01-08 22:55:41,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:41,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:41,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:41,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:41,342 INFO L87 Difference]: Start difference. First operand 1691 states and 2355 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 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 22:55:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:41,666 INFO L93 Difference]: Finished difference Result 3347 states and 4662 transitions. [2025-01-08 22:55:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 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 231 [2025-01-08 22:55:41,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:41,671 INFO L225 Difference]: With dead ends: 3347 [2025-01-08 22:55:41,671 INFO L226 Difference]: Without dead ends: 1658 [2025-01-08 22:55:41,673 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 22:55:41,673 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:41,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:55:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2025-01-08 22:55:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2025-01-08 22:55:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1657 states have (on average 1.352444176222088) internal successors, (2241), 1657 states have internal predecessors, (2241), 0 states have call successors, (0), 0 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 22:55:41,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2241 transitions. [2025-01-08 22:55:41,700 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2241 transitions. Word has length 231 [2025-01-08 22:55:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:41,700 INFO L471 AbstractCegarLoop]: Abstraction has 1658 states and 2241 transitions. [2025-01-08 22:55:41,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 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 22:55:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2241 transitions. [2025-01-08 22:55:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-08 22:55:41,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:41,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-01-08 22:55:41,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:55:41,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:41,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1245946953, now seen corresponding path program 1 times [2025-01-08 22:55:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757514052] [2025-01-08 22:55:41,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:41,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 22:55:41,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 22:55:41,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:41,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:41,865 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757514052] [2025-01-08 22:55:41,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757514052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:41,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:41,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:41,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898212420] [2025-01-08 22:55:41,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:41,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:41,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:41,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:41,868 INFO L87 Difference]: Start difference. First operand 1658 states and 2241 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:42,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:42,133 INFO L93 Difference]: Finished difference Result 4956 states and 6700 transitions. [2025-01-08 22:55:42,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:42,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-01-08 22:55:42,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:42,143 INFO L225 Difference]: With dead ends: 4956 [2025-01-08 22:55:42,143 INFO L226 Difference]: Without dead ends: 3300 [2025-01-08 22:55:42,146 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 22:55:42,146 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:42,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:55:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2025-01-08 22:55:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3298. [2025-01-08 22:55:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 3297 states have (on average 1.3503184713375795) internal successors, (4452), 3297 states have internal predecessors, (4452), 0 states have call successors, (0), 0 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 22:55:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4452 transitions. [2025-01-08 22:55:42,208 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4452 transitions. Word has length 232 [2025-01-08 22:55:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:42,209 INFO L471 AbstractCegarLoop]: Abstraction has 3298 states and 4452 transitions. [2025-01-08 22:55:42,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4452 transitions. [2025-01-08 22:55:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 22:55:42,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:42,215 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 3, 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] [2025-01-08 22:55:42,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:55:42,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1084027251, now seen corresponding path program 1 times [2025-01-08 22:55:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080665157] [2025-01-08 22:55:42,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:42,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:42,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:55:42,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:55:42,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:42,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:55:42,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:42,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080665157] [2025-01-08 22:55:42,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080665157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:42,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:42,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:42,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393080929] [2025-01-08 22:55:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:42,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:55:42,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:42,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:55:42,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:55:42,515 INFO L87 Difference]: Start difference. First operand 3298 states and 4452 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:43,597 INFO L93 Difference]: Finished difference Result 13171 states and 17783 transitions. [2025-01-08 22:55:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:55:43,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2025-01-08 22:55:43,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:43,626 INFO L225 Difference]: With dead ends: 13171 [2025-01-08 22:55:43,626 INFO L226 Difference]: Without dead ends: 9875 [2025-01-08 22:55:43,629 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 22:55:43,630 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 561 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:43,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 66 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:55:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9875 states. [2025-01-08 22:55:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9875 to 9871. [2025-01-08 22:55:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9871 states, 9870 states have (on average 1.343566362715299) internal successors, (13261), 9870 states have internal predecessors, (13261), 0 states have call successors, (0), 0 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 22:55:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9871 states to 9871 states and 13261 transitions. [2025-01-08 22:55:43,804 INFO L78 Accepts]: Start accepts. Automaton has 9871 states and 13261 transitions. Word has length 235 [2025-01-08 22:55:43,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:43,804 INFO L471 AbstractCegarLoop]: Abstraction has 9871 states and 13261 transitions. [2025-01-08 22:55:43,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:43,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9871 states and 13261 transitions. [2025-01-08 22:55:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-01-08 22:55:43,811 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:43,812 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:43,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:55:43,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:43,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -277854310, now seen corresponding path program 1 times [2025-01-08 22:55:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17519651] [2025-01-08 22:55:43,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:43,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-08 22:55:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-08 22:55:43,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:43,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:44,145 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:44,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17519651] [2025-01-08 22:55:44,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17519651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:44,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787368761] [2025-01-08 22:55:44,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:44,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:44,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:44,148 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 22:55:44,150 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 22:55:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-08 22:55:44,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-08 22:55:44,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:44,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:44,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:55:44,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:44,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:44,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787368761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:44,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:44,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:55:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966363083] [2025-01-08 22:55:44,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:44,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:44,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:44,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:44,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:44,512 INFO L87 Difference]: Start difference. First operand 9871 states and 13261 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 22:55:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:45,309 INFO L93 Difference]: Finished difference Result 28917 states and 38892 transitions. [2025-01-08 22:55:45,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 241 [2025-01-08 22:55:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:45,365 INFO L225 Difference]: With dead ends: 28917 [2025-01-08 22:55:45,365 INFO L226 Difference]: Without dead ends: 19048 [2025-01-08 22:55:45,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:45,382 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 26 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:45,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 329 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19048 states. [2025-01-08 22:55:45,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19048 to 19010. [2025-01-08 22:55:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19010 states, 19009 states have (on average 1.3085906675785155) internal successors, (24875), 19009 states have internal predecessors, (24875), 0 states have call successors, (0), 0 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 22:55:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19010 states to 19010 states and 24875 transitions. [2025-01-08 22:55:45,803 INFO L78 Accepts]: Start accepts. Automaton has 19010 states and 24875 transitions. Word has length 241 [2025-01-08 22:55:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:45,803 INFO L471 AbstractCegarLoop]: Abstraction has 19010 states and 24875 transitions. [2025-01-08 22:55:45,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 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 22:55:45,804 INFO L276 IsEmpty]: Start isEmpty. Operand 19010 states and 24875 transitions. [2025-01-08 22:55:45,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-01-08 22:55:45,820 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:45,820 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:55:45,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:55:46,020 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 22:55:46,021 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:46,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash -537921117, now seen corresponding path program 1 times [2025-01-08 22:55:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:46,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486133949] [2025-01-08 22:55:46,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:46,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:46,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-01-08 22:55:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-01-08 22:55:46,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:46,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:55:46,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:46,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486133949] [2025-01-08 22:55:46,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486133949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:46,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:46,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:46,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514132008] [2025-01-08 22:55:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:46,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:46,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:46,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:46,294 INFO L87 Difference]: Start difference. First operand 19010 states and 24875 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 22:55:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:47,013 INFO L93 Difference]: Finished difference Result 48801 states and 64448 transitions. [2025-01-08 22:55:47,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:47,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 273 [2025-01-08 22:55:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:47,066 INFO L225 Difference]: With dead ends: 48801 [2025-01-08 22:55:47,066 INFO L226 Difference]: Without dead ends: 29793 [2025-01-08 22:55:47,090 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 22:55:47,090 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 171 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:47,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 348 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2025-01-08 22:55:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 29775. [2025-01-08 22:55:47,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29775 states, 29774 states have (on average 1.2457177403103379) internal successors, (37090), 29774 states have internal predecessors, (37090), 0 states have call successors, (0), 0 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 22:55:47,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29775 states to 29775 states and 37090 transitions. [2025-01-08 22:55:47,508 INFO L78 Accepts]: Start accepts. Automaton has 29775 states and 37090 transitions. Word has length 273 [2025-01-08 22:55:47,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:47,509 INFO L471 AbstractCegarLoop]: Abstraction has 29775 states and 37090 transitions. [2025-01-08 22:55:47,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 22:55:47,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29775 states and 37090 transitions. [2025-01-08 22:55:47,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-08 22:55:47,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:47,532 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:47,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:55:47,533 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:47,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash 872113807, now seen corresponding path program 1 times [2025-01-08 22:55:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498786574] [2025-01-08 22:55:47,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:47,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-08 22:55:47,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-08 22:55:47,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:47,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:55:47,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:47,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498786574] [2025-01-08 22:55:47,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498786574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:47,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:47,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799654019] [2025-01-08 22:55:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:47,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:47,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:47,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:47,824 INFO L87 Difference]: Start difference. First operand 29775 states and 37090 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:48,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:48,642 INFO L93 Difference]: Finished difference Result 68320 states and 85816 transitions. [2025-01-08 22:55:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:48,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 279 [2025-01-08 22:55:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:48,710 INFO L225 Difference]: With dead ends: 68320 [2025-01-08 22:55:48,710 INFO L226 Difference]: Without dead ends: 38547 [2025-01-08 22:55:48,738 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 22:55:48,739 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 214 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:48,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 331 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38547 states. [2025-01-08 22:55:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38547 to 38520. [2025-01-08 22:55:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38520 states, 38519 states have (on average 1.2328461278849399) internal successors, (47488), 38519 states have internal predecessors, (47488), 0 states have call successors, (0), 0 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 22:55:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38520 states to 38520 states and 47488 transitions. [2025-01-08 22:55:49,262 INFO L78 Accepts]: Start accepts. Automaton has 38520 states and 47488 transitions. Word has length 279 [2025-01-08 22:55:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:49,262 INFO L471 AbstractCegarLoop]: Abstraction has 38520 states and 47488 transitions. [2025-01-08 22:55:49,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:55:49,262 INFO L276 IsEmpty]: Start isEmpty. Operand 38520 states and 47488 transitions. [2025-01-08 22:55:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-08 22:55:49,288 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:49,289 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:55:49,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:55:49,289 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:49,290 INFO L85 PathProgramCache]: Analyzing trace with hash 634315612, now seen corresponding path program 1 times [2025-01-08 22:55:49,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:49,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035305230] [2025-01-08 22:55:49,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:49,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:49,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-08 22:55:49,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-08 22:55:49,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:49,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035305230] [2025-01-08 22:55:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035305230] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:49,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:49,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814244663] [2025-01-08 22:55:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:49,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:49,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:49,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:49,502 INFO L87 Difference]: Start difference. First operand 38520 states and 47488 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 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 22:55:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:50,329 INFO L93 Difference]: Finished difference Result 105107 states and 130652 transitions. [2025-01-08 22:55:50,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 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 281 [2025-01-08 22:55:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:50,418 INFO L225 Difference]: With dead ends: 105107 [2025-01-08 22:55:50,419 INFO L226 Difference]: Without dead ends: 66589 [2025-01-08 22:55:50,454 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 22:55:50,455 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 163 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:50,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 139 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:50,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66589 states. [2025-01-08 22:55:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66589 to 66565. [2025-01-08 22:55:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66565 states, 66564 states have (on average 1.215957574664984) internal successors, (80939), 66564 states have internal predecessors, (80939), 0 states have call successors, (0), 0 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 22:55:51,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66565 states to 66565 states and 80939 transitions. [2025-01-08 22:55:51,439 INFO L78 Accepts]: Start accepts. Automaton has 66565 states and 80939 transitions. Word has length 281 [2025-01-08 22:55:51,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:51,439 INFO L471 AbstractCegarLoop]: Abstraction has 66565 states and 80939 transitions. [2025-01-08 22:55:51,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 2 states have internal predecessors, (281), 0 states have call successors, (0), 0 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 22:55:51,440 INFO L276 IsEmpty]: Start isEmpty. Operand 66565 states and 80939 transitions. [2025-01-08 22:55:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-08 22:55:51,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:51,481 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:51,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:55:51,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash 776834835, now seen corresponding path program 1 times [2025-01-08 22:55:51,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:51,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811576419] [2025-01-08 22:55:51,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:51,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:51,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-08 22:55:51,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-08 22:55:51,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:51,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:51,730 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:55:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811576419] [2025-01-08 22:55:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811576419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:51,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:51,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139791459] [2025-01-08 22:55:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:51,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:51,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:51,732 INFO L87 Difference]: Start difference. First operand 66565 states and 80939 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 22:55:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:52,797 INFO L93 Difference]: Finished difference Result 170176 states and 206804 transitions. [2025-01-08 22:55:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:52,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 292 [2025-01-08 22:55:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:52,929 INFO L225 Difference]: With dead ends: 170176 [2025-01-08 22:55:52,929 INFO L226 Difference]: Without dead ends: 103613 [2025-01-08 22:55:52,982 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 22:55:52,982 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 204 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:52,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 113 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:55:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103613 states. [2025-01-08 22:55:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103613 to 103604. [2025-01-08 22:55:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103604 states, 103603 states have (on average 1.2122911498701776) internal successors, (125597), 103603 states have internal predecessors, (125597), 0 states have call successors, (0), 0 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 22:55:54,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103604 states to 103604 states and 125597 transitions. [2025-01-08 22:55:54,348 INFO L78 Accepts]: Start accepts. Automaton has 103604 states and 125597 transitions. Word has length 292 [2025-01-08 22:55:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:54,348 INFO L471 AbstractCegarLoop]: Abstraction has 103604 states and 125597 transitions. [2025-01-08 22:55:54,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 2 states have internal predecessors, (232), 0 states have call successors, (0), 0 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 22:55:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 103604 states and 125597 transitions. [2025-01-08 22:55:54,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-08 22:55:54,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:54,395 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:54,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:55:54,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:54,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:54,397 INFO L85 PathProgramCache]: Analyzing trace with hash -214977703, now seen corresponding path program 1 times [2025-01-08 22:55:54,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:54,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996968454] [2025-01-08 22:55:54,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:54,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:54,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 22:55:54,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 22:55:54,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:54,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:55:54,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996968454] [2025-01-08 22:55:54,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996968454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:55:54,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708778988] [2025-01-08 22:55:54,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:54,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:54,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:54,777 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 22:55:54,779 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 22:55:54,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-08 22:55:55,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-08 22:55:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:55,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:55,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:55:55,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:55:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:55:55,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:55:55,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708778988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:55,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:55:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 22:55:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958264029] [2025-01-08 22:55:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:55,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:55,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:55,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:55,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:55,169 INFO L87 Difference]: Start difference. First operand 103604 states and 125597 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 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 22:55:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:56,529 INFO L93 Difference]: Finished difference Result 260931 states and 318618 transitions. [2025-01-08 22:55:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:56,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2025-01-08 22:55:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:56,752 INFO L225 Difference]: With dead ends: 260931 [2025-01-08 22:55:56,752 INFO L226 Difference]: Without dead ends: 157329 [2025-01-08 22:55:56,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:55:56,838 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 192 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 123 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:55:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157329 states. [2025-01-08 22:55:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157329 to 157274. [2025-01-08 22:55:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157274 states, 157273 states have (on average 1.2043580271248084) internal successors, (189413), 157273 states have internal predecessors, (189413), 0 states have call successors, (0), 0 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 22:55:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157274 states to 157274 states and 189413 transitions. [2025-01-08 22:55:58,837 INFO L78 Accepts]: Start accepts. Automaton has 157274 states and 189413 transitions. Word has length 299 [2025-01-08 22:55:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:58,837 INFO L471 AbstractCegarLoop]: Abstraction has 157274 states and 189413 transitions. [2025-01-08 22:55:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 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 22:55:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 157274 states and 189413 transitions. [2025-01-08 22:55:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-08 22:55:59,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:59,188 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:55:59,200 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 22:55:59,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:55:59,395 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:59,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2017547164, now seen corresponding path program 1 times [2025-01-08 22:55:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004699876] [2025-01-08 22:55:59,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:59,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-08 22:55:59,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-08 22:55:59,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:59,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-08 22:55:59,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:59,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004699876] [2025-01-08 22:55:59,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004699876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:59,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:59,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:55:59,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480458286] [2025-01-08 22:55:59,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:59,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:59,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:59,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:59,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:59,505 INFO L87 Difference]: Start difference. First operand 157274 states and 189413 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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 22:56:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:01,042 INFO L93 Difference]: Finished difference Result 310084 states and 373568 transitions. [2025-01-08 22:56:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 306 [2025-01-08 22:56:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:01,247 INFO L225 Difference]: With dead ends: 310084 [2025-01-08 22:56:01,247 INFO L226 Difference]: Without dead ends: 152812 [2025-01-08 22:56:01,296 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 22:56:01,297 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 224 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:01,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 320 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152812 states. [2025-01-08 22:56:03,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152812 to 149928. [2025-01-08 22:56:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149928 states, 149927 states have (on average 1.1618320916179208) internal successors, (174190), 149927 states have internal predecessors, (174190), 0 states have call successors, (0), 0 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 22:56:03,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149928 states to 149928 states and 174190 transitions. [2025-01-08 22:56:03,502 INFO L78 Accepts]: Start accepts. Automaton has 149928 states and 174190 transitions. Word has length 306 [2025-01-08 22:56:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:03,502 INFO L471 AbstractCegarLoop]: Abstraction has 149928 states and 174190 transitions. [2025-01-08 22:56:03,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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 22:56:03,502 INFO L276 IsEmpty]: Start isEmpty. Operand 149928 states and 174190 transitions. [2025-01-08 22:56:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-01-08 22:56:03,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:03,555 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:03,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:56:03,555 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:03,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -82175774, now seen corresponding path program 1 times [2025-01-08 22:56:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356106553] [2025-01-08 22:56:03,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:03,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-01-08 22:56:03,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-01-08 22:56:03,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:03,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-01-08 22:56:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356106553] [2025-01-08 22:56:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356106553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:03,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361447349] [2025-01-08 22:56:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:03,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:03,931 INFO L87 Difference]: Start difference. First operand 149928 states and 174190 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:05,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:05,093 INFO L93 Difference]: Finished difference Result 265721 states and 309171 transitions. [2025-01-08 22:56:05,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:05,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-01-08 22:56:05,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:05,241 INFO L225 Difference]: With dead ends: 265721 [2025-01-08 22:56:05,241 INFO L226 Difference]: Without dead ends: 115795 [2025-01-08 22:56:05,304 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 22:56:05,305 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 579 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:05,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 60 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115795 states. [2025-01-08 22:56:06,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115795 to 115783. [2025-01-08 22:56:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115783 states, 115782 states have (on average 1.1414123093399664) internal successors, (132155), 115782 states have internal predecessors, (132155), 0 states have call successors, (0), 0 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 22:56:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115783 states to 115783 states and 132155 transitions. [2025-01-08 22:56:06,974 INFO L78 Accepts]: Start accepts. Automaton has 115783 states and 132155 transitions. Word has length 316 [2025-01-08 22:56:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:06,974 INFO L471 AbstractCegarLoop]: Abstraction has 115783 states and 132155 transitions. [2025-01-08 22:56:06,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:56:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 115783 states and 132155 transitions. [2025-01-08 22:56:07,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 22:56:07,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:07,022 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:07,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:56:07,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:07,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:07,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1823221691, now seen corresponding path program 1 times [2025-01-08 22:56:07,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:07,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850212065] [2025-01-08 22:56:07,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:07,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:07,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:56:07,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:56:07,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:07,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 117 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-08 22:56:07,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850212065] [2025-01-08 22:56:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850212065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:07,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46138190] [2025-01-08 22:56:07,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:07,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:07,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:07,433 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 22:56:07,441 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 22:56:07,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 22:56:07,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 22:56:07,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:07,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:07,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:07,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:07,635 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-01-08 22:56:07,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46138190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:07,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:07,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:07,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461914367] [2025-01-08 22:56:07,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:07,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:07,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:07,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:07,637 INFO L87 Difference]: Start difference. First operand 115783 states and 132155 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 22:56:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:08,782 INFO L93 Difference]: Finished difference Result 288736 states and 330073 transitions. [2025-01-08 22:56:08,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:08,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 336 [2025-01-08 22:56:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:08,982 INFO L225 Difference]: With dead ends: 288736 [2025-01-08 22:56:08,983 INFO L226 Difference]: Without dead ends: 172955 [2025-01-08 22:56:09,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:09,053 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 225 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:09,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 108 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172955 states. [2025-01-08 22:56:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172955 to 172927. [2025-01-08 22:56:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172927 states, 172926 states have (on average 1.1305703017475683) internal successors, (195505), 172926 states have internal predecessors, (195505), 0 states have call successors, (0), 0 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 22:56:11,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172927 states to 172927 states and 195505 transitions. [2025-01-08 22:56:11,540 INFO L78 Accepts]: Start accepts. Automaton has 172927 states and 195505 transitions. Word has length 336 [2025-01-08 22:56:11,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:11,540 INFO L471 AbstractCegarLoop]: Abstraction has 172927 states and 195505 transitions. [2025-01-08 22:56:11,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 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 22:56:11,540 INFO L276 IsEmpty]: Start isEmpty. Operand 172927 states and 195505 transitions. [2025-01-08 22:56:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-08 22:56:11,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:11,601 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:56:11,607 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 22:56:11,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:11,802 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:11,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 489688249, now seen corresponding path program 1 times [2025-01-08 22:56:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:11,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165875103] [2025-01-08 22:56:11,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:11,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:11,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-08 22:56:11,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-08 22:56:11,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:11,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 118 proven. 6 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-08 22:56:12,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165875103] [2025-01-08 22:56:12,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165875103] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:12,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838850902] [2025-01-08 22:56:12,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:12,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:12,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:12,241 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:56:12,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:56:12,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-08 22:56:12,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-08 22:56:12,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:12,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:12,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:12,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-01-08 22:56:12,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:12,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838850902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:12,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:12,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579131052] [2025-01-08 22:56:12,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:12,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:12,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:12,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:12,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:12,440 INFO L87 Difference]: Start difference. First operand 172927 states and 195505 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 22:56:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:13,967 INFO L93 Difference]: Finished difference Result 384842 states and 437991 transitions. [2025-01-08 22:56:13,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 337 [2025-01-08 22:56:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:14,238 INFO L225 Difference]: With dead ends: 384842 [2025-01-08 22:56:14,238 INFO L226 Difference]: Without dead ends: 211917 [2025-01-08 22:56:14,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:14,322 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:14,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 365 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211917 states. [2025-01-08 22:56:16,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211917 to 191975. [2025-01-08 22:56:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191975 states, 191974 states have (on average 1.1005709106441497) internal successors, (211281), 191974 states have internal predecessors, (211281), 0 states have call successors, (0), 0 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 22:56:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191975 states to 191975 states and 211281 transitions. [2025-01-08 22:56:17,098 INFO L78 Accepts]: Start accepts. Automaton has 191975 states and 211281 transitions. Word has length 337 [2025-01-08 22:56:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:17,098 INFO L471 AbstractCegarLoop]: Abstraction has 191975 states and 211281 transitions. [2025-01-08 22:56:17,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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 22:56:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 191975 states and 211281 transitions. [2025-01-08 22:56:17,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-01-08 22:56:17,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:17,146 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:17,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:56:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-08 22:56:17,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:17,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1571216633, now seen corresponding path program 1 times [2025-01-08 22:56:17,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:17,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260457213] [2025-01-08 22:56:17,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:17,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:17,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-08 22:56:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-08 22:56:17,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-01-08 22:56:17,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:17,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260457213] [2025-01-08 22:56:17,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260457213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:17,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:17,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:17,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977075425] [2025-01-08 22:56:17,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:17,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:17,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:17,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:17,556 INFO L87 Difference]: Start difference. First operand 191975 states and 211281 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 22:56:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:19,097 INFO L93 Difference]: Finished difference Result 382640 states and 420944 transitions. [2025-01-08 22:56:19,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:19,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 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 402 [2025-01-08 22:56:19,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:19,326 INFO L225 Difference]: With dead ends: 382640 [2025-01-08 22:56:19,326 INFO L226 Difference]: Without dead ends: 190667 [2025-01-08 22:56:19,810 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 22:56:19,811 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 156 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:19,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 169 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:56:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190667 states. [2025-01-08 22:56:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190667 to 189330. [2025-01-08 22:56:21,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189330 states, 189329 states have (on average 1.0973913135335844) internal successors, (207768), 189329 states have internal predecessors, (207768), 0 states have call successors, (0), 0 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 22:56:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189330 states to 189330 states and 207768 transitions. [2025-01-08 22:56:22,065 INFO L78 Accepts]: Start accepts. Automaton has 189330 states and 207768 transitions. Word has length 402 [2025-01-08 22:56:22,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:22,066 INFO L471 AbstractCegarLoop]: Abstraction has 189330 states and 207768 transitions. [2025-01-08 22:56:22,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 2 states have internal predecessors, (280), 0 states have call successors, (0), 0 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 22:56:22,066 INFO L276 IsEmpty]: Start isEmpty. Operand 189330 states and 207768 transitions. [2025-01-08 22:56:22,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-01-08 22:56:22,116 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:22,116 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:56:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:56:22,116 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash -936272943, now seen corresponding path program 1 times [2025-01-08 22:56:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113547645] [2025-01-08 22:56:22,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:22,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:22,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-01-08 22:56:22,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-01-08 22:56:22,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:22,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:22,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:22,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113547645] [2025-01-08 22:56:22,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113547645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:56:22,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941782562] [2025-01-08 22:56:22,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:22,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:22,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:22,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:22,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:22,805 INFO L87 Difference]: Start difference. First operand 189330 states and 207768 transitions. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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 22:56:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:24,514 INFO L93 Difference]: Finished difference Result 308384 states and 338323 transitions. [2025-01-08 22:56:24,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:24,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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 421 [2025-01-08 22:56:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:24,631 INFO L225 Difference]: With dead ends: 308384 [2025-01-08 22:56:24,631 INFO L226 Difference]: Without dead ends: 97944 [2025-01-08 22:56:24,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 22:56:24,686 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 351 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:24,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 86 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:56:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97944 states. [2025-01-08 22:56:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97944 to 85060. [2025-01-08 22:56:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85060 states, 85059 states have (on average 1.0618159160112393) internal successors, (90317), 85059 states have internal predecessors, (90317), 0 states have call successors, (0), 0 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 22:56:25,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85060 states to 85060 states and 90317 transitions. [2025-01-08 22:56:25,768 INFO L78 Accepts]: Start accepts. Automaton has 85060 states and 90317 transitions. Word has length 421 [2025-01-08 22:56:25,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:25,768 INFO L471 AbstractCegarLoop]: Abstraction has 85060 states and 90317 transitions. [2025-01-08 22:56:25,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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 22:56:25,769 INFO L276 IsEmpty]: Start isEmpty. Operand 85060 states and 90317 transitions. [2025-01-08 22:56:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-01-08 22:56:25,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:25,801 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:56:25,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:56:25,802 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:25,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash 843588155, now seen corresponding path program 1 times [2025-01-08 22:56:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756212794] [2025-01-08 22:56:25,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:25,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-01-08 22:56:25,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-01-08 22:56:25,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:25,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:26,446 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 449 proven. 18 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 22:56:26,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756212794] [2025-01-08 22:56:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756212794] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603449670] [2025-01-08 22:56:26,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:26,450 INFO L229 MonitoredProcess]: Starting monitored process 6 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 22:56:26,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:56:26,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-01-08 22:56:26,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-01-08 22:56:26,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:26,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:26,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:26,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2025-01-08 22:56:26,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603449670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 22:56:26,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546584904] [2025-01-08 22:56:26,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:26,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:26,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:56:26,774 INFO L87 Difference]: Start difference. First operand 85060 states and 90317 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 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 22:56:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:27,098 INFO L93 Difference]: Finished difference Result 165017 states and 175191 transitions. [2025-01-08 22:56:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:27,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 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 472 [2025-01-08 22:56:27,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:27,177 INFO L225 Difference]: With dead ends: 165017 [2025-01-08 22:56:27,178 INFO L226 Difference]: Without dead ends: 79959 [2025-01-08 22:56:27,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:56:27,225 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:27,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 238 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:56:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79959 states.