./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i --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/hardness-nfm22/hardness_operatoramount_amount250_file-46.i -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 b28318b64c584c946b04c5086a6c24adb23afe0fc28f8c52df4df9b28156611e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:24:18,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:24:18,333 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:24:18,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:24:18,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:24:18,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:24:18,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:24:18,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:24:18,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:24:18,355 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:24:18,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:24:18,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:24:18,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:24:18,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:24:18,355 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:24:18,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:24:18,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:24:18,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:18,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:24:18,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:18,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:24:18,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:24:18,358 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 -> b28318b64c584c946b04c5086a6c24adb23afe0fc28f8c52df4df9b28156611e [2025-01-09 14:24:18,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:24:18,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:24:18,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:24:18,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:24:18,603 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:24:18,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i [2025-01-09 14:24:19,781 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c413b5ff9/074b7b2a643e48fbaec40cc42f8aa404/FLAGa639f47c2 [2025-01-09 14:24:20,070 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:24:20,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-46.i [2025-01-09 14:24:20,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c413b5ff9/074b7b2a643e48fbaec40cc42f8aa404/FLAGa639f47c2 [2025-01-09 14:24:20,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c413b5ff9/074b7b2a643e48fbaec40cc42f8aa404 [2025-01-09 14:24:20,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:24:20,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:24:20,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:24:20,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:24:20,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:24:20,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20, skipping insertion in model container [2025-01-09 14:24:20,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:24:20,473 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/hardness-nfm22/hardness_operatoramount_amount250_file-46.i[916,929] [2025-01-09 14:24:20,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:24:20,637 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:24:20,648 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/hardness-nfm22/hardness_operatoramount_amount250_file-46.i[916,929] [2025-01-09 14:24:20,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:24:20,752 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:24:20,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20 WrapperNode [2025-01-09 14:24:20,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:24:20,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:24:20,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:24:20,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:24:20,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,810 INFO L138 Inliner]: procedures = 26, calls = 69, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2025-01-09 14:24:20,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:24:20,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:24:20,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:24:20,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:24:20,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,865 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-09 14:24:20,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,886 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:24:20,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:24:20,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:24:20,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:24:20,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (1/1) ... [2025-01-09 14:24:20,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:24:20,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:20,943 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-09 14:24:20,949 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-09 14:24:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:24:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:24:20,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:24:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:24:20,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:24:20,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:24:21,071 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:24:21,072 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:24:21,650 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-01-09 14:24:21,651 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:24:21,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:24:21,667 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:24:21,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:24:21 BoogieIcfgContainer [2025-01-09 14:24:21,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:24:21,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:24:21,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:24:21,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:24:21,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:24:20" (1/3) ... [2025-01-09 14:24:21,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2147b5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:24:21, skipping insertion in model container [2025-01-09 14:24:21,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:24:20" (2/3) ... [2025-01-09 14:24:21,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2147b5ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:24:21, skipping insertion in model container [2025-01-09 14:24:21,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:24:21" (3/3) ... [2025-01-09 14:24:21,679 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-46.i [2025-01-09 14:24:21,690 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:24:21,692 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-46.i that has 2 procedures, 174 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:24:21,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:24:21,748 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;@6f68937, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:24:21,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:24:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 116 states have internal predecessors, (163), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:24:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:21,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:21,798 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:21,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash -507805150, now seen corresponding path program 1 times [2025-01-09 14:24:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:21,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762598523] [2025-01-09 14:24:21,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:21,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:21,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:21,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:21,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:22,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-01-09 14:24:22,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762598523] [2025-01-09 14:24:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762598523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181328340] [2025-01-09 14:24:22,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:22,306 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-09 14:24:22,308 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-09 14:24:22,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:22,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:22,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:22,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:22,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:24:22,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 6050 trivial. 0 not checked. [2025-01-09 14:24:22,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:24:22,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181328340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:22,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:24:22,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:24:22,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347597636] [2025-01-09 14:24:22,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:22,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:24:22,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:22,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:24:22,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:24:22,636 INFO L87 Difference]: Start difference. First operand has 174 states, 115 states have (on average 1.4173913043478261) internal successors, (163), 116 states have internal predecessors, (163), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 14:24:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:22,683 INFO L93 Difference]: Finished difference Result 342 states and 601 transitions. [2025-01-09 14:24:22,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:24:22,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) Word has length 365 [2025-01-09 14:24:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:22,693 INFO L225 Difference]: With dead ends: 342 [2025-01-09 14:24:22,693 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 14:24:22,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:24:22,701 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:22,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 14:24:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-01-09 14:24:22,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 113 states have internal predecessors, (158), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:24:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 270 transitions. [2025-01-09 14:24:22,754 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 270 transitions. Word has length 365 [2025-01-09 14:24:22,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:22,755 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 270 transitions. [2025-01-09 14:24:22,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (56), 2 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 2 states have call successors, (56) [2025-01-09 14:24:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 270 transitions. [2025-01-09 14:24:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:22,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:22,762 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:22,774 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-09 14:24:22,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 14:24:22,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:22,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1084990054, now seen corresponding path program 1 times [2025-01-09 14:24:22,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:22,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215461956] [2025-01-09 14:24:22,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:22,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:23,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:23,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:23,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:23,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:24:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:23,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215461956] [2025-01-09 14:24:23,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215461956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:23,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:23,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:24:23,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970179158] [2025-01-09 14:24:23,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:23,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:24:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:23,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:24:23,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:24:23,315 INFO L87 Difference]: Start difference. First operand 171 states and 270 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:24:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:23,358 INFO L93 Difference]: Finished difference Result 340 states and 539 transitions. [2025-01-09 14:24:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:24:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-01-09 14:24:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:23,361 INFO L225 Difference]: With dead ends: 340 [2025-01-09 14:24:23,361 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 14:24:23,362 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-09 14:24:23,363 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:23,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:24:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 14:24:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-01-09 14:24:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 114 states have (on average 1.394736842105263) internal successors, (159), 114 states have internal predecessors, (159), 56 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 14:24:23,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 271 transitions. [2025-01-09 14:24:23,387 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 271 transitions. Word has length 365 [2025-01-09 14:24:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:23,389 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 271 transitions. [2025-01-09 14:24:23,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:24:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 271 transitions. [2025-01-09 14:24:23,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:23,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:23,395 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:23,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:24:23,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:23,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:23,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1594463144, now seen corresponding path program 1 times [2025-01-09 14:24:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:23,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833306539] [2025-01-09 14:24:23,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:23,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:23,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:23,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:23,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:24:25,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:25,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833306539] [2025-01-09 14:24:25,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833306539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:25,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:25,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:24:25,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240158694] [2025-01-09 14:24:25,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:25,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:24:25,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:25,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:24:25,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:24:25,096 INFO L87 Difference]: Start difference. First operand 172 states and 271 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:24:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:25,644 INFO L93 Difference]: Finished difference Result 603 states and 948 transitions. [2025-01-09 14:24:25,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:24:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-01-09 14:24:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:25,652 INFO L225 Difference]: With dead ends: 603 [2025-01-09 14:24:25,653 INFO L226 Difference]: Without dead ends: 434 [2025-01-09 14:24:25,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:24:25,655 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 412 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:25,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 990 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:24:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-01-09 14:24:25,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 320. [2025-01-09 14:24:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 225 states have (on average 1.4266666666666667) internal successors, (321), 226 states have internal predecessors, (321), 92 states have call successors, (92), 2 states have call predecessors, (92), 2 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 14:24:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 505 transitions. [2025-01-09 14:24:25,704 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 505 transitions. Word has length 365 [2025-01-09 14:24:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:25,705 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 505 transitions. [2025-01-09 14:24:25,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:24:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 505 transitions. [2025-01-09 14:24:25,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:25,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:25,710 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:25,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:24:25,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:25,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:25,711 INFO L85 PathProgramCache]: Analyzing trace with hash 651116310, now seen corresponding path program 1 times [2025-01-09 14:24:25,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:25,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836745698] [2025-01-09 14:24:25,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:25,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:26,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:26,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:26,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:24:27,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836745698] [2025-01-09 14:24:27,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836745698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:27,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403758064] [2025-01-09 14:24:27,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:27,563 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-09 14:24:27,582 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-09 14:24:27,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:27,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:27,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:27,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:27,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:24:27,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3404 proven. 210 refuted. 0 times theorem prover too weak. 2546 trivial. 0 not checked. [2025-01-09 14:24:28,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 114 proven. 213 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-01-09 14:24:29,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403758064] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:29,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:29,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2025-01-09 14:24:29,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166899848] [2025-01-09 14:24:29,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:29,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:24:29,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:29,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:24:29,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:24:29,295 INFO L87 Difference]: Start difference. First operand 320 states and 505 transitions. Second operand has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 6 states have call successors, (134), 3 states have call predecessors, (134), 7 states have return successors, (136), 6 states have call predecessors, (136), 6 states have call successors, (136) [2025-01-09 14:24:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:30,630 INFO L93 Difference]: Finished difference Result 722 states and 1098 transitions. [2025-01-09 14:24:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 14:24:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 6 states have call successors, (134), 3 states have call predecessors, (134), 7 states have return successors, (136), 6 states have call predecessors, (136), 6 states have call successors, (136) Word has length 365 [2025-01-09 14:24:30,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:30,635 INFO L225 Difference]: With dead ends: 722 [2025-01-09 14:24:30,635 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 14:24:30,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=524, Invalid=1546, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 14:24:30,637 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 699 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:30,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 953 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:24:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 14:24:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 376. [2025-01-09 14:24:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 259 states have (on average 1.3436293436293436) internal successors, (348), 261 states have internal predecessors, (348), 106 states have call successors, (106), 10 states have call predecessors, (106), 10 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-01-09 14:24:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 560 transitions. [2025-01-09 14:24:30,666 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 560 transitions. Word has length 365 [2025-01-09 14:24:30,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:30,666 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 560 transitions. [2025-01-09 14:24:30,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.882352941176471) internal successors, (185), 17 states have internal predecessors, (185), 6 states have call successors, (134), 3 states have call predecessors, (134), 7 states have return successors, (136), 6 states have call predecessors, (136), 6 states have call successors, (136) [2025-01-09 14:24:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 560 transitions. [2025-01-09 14:24:30,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:30,674 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:30,674 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:30,692 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-09 14:24:30,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:30,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:30,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1994489812, now seen corresponding path program 1 times [2025-01-09 14:24:30,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:30,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233023690] [2025-01-09 14:24:30,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:30,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:30,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:31,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:31,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:31,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:31,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 99 proven. 66 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:24:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:31,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233023690] [2025-01-09 14:24:31,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233023690] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:31,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124841237] [2025-01-09 14:24:31,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:31,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:31,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:31,682 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-09 14:24:31,684 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-09 14:24:31,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:31,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:31,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:31,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:31,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 14:24:31,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3539 proven. 135 refuted. 0 times theorem prover too weak. 2486 trivial. 0 not checked. [2025-01-09 14:24:33,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:33,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 30 proven. 135 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:24:33,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124841237] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:33,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:33,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-01-09 14:24:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207086176] [2025-01-09 14:24:33,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:33,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 14:24:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:33,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 14:24:33,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:24:33,425 INFO L87 Difference]: Start difference. First operand 376 states and 560 transitions. Second operand has 17 states, 17 states have (on average 12.705882352941176) internal successors, (216), 17 states have internal predecessors, (216), 8 states have call successors, (168), 4 states have call predecessors, (168), 7 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-01-09 14:24:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:34,789 INFO L93 Difference]: Finished difference Result 773 states and 1131 transitions. [2025-01-09 14:24:34,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 14:24:34,789 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.705882352941176) internal successors, (216), 17 states have internal predecessors, (216), 8 states have call successors, (168), 4 states have call predecessors, (168), 7 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) Word has length 365 [2025-01-09 14:24:34,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:34,794 INFO L225 Difference]: With dead ends: 773 [2025-01-09 14:24:34,794 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 14:24:34,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 720 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=529, Invalid=1541, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 14:24:34,798 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1356 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 856 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:34,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 940 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [856 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 14:24:34,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 14:24:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 413. [2025-01-09 14:24:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 274 states have (on average 1.2919708029197081) internal successors, (354), 275 states have internal predecessors, (354), 122 states have call successors, (122), 16 states have call predecessors, (122), 16 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 14:24:34,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 598 transitions. [2025-01-09 14:24:34,840 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 598 transitions. Word has length 365 [2025-01-09 14:24:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:34,841 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 598 transitions. [2025-01-09 14:24:34,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.705882352941176) internal successors, (216), 17 states have internal predecessors, (216), 8 states have call successors, (168), 4 states have call predecessors, (168), 7 states have return successors, (168), 8 states have call predecessors, (168), 8 states have call successors, (168) [2025-01-09 14:24:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 598 transitions. [2025-01-09 14:24:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:34,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:34,847 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:34,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:24:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:35,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:35,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:35,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1562043414, now seen corresponding path program 1 times [2025-01-09 14:24:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462327847] [2025-01-09 14:24:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:35,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:35,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:35,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:35,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6160 trivial. 0 not checked. [2025-01-09 14:24:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:35,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462327847] [2025-01-09 14:24:35,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462327847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:24:35,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:24:35,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:24:35,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630924643] [2025-01-09 14:24:35,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:24:35,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:24:35,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:35,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:24:35,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:24:35,667 INFO L87 Difference]: Start difference. First operand 413 states and 598 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:24:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:35,783 INFO L93 Difference]: Finished difference Result 831 states and 1216 transitions. [2025-01-09 14:24:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:24:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) Word has length 365 [2025-01-09 14:24:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:35,787 INFO L225 Difference]: With dead ends: 831 [2025-01-09 14:24:35,787 INFO L226 Difference]: Without dead ends: 543 [2025-01-09 14:24:35,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:24:35,788 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 216 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 838 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:24:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-09 14:24:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 439. [2025-01-09 14:24:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 300 states have (on average 1.3066666666666666) internal successors, (392), 301 states have internal predecessors, (392), 122 states have call successors, (122), 16 states have call predecessors, (122), 16 states have return successors, (122), 121 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 14:24:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 636 transitions. [2025-01-09 14:24:35,827 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 636 transitions. Word has length 365 [2025-01-09 14:24:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:35,828 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 636 transitions. [2025-01-09 14:24:35,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (56), 1 states have call predecessors, (56), 1 states have return successors, (56), 1 states have call predecessors, (56), 1 states have call successors, (56) [2025-01-09 14:24:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 636 transitions. [2025-01-09 14:24:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 14:24:35,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:35,830 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:35,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:24:35,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:35,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash -487344428, now seen corresponding path program 1 times [2025-01-09 14:24:35,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:35,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56570532] [2025-01-09 14:24:35,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:35,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:35,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:36,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:36,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:36,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:36,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 57 proven. 108 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:24:36,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:36,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56570532] [2025-01-09 14:24:36,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56570532] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:36,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876052899] [2025-01-09 14:24:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:36,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:36,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:36,536 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-09 14:24:36,538 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-09 14:24:36,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 14:24:36,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 14:24:36,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:36,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:36,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:24:36,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3482 proven. 228 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-01-09 14:24:37,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:37,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 96 proven. 231 refuted. 0 times theorem prover too weak. 5833 trivial. 0 not checked. [2025-01-09 14:24:37,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876052899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:37,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:37,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2025-01-09 14:24:37,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617842485] [2025-01-09 14:24:37,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:37,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 14:24:37,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:37,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 14:24:37,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-01-09 14:24:37,751 INFO L87 Difference]: Start difference. First operand 439 states and 636 transitions. Second operand has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 6 states have call successors, (146), 3 states have call predecessors, (146), 7 states have return successors, (148), 6 states have call predecessors, (148), 6 states have call successors, (148) [2025-01-09 14:24:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:38,312 INFO L93 Difference]: Finished difference Result 764 states and 1096 transitions. [2025-01-09 14:24:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 14:24:38,313 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 6 states have call successors, (146), 3 states have call predecessors, (146), 7 states have return successors, (148), 6 states have call predecessors, (148), 6 states have call successors, (148) Word has length 365 [2025-01-09 14:24:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:38,316 INFO L225 Difference]: With dead ends: 764 [2025-01-09 14:24:38,317 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 14:24:38,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 747 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2025-01-09 14:24:38,318 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 459 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:38,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 707 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:24:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 14:24:38,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 341. [2025-01-09 14:24:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 210 states have (on average 1.1952380952380952) internal successors, (251), 211 states have internal predecessors, (251), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-01-09 14:24:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 475 transitions. [2025-01-09 14:24:38,359 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 475 transitions. Word has length 365 [2025-01-09 14:24:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:38,360 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 475 transitions. [2025-01-09 14:24:38,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.733333333333333) internal successors, (176), 15 states have internal predecessors, (176), 6 states have call successors, (146), 3 states have call predecessors, (146), 7 states have return successors, (148), 6 states have call predecessors, (148), 6 states have call successors, (148) [2025-01-09 14:24:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 475 transitions. [2025-01-09 14:24:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 14:24:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:38,362 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:38,369 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-09 14:24:38,562 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,SelfDestructingSolverStorable6 [2025-01-09 14:24:38,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:38,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash 265775017, now seen corresponding path program 1 times [2025-01-09 14:24:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:38,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45355536] [2025-01-09 14:24:38,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:38,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:24:39,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:24:39,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:39,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:43,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 261 proven. 363 refuted. 0 times theorem prover too weak. 5536 trivial. 0 not checked. [2025-01-09 14:24:43,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45355536] [2025-01-09 14:24:43,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45355536] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:43,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315216499] [2025-01-09 14:24:43,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:43,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:43,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:43,323 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-09 14:24:43,324 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-09 14:24:43,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:24:43,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:24:43,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:43,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:43,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 14:24:43,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 4665 proven. 303 refuted. 0 times theorem prover too weak. 1192 trivial. 0 not checked. [2025-01-09 14:24:45,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:24:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 297 proven. 189 refuted. 0 times theorem prover too weak. 5674 trivial. 0 not checked. [2025-01-09 14:24:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315216499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:24:49,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:24:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 43 [2025-01-09 14:24:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842685968] [2025-01-09 14:24:49,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:24:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-01-09 14:24:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:24:49,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-01-09 14:24:49,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=1484, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 14:24:49,761 INFO L87 Difference]: Start difference. First operand 341 states and 475 transitions. Second operand has 43 states, 42 states have (on average 6.190476190476191) internal successors, (260), 42 states have internal predecessors, (260), 17 states have call successors, (157), 6 states have call predecessors, (157), 12 states have return successors, (158), 16 states have call predecessors, (158), 17 states have call successors, (158) [2025-01-09 14:24:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:24:57,341 INFO L93 Difference]: Finished difference Result 1304 states and 1783 transitions. [2025-01-09 14:24:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2025-01-09 14:24:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 6.190476190476191) internal successors, (260), 42 states have internal predecessors, (260), 17 states have call successors, (157), 6 states have call predecessors, (157), 12 states have return successors, (158), 16 states have call predecessors, (158), 17 states have call successors, (158) Word has length 366 [2025-01-09 14:24:57,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:24:57,346 INFO L225 Difference]: With dead ends: 1304 [2025-01-09 14:24:57,346 INFO L226 Difference]: Without dead ends: 1091 [2025-01-09 14:24:57,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 870 GetRequests, 727 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6702 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3517, Invalid=17075, Unknown=0, NotChecked=0, Total=20592 [2025-01-09 14:24:57,351 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 5046 mSDsluCounter, 2686 mSDsCounter, 0 mSdLazyCounter, 4103 mSolverCounterSat, 1342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1342 IncrementalHoareTripleChecker+Valid, 4103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:24:57,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 3019 Invalid, 5445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1342 Valid, 4103 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-09 14:24:57,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1091 states. [2025-01-09 14:24:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1091 to 930. [2025-01-09 14:24:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 653 states have (on average 1.2542113323124042) internal successors, (819), 656 states have internal predecessors, (819), 224 states have call successors, (224), 52 states have call predecessors, (224), 52 states have return successors, (224), 221 states have call predecessors, (224), 224 states have call successors, (224) [2025-01-09 14:24:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1267 transitions. [2025-01-09 14:24:57,478 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1267 transitions. Word has length 366 [2025-01-09 14:24:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:24:57,479 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1267 transitions. [2025-01-09 14:24:57,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 6.190476190476191) internal successors, (260), 42 states have internal predecessors, (260), 17 states have call successors, (157), 6 states have call predecessors, (157), 12 states have return successors, (158), 16 states have call predecessors, (158), 17 states have call successors, (158) [2025-01-09 14:24:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1267 transitions. [2025-01-09 14:24:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 14:24:57,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:24:57,481 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:24:57,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 14:24:57,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:57,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:24:57,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:24:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash 967374891, now seen corresponding path program 1 times [2025-01-09 14:24:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:24:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931143132] [2025-01-09 14:24:57,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:24:57,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:24:58,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:24:58,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 126 proven. 39 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:24:59,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:24:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931143132] [2025-01-09 14:24:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931143132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:24:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332851355] [2025-01-09 14:24:59,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:24:59,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:24:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:24:59,241 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:24:59,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:24:59,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:24:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:24:59,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:24:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:24:59,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 14:24:59,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:24:59,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2323 proven. 39 refuted. 0 times theorem prover too weak. 3798 trivial. 0 not checked. [2025-01-09 14:24:59,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 126 proven. 39 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:25:00,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332851355] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:00,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:00,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2025-01-09 14:25:00,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793566222] [2025-01-09 14:25:00,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:00,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 14:25:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:00,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 14:25:00,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-01-09 14:25:00,175 INFO L87 Difference]: Start difference. First operand 930 states and 1267 transitions. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-01-09 14:25:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:02,060 INFO L93 Difference]: Finished difference Result 3090 states and 4205 transitions. [2025-01-09 14:25:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:25:02,061 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) Word has length 366 [2025-01-09 14:25:02,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:02,069 INFO L225 Difference]: With dead ends: 3090 [2025-01-09 14:25:02,069 INFO L226 Difference]: Without dead ends: 2314 [2025-01-09 14:25:02,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 723 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 14:25:02,071 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 924 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 2506 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:02,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 2506 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:25:02,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2025-01-09 14:25:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1571. [2025-01-09 14:25:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1150 states have (on average 1.2704347826086957) internal successors, (1461), 1158 states have internal predecessors, (1461), 336 states have call successors, (336), 84 states have call predecessors, (336), 84 states have return successors, (336), 328 states have call predecessors, (336), 336 states have call successors, (336) [2025-01-09 14:25:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2133 transitions. [2025-01-09 14:25:02,246 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2133 transitions. Word has length 366 [2025-01-09 14:25:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:02,246 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2133 transitions. [2025-01-09 14:25:02,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 2 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 2 states have call predecessors, (70), 2 states have call successors, (70) [2025-01-09 14:25:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2133 transitions. [2025-01-09 14:25:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 14:25:02,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:02,248 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:25:02,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:02,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 14:25:02,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:02,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash 614286509, now seen corresponding path program 1 times [2025-01-09 14:25:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735163369] [2025-01-09 14:25:02,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:02,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:02,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:25:03,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:25:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:03,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 108 proven. 57 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:25:03,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:25:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735163369] [2025-01-09 14:25:03,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735163369] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:25:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274425331] [2025-01-09 14:25:03,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:03,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:03,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:25:03,851 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:25:03,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 14:25:03,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 14:25:04,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 14:25:04,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:04,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:04,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 14:25:04,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:25:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 2863 proven. 57 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2025-01-09 14:25:05,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:25:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 108 proven. 57 refuted. 0 times theorem prover too weak. 5995 trivial. 0 not checked. [2025-01-09 14:25:06,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274425331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:25:06,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:25:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 20 [2025-01-09 14:25:06,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555410125] [2025-01-09 14:25:06,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:25:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:25:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:25:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:25:06,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:25:06,044 INFO L87 Difference]: Start difference. First operand 1571 states and 2133 transitions. Second operand has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 6 states have call successors, (168), 3 states have call predecessors, (168), 6 states have return successors, (168), 6 states have call predecessors, (168), 6 states have call successors, (168) [2025-01-09 14:25:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:25:07,385 INFO L93 Difference]: Finished difference Result 2897 states and 3939 transitions. [2025-01-09 14:25:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:25:07,387 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 6 states have call successors, (168), 3 states have call predecessors, (168), 6 states have return successors, (168), 6 states have call predecessors, (168), 6 states have call successors, (168) Word has length 366 [2025-01-09 14:25:07,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:25:07,394 INFO L225 Difference]: With dead ends: 2897 [2025-01-09 14:25:07,394 INFO L226 Difference]: Without dead ends: 1532 [2025-01-09 14:25:07,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 723 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2025-01-09 14:25:07,398 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1296 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:25:07,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1339 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 14:25:07,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2025-01-09 14:25:07,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1328. [2025-01-09 14:25:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 933 states have (on average 1.240085744908896) internal successors, (1157), 938 states have internal predecessors, (1157), 312 states have call successors, (312), 82 states have call predecessors, (312), 82 states have return successors, (312), 307 states have call predecessors, (312), 312 states have call successors, (312) [2025-01-09 14:25:07,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 1781 transitions. [2025-01-09 14:25:07,584 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 1781 transitions. Word has length 366 [2025-01-09 14:25:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:25:07,585 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 1781 transitions. [2025-01-09 14:25:07,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.2) internal successors, (184), 20 states have internal predecessors, (184), 6 states have call successors, (168), 3 states have call predecessors, (168), 6 states have return successors, (168), 6 states have call predecessors, (168), 6 states have call successors, (168) [2025-01-09 14:25:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 1781 transitions. [2025-01-09 14:25:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 14:25:07,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:25:07,587 INFO L218 NwaCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 14:25:07,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 14:25:07,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:25:07,788 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:25:07,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:25:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash 532356753, now seen corresponding path program 1 times [2025-01-09 14:25:07,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:25:07,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530685104] [2025-01-09 14:25:07,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:25:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:25:07,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 14:25:10,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 14:25:10,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:25:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:25:30,578 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)