./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-19.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-19.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 19e2e876a884367ff58d4d1ec0d3ef70a7d8dd103d1be66ce3d8fde890972c6b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:21:14,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:21:14,224 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:21:14,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:21:14,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:21:14,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:21:14,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:21:14,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:21:14,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:21:14,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:21:14,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:21:14,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:21:14,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:21:14,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:21:14,257 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:21:14,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:21:14,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:21:14,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:21:14,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:21:14,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:21:14,259 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:21:14,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:21:14,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:14,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:14,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:14,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:14,259 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:21:14,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:14,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:21:14,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:21:14,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:21:14,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:21:14,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:21:14,261 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:21:14,261 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 -> 19e2e876a884367ff58d4d1ec0d3ef70a7d8dd103d1be66ce3d8fde890972c6b [2025-01-09 14:21:14,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:21:14,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:21:14,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:21:14,539 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:21:14,539 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:21:14,540 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-19.i [2025-01-09 14:21:15,808 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2523126d8/1186a049624d4473bdc749f18a0365e3/FLAG9aac2f4bb [2025-01-09 14:21:16,143 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:21:16,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-19.i [2025-01-09 14:21:16,160 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2523126d8/1186a049624d4473bdc749f18a0365e3/FLAG9aac2f4bb [2025-01-09 14:21:16,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2523126d8/1186a049624d4473bdc749f18a0365e3 [2025-01-09 14:21:16,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:21:16,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:21:16,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:16,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:21:16,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:21:16,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:16,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6720282b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16, skipping insertion in model container [2025-01-09 14:21:16,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:16,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:21:16,561 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-19.i[916,929] [2025-01-09 14:21:16,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:16,718 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:21:16,731 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-19.i[916,929] [2025-01-09 14:21:16,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:21:16,839 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:21:16,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16 WrapperNode [2025-01-09 14:21:16,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:21:16,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:16,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:21:16,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:21:16,847 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:21:16" (1/1) ... [2025-01-09 14:21:16,862 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:21:16" (1/1) ... [2025-01-09 14:21:16,912 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 374 [2025-01-09 14:21:16,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:21:16,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:21:16,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:21:16,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:21:16,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:16,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:16,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:16,975 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:21:16,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:16,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,002 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:21:17,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:21:17,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:21:17,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:21:17,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (1/1) ... [2025-01-09 14:21:17,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:21:17,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:17,094 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:21:17,102 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:21:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:21:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:21:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:21:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:21:17,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:21:17,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:21:17,217 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:21:17,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:21:18,123 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 14:21:18,123 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:21:18,137 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:21:18,137 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:21:18,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:18 BoogieIcfgContainer [2025-01-09 14:21:18,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:21:18,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:21:18,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:21:18,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:21:18,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:21:16" (1/3) ... [2025-01-09 14:21:18,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cb4850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:18, skipping insertion in model container [2025-01-09 14:21:18,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:21:16" (2/3) ... [2025-01-09 14:21:18,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75cb4850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:21:18, skipping insertion in model container [2025-01-09 14:21:18,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:21:18" (3/3) ... [2025-01-09 14:21:18,147 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-19.i [2025-01-09 14:21:18,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:21:18,164 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-19.i that has 2 procedures, 155 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:21:18,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:21:18,235 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;@4da32fd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:21:18,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:21:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 107 states have (on average 1.514018691588785) internal successors, (162), 108 states have internal predecessors, (162), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:21:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 14:21:18,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:18,261 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:18,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:18,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:18,269 INFO L85 PathProgramCache]: Analyzing trace with hash 803375296, now seen corresponding path program 1 times [2025-01-09 14:21:18,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:18,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104636845] [2025-01-09 14:21:18,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:18,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:18,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:21:18,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:21:18,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:18,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-01-09 14:21:18,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:18,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104636845] [2025-01-09 14:21:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104636845] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701783702] [2025-01-09 14:21:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:18,818 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:21:18,820 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:21:19,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:21:19,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:21:19,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:19,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:19,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:21:19,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:19,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 3872 trivial. 0 not checked. [2025-01-09 14:21:19,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:21:19,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701783702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:19,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:21:19,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:21:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291520714] [2025-01-09 14:21:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:19,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:21:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:19,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:21:19,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:21:19,239 INFO L87 Difference]: Start difference. First operand has 155 states, 107 states have (on average 1.514018691588785) internal successors, (162), 108 states have internal predecessors, (162), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:21:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:19,289 INFO L93 Difference]: Finished difference Result 303 states and 542 transitions. [2025-01-09 14:21:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:21:19,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) Word has length 293 [2025-01-09 14:21:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:19,300 INFO L225 Difference]: With dead ends: 303 [2025-01-09 14:21:19,300 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 14:21:19,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 294 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:21:19,306 INFO L435 NwaCegarLoop]: 244 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, 244 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:21:19,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:21:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 14:21:19,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 14:21:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 104 states have internal predecessors, (154), 45 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 14:21:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 244 transitions. [2025-01-09 14:21:19,361 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 244 transitions. Word has length 293 [2025-01-09 14:21:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:19,362 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 244 transitions. [2025-01-09 14:21:19,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (45), 2 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 2 states have call successors, (45) [2025-01-09 14:21:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 244 transitions. [2025-01-09 14:21:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-09 14:21:19,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:19,368 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,378 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:21:19,568 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:21:19,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:19,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1478182354, now seen corresponding path program 1 times [2025-01-09 14:21:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:19,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132385295] [2025-01-09 14:21:19,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:19,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-09 14:21:19,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-09 14:21:19,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:19,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:21:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:20,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132385295] [2025-01-09 14:21:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132385295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:20,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:20,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:20,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366025971] [2025-01-09 14:21:20,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:20,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:20,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:20,031 INFO L87 Difference]: Start difference. First operand 151 states and 244 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:21:20,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:20,137 INFO L93 Difference]: Finished difference Result 368 states and 594 transitions. [2025-01-09 14:21:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:20,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 293 [2025-01-09 14:21:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:20,146 INFO L225 Difference]: With dead ends: 368 [2025-01-09 14:21:20,146 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 14:21:20,147 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:21:20,148 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 100 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:20,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 524 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:20,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 14:21:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2025-01-09 14:21:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 155 states have (on average 1.4838709677419355) internal successors, (230), 156 states have internal predecessors, (230), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:21:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 348 transitions. [2025-01-09 14:21:20,184 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 348 transitions. Word has length 293 [2025-01-09 14:21:20,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:20,187 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 348 transitions. [2025-01-09 14:21:20,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:21:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 348 transitions. [2025-01-09 14:21:20,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:21:20,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:20,195 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:21:20,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:20,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:20,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1292237950, now seen corresponding path program 1 times [2025-01-09 14:21:20,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:20,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126779806] [2025-01-09 14:21:20,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:20,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:20,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:20,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:20,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:20,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:21:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:20,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126779806] [2025-01-09 14:21:20,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126779806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:20,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:20,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:20,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399119704] [2025-01-09 14:21:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:20,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:20,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:20,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:20,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:20,582 INFO L87 Difference]: Start difference. First operand 217 states and 348 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:21:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:20,697 INFO L93 Difference]: Finished difference Result 642 states and 1032 transitions. [2025-01-09 14:21:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 294 [2025-01-09 14:21:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:20,706 INFO L225 Difference]: With dead ends: 642 [2025-01-09 14:21:20,707 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 14:21:20,708 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:21:20,709 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 224 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:20,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 605 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 14:21:20,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 229. [2025-01-09 14:21:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 167 states have (on average 1.4910179640718564) internal successors, (249), 168 states have internal predecessors, (249), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:21:20,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 367 transitions. [2025-01-09 14:21:20,757 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 367 transitions. Word has length 294 [2025-01-09 14:21:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:20,758 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 367 transitions. [2025-01-09 14:21:20,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:21:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 367 transitions. [2025-01-09 14:21:20,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:21:20,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:20,765 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:21:20,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:20,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1313785604, now seen corresponding path program 1 times [2025-01-09 14:21:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385016131] [2025-01-09 14:21:20,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:20,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:20,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:20,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:20,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:20,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3960 trivial. 0 not checked. [2025-01-09 14:21:21,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:21,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385016131] [2025-01-09 14:21:21,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385016131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:21:21,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:21:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:21:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807561070] [2025-01-09 14:21:21,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:21:21,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:21:21,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:21,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:21:21,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:21:21,049 INFO L87 Difference]: Start difference. First operand 229 states and 367 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:21:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:21,146 INFO L93 Difference]: Finished difference Result 524 states and 840 transitions. [2025-01-09 14:21:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:21:21,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) Word has length 294 [2025-01-09 14:21:21,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:21,153 INFO L225 Difference]: With dead ends: 524 [2025-01-09 14:21:21,153 INFO L226 Difference]: Without dead ends: 298 [2025-01-09 14:21:21,154 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:21:21,154 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 106 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:21,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 486 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:21:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-01-09 14:21:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 253. [2025-01-09 14:21:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 191 states have (on average 1.5235602094240839) internal successors, (291), 192 states have internal predecessors, (291), 59 states have call successors, (59), 2 states have call predecessors, (59), 2 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-01-09 14:21:21,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 409 transitions. [2025-01-09 14:21:21,179 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 409 transitions. Word has length 294 [2025-01-09 14:21:21,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:21,180 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 409 transitions. [2025-01-09 14:21:21,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (45), 1 states have call predecessors, (45), 1 states have return successors, (45), 1 states have call predecessors, (45), 1 states have call successors, (45) [2025-01-09 14:21:21,180 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 409 transitions. [2025-01-09 14:21:21,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:21:21,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:21,184 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:21:21,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:21,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:21,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1206174330, now seen corresponding path program 1 times [2025-01-09 14:21:21,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:21,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560837968] [2025-01-09 14:21:21,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:21,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:21,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:21,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:21,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 33 proven. 99 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:21:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:23,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560837968] [2025-01-09 14:21:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560837968] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:23,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312758760] [2025-01-09 14:21:23,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:23,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:23,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:23,058 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:21:23,060 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:21:23,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:23,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:23,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:23,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:23,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:21:23,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1752 proven. 90 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2025-01-09 14:21:23,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:21:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 42 proven. 90 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:21:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312758760] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:21:24,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:21:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 14:21:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659303387] [2025-01-09 14:21:24,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:21:24,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 14:21:24,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:24,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 14:21:24,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:21:24,507 INFO L87 Difference]: Start difference. First operand 253 states and 409 transitions. Second operand has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (108), 2 states have call predecessors, (108), 4 states have return successors, (110), 3 states have call predecessors, (110), 3 states have call successors, (110) [2025-01-09 14:21:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:25,405 INFO L93 Difference]: Finished difference Result 673 states and 1056 transitions. [2025-01-09 14:21:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 14:21:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (108), 2 states have call predecessors, (108), 4 states have return successors, (110), 3 states have call predecessors, (110), 3 states have call successors, (110) Word has length 294 [2025-01-09 14:21:25,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:25,414 INFO L225 Difference]: With dead ends: 673 [2025-01-09 14:21:25,414 INFO L226 Difference]: Without dead ends: 423 [2025-01-09 14:21:25,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 587 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2025-01-09 14:21:25,416 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 725 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:25,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 596 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 14:21:25,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-01-09 14:21:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 368. [2025-01-09 14:21:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 281 states have (on average 1.4697508896797153) internal successors, (413), 284 states have internal predecessors, (413), 79 states have call successors, (79), 7 states have call predecessors, (79), 7 states have return successors, (79), 76 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 14:21:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 571 transitions. [2025-01-09 14:21:25,465 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 571 transitions. Word has length 294 [2025-01-09 14:21:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:25,466 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 571 transitions. [2025-01-09 14:21:25,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 3 states have call successors, (108), 2 states have call predecessors, (108), 4 states have return successors, (110), 3 states have call predecessors, (110), 3 states have call successors, (110) [2025-01-09 14:21:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 571 transitions. [2025-01-09 14:21:25,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:21:25,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:25,473 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:25,483 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:21:25,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:25,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:25,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1684531876, now seen corresponding path program 1 times [2025-01-09 14:21:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:25,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305115390] [2025-01-09 14:21:25,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:25,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:26,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:26,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:26,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 81 proven. 51 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:21:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305115390] [2025-01-09 14:21:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305115390] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13810850] [2025-01-09 14:21:27,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:27,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:27,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:27,253 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:21:27,255 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:21:27,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:27,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:27,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:27,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:27,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 14:21:27,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 1679 proven. 189 refuted. 0 times theorem prover too weak. 2092 trivial. 0 not checked. [2025-01-09 14:21:29,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:21:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 69 proven. 192 refuted. 0 times theorem prover too weak. 3699 trivial. 0 not checked. [2025-01-09 14:21:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13810850] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:21:31,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:21:31,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 30 [2025-01-09 14:21:31,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137316192] [2025-01-09 14:21:31,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:21:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 14:21:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:31,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 14:21:31,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:21:31,433 INFO L87 Difference]: Start difference. First operand 368 states and 571 transitions. Second operand has 30 states, 29 states have (on average 6.344827586206897) internal successors, (184), 29 states have internal predecessors, (184), 10 states have call successors, (135), 4 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-01-09 14:21:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:21:37,127 INFO L93 Difference]: Finished difference Result 3166 states and 4873 transitions. [2025-01-09 14:21:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-01-09 14:21:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 6.344827586206897) internal successors, (184), 29 states have internal predecessors, (184), 10 states have call successors, (135), 4 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) Word has length 294 [2025-01-09 14:21:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:21:37,151 INFO L225 Difference]: With dead ends: 3166 [2025-01-09 14:21:37,151 INFO L226 Difference]: Without dead ends: 2801 [2025-01-09 14:21:37,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 578 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4210 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2362, Invalid=10070, Unknown=0, NotChecked=0, Total=12432 [2025-01-09 14:21:37,158 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 4989 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 1497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5013 SdHoareTripleChecker+Valid, 2805 SdHoareTripleChecker+Invalid, 4117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1497 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:21:37,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5013 Valid, 2805 Invalid, 4117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1497 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 14:21:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2025-01-09 14:21:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 343. [2025-01-09 14:21:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 240 states have (on average 1.3375) internal successors, (321), 240 states have internal predecessors, (321), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:21:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 501 transitions. [2025-01-09 14:21:37,253 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 501 transitions. Word has length 294 [2025-01-09 14:21:37,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:21:37,253 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 501 transitions. [2025-01-09 14:21:37,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 6.344827586206897) internal successors, (184), 29 states have internal predecessors, (184), 10 states have call successors, (135), 4 states have call predecessors, (135), 9 states have return successors, (135), 10 states have call predecessors, (135), 10 states have call successors, (135) [2025-01-09 14:21:37,254 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 501 transitions. [2025-01-09 14:21:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:21:37,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:21:37,258 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:37,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 14:21:37,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:37,463 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:21:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:21:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1542126248, now seen corresponding path program 1 times [2025-01-09 14:21:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:21:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221300475] [2025-01-09 14:21:37,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:21:37,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:37,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:37,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:37,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 96 proven. 36 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2025-01-09 14:21:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:21:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221300475] [2025-01-09 14:21:38,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221300475] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:21:38,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118809024] [2025-01-09 14:21:38,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:21:38,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:21:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:21:38,733 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:21:38,736 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:21:38,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:21:38,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:21:38,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:21:38,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:21:38,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 14:21:38,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:21:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2399 proven. 278 refuted. 0 times theorem prover too weak. 1283 trivial. 0 not checked. [2025-01-09 14:21:41,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:21:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 279 proven. 231 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2025-01-09 14:21:42,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118809024] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:21:42,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:21:42,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 16] total 37 [2025-01-09 14:21:42,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092388779] [2025-01-09 14:21:42,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:21:42,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 14:21:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:21:42,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 14:21:42,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=978, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:21:42,851 INFO L87 Difference]: Start difference. First operand 343 states and 501 transitions. Second operand has 37 states, 35 states have (on average 6.3428571428571425) internal successors, (222), 33 states have internal predecessors, (222), 13 states have call successors, (135), 6 states have call predecessors, (135), 13 states have return successors, (135), 13 states have call predecessors, (135), 13 states have call successors, (135) [2025-01-09 14:22:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:22:13,202 INFO L93 Difference]: Finished difference Result 4467 states and 6297 transitions. [2025-01-09 14:22:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 328 states. [2025-01-09 14:22:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 6.3428571428571425) internal successors, (222), 33 states have internal predecessors, (222), 13 states have call successors, (135), 6 states have call predecessors, (135), 13 states have return successors, (135), 13 states have call predecessors, (135), 13 states have call successors, (135) Word has length 294 [2025-01-09 14:22:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:22:13,226 INFO L225 Difference]: With dead ends: 4467 [2025-01-09 14:22:13,227 INFO L226 Difference]: Without dead ends: 4257 [2025-01-09 14:22:13,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 990 GetRequests, 639 SyntacticMatches, 1 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58795 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=24072, Invalid=99480, Unknown=0, NotChecked=0, Total=123552 [2025-01-09 14:22:13,247 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 6964 mSDsluCounter, 5260 mSDsCounter, 0 mSdLazyCounter, 6450 mSolverCounterSat, 3573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6994 SdHoareTripleChecker+Valid, 5525 SdHoareTripleChecker+Invalid, 10023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3573 IncrementalHoareTripleChecker+Valid, 6450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:22:13,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6994 Valid, 5525 Invalid, 10023 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3573 Valid, 6450 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 14:22:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-01-09 14:22:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 2463. [2025-01-09 14:22:13,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 1770 states have (on average 1.3372881355932202) internal successors, (2367), 1781 states have internal predecessors, (2367), 583 states have call successors, (583), 109 states have call predecessors, (583), 109 states have return successors, (583), 572 states have call predecessors, (583), 583 states have call successors, (583) [2025-01-09 14:22:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3533 transitions. [2025-01-09 14:22:13,715 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3533 transitions. Word has length 294 [2025-01-09 14:22:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:22:13,716 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 3533 transitions. [2025-01-09 14:22:13,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 6.3428571428571425) internal successors, (222), 33 states have internal predecessors, (222), 13 states have call successors, (135), 6 states have call predecessors, (135), 13 states have return successors, (135), 13 states have call predecessors, (135), 13 states have call successors, (135) [2025-01-09 14:22:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3533 transitions. [2025-01-09 14:22:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-01-09 14:22:13,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:22:13,720 INFO L218 NwaCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:13,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:22:13,925 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:22:13,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:22:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:22:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash 955320234, now seen corresponding path program 1 times [2025-01-09 14:22:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:22:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416835075] [2025-01-09 14:22:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:22:13,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:22:14,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:22:14,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:14,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 156 proven. 222 refuted. 0 times theorem prover too weak. 3582 trivial. 0 not checked. [2025-01-09 14:22:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:22:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416835075] [2025-01-09 14:22:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416835075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:22:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492425319] [2025-01-09 14:22:16,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:22:16,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:22:16,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:22:16,621 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:22:16,624 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:22:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 14:22:16,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 14:22:16,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:22:16,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:22:16,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 14:22:16,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:22:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 2330 proven. 435 refuted. 0 times theorem prover too weak. 1195 trivial. 0 not checked. [2025-01-09 14:22:19,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:22:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 156 proven. 354 refuted. 0 times theorem prover too weak. 3450 trivial. 0 not checked. [2025-01-09 14:22:22,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492425319] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:22:22,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:22:22,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 22, 23] total 52 [2025-01-09 14:22:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860715616] [2025-01-09 14:22:22,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:22:22,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-01-09 14:22:22,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:22:22,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-01-09 14:22:22,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=2195, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 14:22:22,356 INFO L87 Difference]: Start difference. First operand 2463 states and 3533 transitions. Second operand has 52 states, 49 states have (on average 4.448979591836735) internal successors, (218), 48 states have internal predecessors, (218), 15 states have call successors, (135), 7 states have call predecessors, (135), 15 states have return successors, (135), 15 states have call predecessors, (135), 15 states have call successors, (135)