./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-8.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-8.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 8756b08be05a2754ba7f473b23db96aacdd088f16a43249dcd482c532b48d535 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:28:30,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:28:31,003 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:28:31,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:28:31,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:28:31,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:28:31,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:28:31,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:28:31,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:28:31,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:28:31,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:28:31,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:28:31,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:28:31,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:28:31,029 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:28:31,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:28:31,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:28:31,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:28:31,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:28:31,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:28:31,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:31,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:31,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:28:31,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:28:31,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:28:31,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:28:31,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:31,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:28:31,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:28:31,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:28:31,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:28:31,033 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 -> 8756b08be05a2754ba7f473b23db96aacdd088f16a43249dcd482c532b48d535 [2025-01-09 14:28:31,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:28:31,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:28:31,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:28:31,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:28:31,245 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:28:31,246 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-8.i [2025-01-09 14:28:32,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a708ebc5/4db62861a8e1404e977e410cd172dd15/FLAG67a799b61 [2025-01-09 14:28:32,600 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:28:32,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-8.i [2025-01-09 14:28:32,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a708ebc5/4db62861a8e1404e977e410cd172dd15/FLAG67a799b61 [2025-01-09 14:28:32,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a708ebc5/4db62861a8e1404e977e410cd172dd15 [2025-01-09 14:28:32,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:28:32,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:28:32,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:32,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:28:32,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:28:32,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:32,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d97e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32, skipping insertion in model container [2025-01-09 14:28:32,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:32,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:28:32,744 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-8.i[915,928] [2025-01-09 14:28:32,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:32,885 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:28:32,895 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-8.i[915,928] [2025-01-09 14:28:32,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:28:32,951 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:28:32,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32 WrapperNode [2025-01-09 14:28:32,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:28:32,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:32,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:28:32,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:28:32,957 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:28:32" (1/1) ... [2025-01-09 14:28:32,972 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:28:32" (1/1) ... [2025-01-09 14:28:33,030 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 394 [2025-01-09 14:28:33,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:28:33,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:28:33,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:28:33,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:28:33,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,069 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:28:33,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,090 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:28:33,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:28:33,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:28:33,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:28:33,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (1/1) ... [2025-01-09 14:28:33,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:28:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:33,153 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:28:33,156 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:28:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:28:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:28:33,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:28:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:28:33,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:28:33,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:28:33,251 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:28:33,252 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:28:33,830 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-01-09 14:28:33,830 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:28:33,839 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:28:33,840 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:28:33,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:33 BoogieIcfgContainer [2025-01-09 14:28:33,840 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:28:33,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:28:33,841 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:28:33,844 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:28:33,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:28:32" (1/3) ... [2025-01-09 14:28:33,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d07f44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:33, skipping insertion in model container [2025-01-09 14:28:33,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:28:32" (2/3) ... [2025-01-09 14:28:33,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d07f44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:28:33, skipping insertion in model container [2025-01-09 14:28:33,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:28:33" (3/3) ... [2025-01-09 14:28:33,847 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-8.i [2025-01-09 14:28:33,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:28:33,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-8.i that has 2 procedures, 173 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:28:33,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:28:33,903 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;@7eac0dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:28:33,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:28:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 121 states have internal predecessors, (182), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:28:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:28:33,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:33,921 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:33,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:33,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:33,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1977729219, now seen corresponding path program 1 times [2025-01-09 14:28:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:33,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329448841] [2025-01-09 14:28:33,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:33,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:34,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:28:34,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:28:34,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:34,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 14:28:34,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329448841] [2025-01-09 14:28:34,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329448841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:34,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970406719] [2025-01-09 14:28:34,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:34,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:34,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:34,310 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:28:34,312 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:28:34,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:28:34,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:28:34,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:34,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:34,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:28:34,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-01-09 14:28:34,545 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:28:34,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970406719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:34,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:28:34,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:28:34,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610122611] [2025-01-09 14:28:34,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:34,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:28:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:34,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:28:34,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:28:34,568 INFO L87 Difference]: Start difference. First operand has 173 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 121 states have internal predecessors, (182), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:28:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:34,598 INFO L93 Difference]: Finished difference Result 340 states and 609 transitions. [2025-01-09 14:28:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:28:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 327 [2025-01-09 14:28:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:34,603 INFO L225 Difference]: With dead ends: 340 [2025-01-09 14:28:34,604 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 14:28:34,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 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:28:34,609 INFO L435 NwaCegarLoop]: 277 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, 277 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:28:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:28:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 14:28:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 14:28:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 118 states have (on average 1.5) internal successors, (177), 118 states have internal predecessors, (177), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 14:28:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 277 transitions. [2025-01-09 14:28:34,657 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 277 transitions. Word has length 327 [2025-01-09 14:28:34,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:34,657 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 277 transitions. [2025-01-09 14:28:34,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-01-09 14:28:34,658 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 277 transitions. [2025-01-09 14:28:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:28:34,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:34,661 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:34,669 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:28:34,862 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:28:34,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:34,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:34,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1156610059, now seen corresponding path program 1 times [2025-01-09 14:28:34,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:34,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138896882] [2025-01-09 14:28:34,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:34,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:34,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:28:34,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:28:34,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:34,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:28:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:35,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138896882] [2025-01-09 14:28:35,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138896882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:35,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:35,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:35,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934693281] [2025-01-09 14:28:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:35,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:35,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:35,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:35,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:35,148 INFO L87 Difference]: Start difference. First operand 170 states and 277 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:35,285 INFO L93 Difference]: Finished difference Result 491 states and 799 transitions. [2025-01-09 14:28:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:35,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 327 [2025-01-09 14:28:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:35,289 INFO L225 Difference]: With dead ends: 491 [2025-01-09 14:28:35,291 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 14:28:35,292 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:28:35,293 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 247 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:35,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 664 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:35,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 14:28:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2025-01-09 14:28:35,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 219 states have (on average 1.4246575342465753) internal successors, (312), 219 states have internal predecessors, (312), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:28:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 512 transitions. [2025-01-09 14:28:35,333 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 512 transitions. Word has length 327 [2025-01-09 14:28:35,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:35,335 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 512 transitions. [2025-01-09 14:28:35,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 512 transitions. [2025-01-09 14:28:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:28:35,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:35,340 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:35,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:28:35,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:35,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:35,341 INFO L85 PathProgramCache]: Analyzing trace with hash -78817227, now seen corresponding path program 1 times [2025-01-09 14:28:35,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:35,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383653097] [2025-01-09 14:28:35,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:35,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:35,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:28:35,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:28:35,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:35,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:28:35,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:35,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383653097] [2025-01-09 14:28:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383653097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:35,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:35,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:35,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907985817] [2025-01-09 14:28:35,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:35,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:35,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:35,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:35,579 INFO L87 Difference]: Start difference. First operand 322 states and 512 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:35,697 INFO L93 Difference]: Finished difference Result 648 states and 1030 transitions. [2025-01-09 14:28:35,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 327 [2025-01-09 14:28:35,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:35,702 INFO L225 Difference]: With dead ends: 648 [2025-01-09 14:28:35,704 INFO L226 Difference]: Without dead ends: 329 [2025-01-09 14:28:35,705 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:28:35,706 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 220 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:35,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 488 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:35,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-01-09 14:28:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2025-01-09 14:28:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 224 states have (on average 1.3705357142857142) internal successors, (307), 224 states have internal predecessors, (307), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:28:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 507 transitions. [2025-01-09 14:28:35,752 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 507 transitions. Word has length 327 [2025-01-09 14:28:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:35,754 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 507 transitions. [2025-01-09 14:28:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 507 transitions. [2025-01-09 14:28:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 14:28:35,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:35,758 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:28:35,758 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:35,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:35,759 INFO L85 PathProgramCache]: Analyzing trace with hash -2072961933, now seen corresponding path program 1 times [2025-01-09 14:28:35,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:35,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370845248] [2025-01-09 14:28:35,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:35,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 14:28:35,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 14:28:35,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:35,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:36,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:28:36,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:36,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370845248] [2025-01-09 14:28:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370845248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:36,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:36,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:36,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60874429] [2025-01-09 14:28:36,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:36,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:36,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:36,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:36,373 INFO L87 Difference]: Start difference. First operand 327 states and 507 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:36,460 INFO L93 Difference]: Finished difference Result 752 states and 1167 transitions. [2025-01-09 14:28:36,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:36,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 327 [2025-01-09 14:28:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:36,463 INFO L225 Difference]: With dead ends: 752 [2025-01-09 14:28:36,463 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 14:28:36,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:28:36,467 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 233 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:36,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 650 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:28:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 14:28:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 327. [2025-01-09 14:28:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 224 states have (on average 1.3616071428571428) internal successors, (305), 224 states have internal predecessors, (305), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 14:28:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 505 transitions. [2025-01-09 14:28:36,504 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 505 transitions. Word has length 327 [2025-01-09 14:28:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:36,507 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 505 transitions. [2025-01-09 14:28:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 505 transitions. [2025-01-09 14:28:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 14:28:36,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:36,510 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:28:36,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:36,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash -111189502, now seen corresponding path program 1 times [2025-01-09 14:28:36,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:36,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13074623] [2025-01-09 14:28:36,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:36,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:28:36,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:28:36,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:36,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:28:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:36,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13074623] [2025-01-09 14:28:36,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13074623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:28:36,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:28:36,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:28:36,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670815244] [2025-01-09 14:28:36,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:28:36,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:28:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:36,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:28:36,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:36,919 INFO L87 Difference]: Start difference. First operand 327 states and 505 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:37,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:37,035 INFO L93 Difference]: Finished difference Result 820 states and 1263 transitions. [2025-01-09 14:28:37,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:28:37,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 328 [2025-01-09 14:28:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:37,039 INFO L225 Difference]: With dead ends: 820 [2025-01-09 14:28:37,041 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 14:28:37,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:28:37,044 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 142 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:37,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 490 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:28:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 14:28:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 486. [2025-01-09 14:28:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 332 states have (on average 1.3524096385542168) internal successors, (449), 332 states have internal predecessors, (449), 150 states have call successors, (150), 3 states have call predecessors, (150), 3 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 14:28:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 749 transitions. [2025-01-09 14:28:37,100 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 749 transitions. Word has length 328 [2025-01-09 14:28:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:37,102 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 749 transitions. [2025-01-09 14:28:37,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:28:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 749 transitions. [2025-01-09 14:28:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 14:28:37,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:37,107 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:37,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:28:37,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:37,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash 29359108, now seen corresponding path program 1 times [2025-01-09 14:28:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:37,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437811152] [2025-01-09 14:28:37,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:37,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:28:37,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:28:37,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:37,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 63 proven. 84 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:28:38,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437811152] [2025-01-09 14:28:38,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437811152] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:38,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542682117] [2025-01-09 14:28:38,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:38,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:38,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:38,083 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:28:38,085 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:28:38,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 14:28:38,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 14:28:38,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:38,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:38,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 14:28:38,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2443 proven. 84 refuted. 0 times theorem prover too weak. 2373 trivial. 0 not checked. [2025-01-09 14:28:39,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 63 proven. 84 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:28:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542682117] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:28:40,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:28:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 21 [2025-01-09 14:28:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321547969] [2025-01-09 14:28:40,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:40,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 14:28:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:40,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 14:28:40,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-01-09 14:28:40,254 INFO L87 Difference]: Start difference. First operand 486 states and 749 transitions. Second operand has 21 states, 20 states have (on average 10.1) internal successors, (202), 21 states have internal predecessors, (202), 7 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 6 states have call predecessors, (150), 7 states have call successors, (150) [2025-01-09 14:28:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:44,032 INFO L93 Difference]: Finished difference Result 2656 states and 4024 transitions. [2025-01-09 14:28:44,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-01-09 14:28:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 10.1) internal successors, (202), 21 states have internal predecessors, (202), 7 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 6 states have call predecessors, (150), 7 states have call successors, (150) Word has length 328 [2025-01-09 14:28:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:44,045 INFO L225 Difference]: With dead ends: 2656 [2025-01-09 14:28:44,045 INFO L226 Difference]: Without dead ends: 2173 [2025-01-09 14:28:44,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 655 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=998, Invalid=4114, Unknown=0, NotChecked=0, Total=5112 [2025-01-09 14:28:44,050 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 2571 mSDsluCounter, 2560 mSDsCounter, 0 mSdLazyCounter, 3149 mSolverCounterSat, 1039 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 4188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1039 IncrementalHoareTripleChecker+Valid, 3149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:44,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 2752 Invalid, 4188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1039 Valid, 3149 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:28:44,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2025-01-09 14:28:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1639. [2025-01-09 14:28:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1143 states have (on average 1.3622047244094488) internal successors, (1557), 1149 states have internal predecessors, (1557), 476 states have call successors, (476), 19 states have call predecessors, (476), 19 states have return successors, (476), 470 states have call predecessors, (476), 476 states have call successors, (476) [2025-01-09 14:28:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2509 transitions. [2025-01-09 14:28:44,240 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2509 transitions. Word has length 328 [2025-01-09 14:28:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:28:44,240 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2509 transitions. [2025-01-09 14:28:44,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 10.1) internal successors, (202), 21 states have internal predecessors, (202), 7 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 6 states have call predecessors, (150), 7 states have call successors, (150) [2025-01-09 14:28:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2509 transitions. [2025-01-09 14:28:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-01-09 14:28:44,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:28:44,244 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:44,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:28:44,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:44,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:28:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:28:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1380176402, now seen corresponding path program 1 times [2025-01-09 14:28:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:28:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618611847] [2025-01-09 14:28:44,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:28:44,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-09 14:28:44,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-09 14:28:44,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:44,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 87 proven. 60 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-01-09 14:28:46,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:28:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618611847] [2025-01-09 14:28:46,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618611847] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:46,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492737722] [2025-01-09 14:28:46,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:28:46,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:28:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:28:46,474 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:28:46,476 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:28:46,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-09 14:28:46,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-09 14:28:46,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:28:46,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:28:46,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 14:28:46,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:28:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3105 proven. 249 refuted. 0 times theorem prover too weak. 1546 trivial. 0 not checked. [2025-01-09 14:28:49,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:28:55,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492737722] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:28:55,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:28:55,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20] total 28 [2025-01-09 14:28:55,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635038608] [2025-01-09 14:28:55,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:28:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:28:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:28:55,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:28:55,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1096, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 14:28:55,373 INFO L87 Difference]: Start difference. First operand 1639 states and 2509 transitions. Second operand has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 26 states have internal predecessors, (187), 9 states have call successors, (100), 7 states have call predecessors, (100), 11 states have return successors, (100), 9 states have call predecessors, (100), 9 states have call successors, (100) [2025-01-09 14:28:59,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:28:59,839 INFO L93 Difference]: Finished difference Result 4388 states and 6531 transitions. [2025-01-09 14:28:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-09 14:28:59,840 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 26 states have internal predecessors, (187), 9 states have call successors, (100), 7 states have call predecessors, (100), 11 states have return successors, (100), 9 states have call predecessors, (100), 9 states have call successors, (100) Word has length 331 [2025-01-09 14:28:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:28:59,860 INFO L225 Difference]: With dead ends: 4388 [2025-01-09 14:28:59,860 INFO L226 Difference]: Without dead ends: 2752 [2025-01-09 14:28:59,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3018 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2197, Invalid=7115, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 14:28:59,868 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1880 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 1164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 2145 SdHoareTripleChecker+Invalid, 3728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1164 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:28:59,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 2145 Invalid, 3728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1164 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 14:28:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2752 states. [2025-01-09 14:29:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2752 to 2371. [2025-01-09 14:29:00,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1669 states have (on average 1.3307369682444579) internal successors, (2221), 1678 states have internal predecessors, (2221), 659 states have call successors, (659), 42 states have call predecessors, (659), 42 states have return successors, (659), 650 states have call predecessors, (659), 659 states have call successors, (659) [2025-01-09 14:29:00,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3539 transitions. [2025-01-09 14:29:00,049 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3539 transitions. Word has length 331 [2025-01-09 14:29:00,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:00,051 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3539 transitions. [2025-01-09 14:29:00,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 26 states have internal predecessors, (187), 9 states have call successors, (100), 7 states have call predecessors, (100), 11 states have return successors, (100), 9 states have call predecessors, (100), 9 states have call successors, (100) [2025-01-09 14:29:00,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3539 transitions. [2025-01-09 14:29:00,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-01-09 14:29:00,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:00,055 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:00,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 14:29:00,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:00,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:00,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2049026330, now seen corresponding path program 1 times [2025-01-09 14:29:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346172804] [2025-01-09 14:29:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:00,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-01-09 14:29:00,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-01-09 14:29:00,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:00,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-01-09 14:29:00,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:00,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346172804] [2025-01-09 14:29:00,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346172804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:00,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:00,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446869359] [2025-01-09 14:29:00,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:00,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:00,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:00,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:00,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:00,574 INFO L87 Difference]: Start difference. First operand 2371 states and 3539 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:00,942 INFO L93 Difference]: Finished difference Result 3842 states and 5800 transitions. [2025-01-09 14:29:00,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:00,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 331 [2025-01-09 14:29:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:00,957 INFO L225 Difference]: With dead ends: 3842 [2025-01-09 14:29:00,958 INFO L226 Difference]: Without dead ends: 2373 [2025-01-09 14:29:00,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:00,964 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 231 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:00,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1037 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:29:00,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2025-01-09 14:29:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2371. [2025-01-09 14:29:01,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1669 states have (on average 1.3265428400239665) internal successors, (2214), 1678 states have internal predecessors, (2214), 659 states have call successors, (659), 42 states have call predecessors, (659), 42 states have return successors, (659), 650 states have call predecessors, (659), 659 states have call successors, (659) [2025-01-09 14:29:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3532 transitions. [2025-01-09 14:29:01,190 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3532 transitions. Word has length 331 [2025-01-09 14:29:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:01,198 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3532 transitions. [2025-01-09 14:29:01,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-01-09 14:29:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3532 transitions. [2025-01-09 14:29:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 14:29:01,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:01,201 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:01,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:29:01,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:01,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:01,202 INFO L85 PathProgramCache]: Analyzing trace with hash -999854172, now seen corresponding path program 1 times [2025-01-09 14:29:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127166090] [2025-01-09 14:29:01,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:01,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:01,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 14:29:01,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 14:29:01,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:01,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 315 proven. 108 refuted. 0 times theorem prover too weak. 4477 trivial. 0 not checked. [2025-01-09 14:29:05,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127166090] [2025-01-09 14:29:05,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127166090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:05,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761710916] [2025-01-09 14:29:05,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:05,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:05,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:05,033 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:29:05,034 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:29:05,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 14:29:05,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 14:29:05,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:05,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:05,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 14:29:05,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2929 proven. 156 refuted. 0 times theorem prover too weak. 1815 trivial. 0 not checked. [2025-01-09 14:29:06,386 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 267 proven. 165 refuted. 0 times theorem prover too weak. 4468 trivial. 0 not checked. [2025-01-09 14:29:08,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761710916] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:08,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:08,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 37 [2025-01-09 14:29:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40997011] [2025-01-09 14:29:08,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:08,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 14:29:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:08,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 14:29:08,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1127, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 14:29:08,160 INFO L87 Difference]: Start difference. First operand 2371 states and 3532 transitions. Second operand has 37 states, 36 states have (on average 6.861111111111111) internal successors, (247), 35 states have internal predecessors, (247), 13 states have call successors, (150), 5 states have call predecessors, (150), 11 states have return successors, (150), 13 states have call predecessors, (150), 13 states have call successors, (150) [2025-01-09 14:29:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:38,149 INFO L93 Difference]: Finished difference Result 15121 states and 21833 transitions. [2025-01-09 14:29:38,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 403 states. [2025-01-09 14:29:38,150 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 6.861111111111111) internal successors, (247), 35 states have internal predecessors, (247), 13 states have call successors, (150), 5 states have call predecessors, (150), 11 states have return successors, (150), 13 states have call predecessors, (150), 13 states have call successors, (150) Word has length 332 [2025-01-09 14:29:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:38,225 INFO L225 Difference]: With dead ends: 15121 [2025-01-09 14:29:38,225 INFO L226 Difference]: Without dead ends: 13207 [2025-01-09 14:29:38,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1123 GetRequests, 704 SyntacticMatches, 0 SemanticMatches, 419 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84324 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=23440, Invalid=153380, Unknown=0, NotChecked=0, Total=176820 [2025-01-09 14:29:38,257 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 12422 mSDsluCounter, 5976 mSDsCounter, 0 mSdLazyCounter, 10053 mSolverCounterSat, 8274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12532 SdHoareTripleChecker+Valid, 6526 SdHoareTripleChecker+Invalid, 18327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8274 IncrementalHoareTripleChecker+Valid, 10053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:38,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12532 Valid, 6526 Invalid, 18327 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8274 Valid, 10053 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2025-01-09 14:29:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13207 states. [2025-01-09 14:29:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13207 to 8566. [2025-01-09 14:29:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8566 states, 6301 states have (on average 1.3366132359942866) internal successors, (8422), 6352 states have internal predecessors, (8422), 2031 states have call successors, (2031), 233 states have call predecessors, (2031), 233 states have return successors, (2031), 1980 states have call predecessors, (2031), 2031 states have call successors, (2031) [2025-01-09 14:29:39,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8566 states to 8566 states and 12484 transitions. [2025-01-09 14:29:39,162 INFO L78 Accepts]: Start accepts. Automaton has 8566 states and 12484 transitions. Word has length 332 [2025-01-09 14:29:39,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:39,165 INFO L471 AbstractCegarLoop]: Abstraction has 8566 states and 12484 transitions. [2025-01-09 14:29:39,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 6.861111111111111) internal successors, (247), 35 states have internal predecessors, (247), 13 states have call successors, (150), 5 states have call predecessors, (150), 11 states have return successors, (150), 13 states have call predecessors, (150), 13 states have call successors, (150) [2025-01-09 14:29:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 8566 states and 12484 transitions. [2025-01-09 14:29:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-01-09 14:29:39,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:39,185 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:39,192 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:29:39,385 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,SelfDestructingSolverStorable8 [2025-01-09 14:29:39,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:39,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:39,387 INFO L85 PathProgramCache]: Analyzing trace with hash -859305562, now seen corresponding path program 1 times [2025-01-09 14:29:39,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:39,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672835073] [2025-01-09 14:29:39,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:39,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:39,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 14:29:39,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 14:29:39,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:39,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 198 proven. 90 refuted. 0 times theorem prover too weak. 4612 trivial. 0 not checked. [2025-01-09 14:29:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672835073] [2025-01-09 14:29:42,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672835073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423544957] [2025-01-09 14:29:42,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:42,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:42,894 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:29:42,895 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:29:43,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-01-09 14:29:43,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-01-09 14:29:43,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:43,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:43,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 745 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 14:29:43,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3128 proven. 357 refuted. 0 times theorem prover too weak. 1415 trivial. 0 not checked. [2025-01-09 14:29:46,649 INFO L312 TraceCheckSpWp]: Computing backward predicates...