./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-0.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-0.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 bc8ba5687f86ca6bc535ef8887bd15483610a3c920778b0e5f157ae799e621ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:19:39,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:19:39,971 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:19:39,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:19:39,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:19:39,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:19:39,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:19:39,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:19:39,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:19:39,990 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:19:39,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:19:39,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:19:39,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:19:39,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:19:39,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:19:39,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:39,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:39,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:19:39,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:19:39,992 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 -> bc8ba5687f86ca6bc535ef8887bd15483610a3c920778b0e5f157ae799e621ff [2025-01-09 14:19:40,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:19:40,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:19:40,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:19:40,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:19:40,241 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:19:40,242 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-0.i [2025-01-09 14:19:41,372 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38b6d5e15/bfba5e1bd5244b5485c74d3be034cbf5/FLAGd155ffd08 [2025-01-09 14:19:41,643 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:19:41,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-0.i [2025-01-09 14:19:41,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38b6d5e15/bfba5e1bd5244b5485c74d3be034cbf5/FLAGd155ffd08 [2025-01-09 14:19:41,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/38b6d5e15/bfba5e1bd5244b5485c74d3be034cbf5 [2025-01-09 14:19:41,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:19:41,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:19:41,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:41,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:19:41,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:19:41,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:41" (1/1) ... [2025-01-09 14:19:41,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4413c983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:41, skipping insertion in model container [2025-01-09 14:19:41,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:19:41" (1/1) ... [2025-01-09 14:19:41,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:19:42,092 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-0.i[915,928] [2025-01-09 14:19:42,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:42,203 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:19:42,216 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-0.i[915,928] [2025-01-09 14:19:42,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:19:42,289 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:19:42,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42 WrapperNode [2025-01-09 14:19:42,295 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:19:42,296 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:42,296 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:19:42,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:19:42,300 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:19:42" (1/1) ... [2025-01-09 14:19:42,315 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:19:42" (1/1) ... [2025-01-09 14:19:42,367 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 344 [2025-01-09 14:19:42,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:19:42,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:19:42,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:19:42,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:19:42,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,428 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:19:42,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,452 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:19:42,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:19:42,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:19:42,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:19:42,506 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (1/1) ... [2025-01-09 14:19:42,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:19:42,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:42,532 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:19:42,543 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:19:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:19:42,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:19:42,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:19:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:19:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:19:42,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:19:42,643 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:19:42,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:19:43,328 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-01-09 14:19:43,329 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:19:43,341 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:19:43,342 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:19:43,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:43 BoogieIcfgContainer [2025-01-09 14:19:43,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:19:43,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:19:43,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:19:43,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:19:43,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:19:41" (1/3) ... [2025-01-09 14:19:43,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e116e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:43, skipping insertion in model container [2025-01-09 14:19:43,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:19:42" (2/3) ... [2025-01-09 14:19:43,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e116e3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:19:43, skipping insertion in model container [2025-01-09 14:19:43,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:19:43" (3/3) ... [2025-01-09 14:19:43,352 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-0.i [2025-01-09 14:19:43,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:19:43,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-0.i that has 2 procedures, 147 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:19:43,421 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:19:43,429 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;@49529f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:19:43,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:19:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 113 states have internal predecessors, (172), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 14:19:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 14:19:43,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:43,451 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:43,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:43,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1807415768, now seen corresponding path program 1 times [2025-01-09 14:19:43,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:43,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222973145] [2025-01-09 14:19:43,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:43,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:43,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:43,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:43,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 14:19:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222973145] [2025-01-09 14:19:43,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222973145] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:43,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747139842] [2025-01-09 14:19:43,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:43,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:43,827 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:19:43,830 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:19:43,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:44,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:44,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:44,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:44,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:19:44,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-01-09 14:19:44,091 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:19:44,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747139842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:44,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:19:44,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:19:44,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417543477] [2025-01-09 14:19:44,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:44,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:19:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:44,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:19:44,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:19:44,115 INFO L87 Difference]: Start difference. First operand has 147 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 113 states have internal predecessors, (172), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 14:19:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:44,138 INFO L93 Difference]: Finished difference Result 288 states and 499 transitions. [2025-01-09 14:19:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:19:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 230 [2025-01-09 14:19:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:44,145 INFO L225 Difference]: With dead ends: 288 [2025-01-09 14:19:44,145 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 14:19:44,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 231 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:19:44,150 INFO L435 NwaCegarLoop]: 231 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, 231 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:19:44,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:19:44,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 14:19:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-01-09 14:19:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 110 states have (on average 1.518181818181818) internal successors, (167), 110 states have internal predecessors, (167), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 14:19:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 231 transitions. [2025-01-09 14:19:44,184 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 231 transitions. Word has length 230 [2025-01-09 14:19:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:44,185 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 231 transitions. [2025-01-09 14:19:44,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.5) internal successors, (75), 2 states have internal predecessors, (75), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 14:19:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 231 transitions. [2025-01-09 14:19:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 14:19:44,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:44,188 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,195 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:19:44,393 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:19:44,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:44,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:44,394 INFO L85 PathProgramCache]: Analyzing trace with hash 624923172, now seen corresponding path program 1 times [2025-01-09 14:19:44,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:44,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223460754] [2025-01-09 14:19:44,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:44,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:44,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:44,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:44,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:44,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 14:19:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223460754] [2025-01-09 14:19:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223460754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:44,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:19:44,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729916383] [2025-01-09 14:19:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:44,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:19:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:44,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:19:44,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:19:44,690 INFO L87 Difference]: Start difference. First operand 144 states and 231 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 14:19:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:44,783 INFO L93 Difference]: Finished difference Result 382 states and 612 transitions. [2025-01-09 14:19:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:19:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 230 [2025-01-09 14:19:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:44,787 INFO L225 Difference]: With dead ends: 382 [2025-01-09 14:19:44,787 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 14:19:44,788 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:19:44,788 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 149 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:44,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 430 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:19:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 14:19:44,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2025-01-09 14:19:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 193 states have (on average 1.5336787564766838) internal successors, (296), 194 states have internal predecessors, (296), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 14:19:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 380 transitions. [2025-01-09 14:19:44,816 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 380 transitions. Word has length 230 [2025-01-09 14:19:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:44,818 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 380 transitions. [2025-01-09 14:19:44,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 14:19:44,818 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 380 transitions. [2025-01-09 14:19:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 14:19:44,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:44,823 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:44,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:19:44,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:44,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:44,824 INFO L85 PathProgramCache]: Analyzing trace with hash 230556386, now seen corresponding path program 1 times [2025-01-09 14:19:44,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:44,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771069913] [2025-01-09 14:19:44,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:44,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:45,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:45,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:45,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 14:19:46,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771069913] [2025-01-09 14:19:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771069913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:19:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370162544] [2025-01-09 14:19:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:46,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:19:46,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:46,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:19:46,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:19:46,121 INFO L87 Difference]: Start difference. First operand 238 states and 380 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 14:19:46,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:46,898 INFO L93 Difference]: Finished difference Result 1141 states and 1822 transitions. [2025-01-09 14:19:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:19:46,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 230 [2025-01-09 14:19:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:46,908 INFO L225 Difference]: With dead ends: 1141 [2025-01-09 14:19:46,909 INFO L226 Difference]: Without dead ends: 906 [2025-01-09 14:19:46,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:19:46,913 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 695 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:46,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 704 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:19:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-01-09 14:19:46,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 588. [2025-01-09 14:19:46,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 499 states have (on average 1.5711422845691383) internal successors, (784), 501 states have internal predecessors, (784), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 14:19:46,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 952 transitions. [2025-01-09 14:19:46,997 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 952 transitions. Word has length 230 [2025-01-09 14:19:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:46,998 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 952 transitions. [2025-01-09 14:19:46,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 14:19:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 952 transitions. [2025-01-09 14:19:47,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 14:19:47,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:47,001 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:47,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:19:47,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:47,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:47,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1057218464, now seen corresponding path program 1 times [2025-01-09 14:19:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:47,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52134533] [2025-01-09 14:19:47,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:47,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:47,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:47,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:47,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:47,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:47,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-01-09 14:19:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52134533] [2025-01-09 14:19:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52134533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:19:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:19:47,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:19:47,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032017990] [2025-01-09 14:19:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:19:47,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:19:47,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:47,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:19:47,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:19:47,804 INFO L87 Difference]: Start difference. First operand 588 states and 952 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 14:19:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:48,021 INFO L93 Difference]: Finished difference Result 1956 states and 3173 transitions. [2025-01-09 14:19:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:19:48,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 230 [2025-01-09 14:19:48,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:48,030 INFO L225 Difference]: With dead ends: 1956 [2025-01-09 14:19:48,030 INFO L226 Difference]: Without dead ends: 1371 [2025-01-09 14:19:48,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:19:48,053 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 350 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:48,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 879 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:19:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-01-09 14:19:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1163. [2025-01-09 14:19:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 986 states have (on average 1.565922920892495) internal successors, (1544), 990 states have internal predecessors, (1544), 168 states have call successors, (168), 8 states have call predecessors, (168), 8 states have return successors, (168), 164 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 14:19:48,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1880 transitions. [2025-01-09 14:19:48,154 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1880 transitions. Word has length 230 [2025-01-09 14:19:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:48,155 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1880 transitions. [2025-01-09 14:19:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-01-09 14:19:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1880 transitions. [2025-01-09 14:19:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 14:19:48,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:48,159 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:48,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:19:48,159 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:48,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:48,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2078286818, now seen corresponding path program 1 times [2025-01-09 14:19:48,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:48,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39496778] [2025-01-09 14:19:48,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:48,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:48,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:48,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:48,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-01-09 14:19:48,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39496778] [2025-01-09 14:19:48,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39496778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:48,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084345740] [2025-01-09 14:19:48,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:48,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:48,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:48,555 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:19:48,558 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:19:48,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 14:19:48,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 14:19:48,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:48,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:48,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:19:48,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 993 proven. 54 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-01-09 14:19:48,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:19:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-01-09 14:19:49,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084345740] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:19:49,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:19:49,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 14:19:49,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211409044] [2025-01-09 14:19:49,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:19:49,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:19:49,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:49,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:19:49,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:19:49,188 INFO L87 Difference]: Start difference. First operand 1163 states and 1880 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 3 states have call successors, (73), 2 states have call predecessors, (73), 4 states have return successors, (75), 3 states have call predecessors, (75), 3 states have call successors, (75) [2025-01-09 14:19:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:49,516 INFO L93 Difference]: Finished difference Result 2387 states and 3809 transitions. [2025-01-09 14:19:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:19:49,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 3 states have call successors, (73), 2 states have call predecessors, (73), 4 states have return successors, (75), 3 states have call predecessors, (75), 3 states have call successors, (75) Word has length 230 [2025-01-09 14:19:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:49,523 INFO L225 Difference]: With dead ends: 2387 [2025-01-09 14:19:49,523 INFO L226 Difference]: Without dead ends: 1227 [2025-01-09 14:19:49,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 457 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-01-09 14:19:49,526 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 294 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:49,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 445 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:19:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-01-09 14:19:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1211. [2025-01-09 14:19:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 1022 states have (on average 1.4755381604696673) internal successors, (1508), 1026 states have internal predecessors, (1508), 168 states have call successors, (168), 20 states have call predecessors, (168), 20 states have return successors, (168), 164 states have call predecessors, (168), 168 states have call successors, (168) [2025-01-09 14:19:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1844 transitions. [2025-01-09 14:19:49,612 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1844 transitions. Word has length 230 [2025-01-09 14:19:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:49,613 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1844 transitions. [2025-01-09 14:19:49,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 3 states have call successors, (73), 2 states have call predecessors, (73), 4 states have return successors, (75), 3 states have call predecessors, (75), 3 states have call successors, (75) [2025-01-09 14:19:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1844 transitions. [2025-01-09 14:19:49,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-09 14:19:49,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:49,615 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:49,623 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:19:49,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:49,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:49,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:49,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2017264368, now seen corresponding path program 1 times [2025-01-09 14:19:49,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:49,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250899183] [2025-01-09 14:19:49,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:49,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 14:19:49,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 14:19:49,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:50,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-01-09 14:19:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250899183] [2025-01-09 14:19:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250899183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:19:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325353325] [2025-01-09 14:19:50,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:50,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:50,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:50,207 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:19:50,208 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:19:50,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 14:19:50,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 14:19:50,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:50,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:50,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:19:50,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 891 proven. 63 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-01-09 14:19:50,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:19:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-01-09 14:19:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325353325] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:19:50,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:19:50,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:19:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125645118] [2025-01-09 14:19:50,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:19:50,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:19:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:50,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:19:50,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:19:50,817 INFO L87 Difference]: Start difference. First operand 1211 states and 1844 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-01-09 14:19:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:19:51,122 INFO L93 Difference]: Finished difference Result 1977 states and 2997 transitions. [2025-01-09 14:19:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:19:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 231 [2025-01-09 14:19:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:19:51,126 INFO L225 Difference]: With dead ends: 1977 [2025-01-09 14:19:51,127 INFO L226 Difference]: Without dead ends: 769 [2025-01-09 14:19:51,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 459 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:19:51,129 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 410 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:19:51,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 508 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:19:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-01-09 14:19:51,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 752. [2025-01-09 14:19:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 595 states have (on average 1.4168067226890757) internal successors, (843), 596 states have internal predecessors, (843), 138 states have call successors, (138), 18 states have call predecessors, (138), 18 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 14:19:51,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1119 transitions. [2025-01-09 14:19:51,192 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1119 transitions. Word has length 231 [2025-01-09 14:19:51,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:19:51,192 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1119 transitions. [2025-01-09 14:19:51,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-01-09 14:19:51,192 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1119 transitions. [2025-01-09 14:19:51,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-09 14:19:51,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:19:51,195 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:51,203 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:19:51,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:51,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:19:51,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:19:51,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1658920943, now seen corresponding path program 1 times [2025-01-09 14:19:51,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:19:51,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622756348] [2025-01-09 14:19:51,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:51,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:19:51,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 14:19:51,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 14:19:51,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:51,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 14:19:51,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142192168] [2025-01-09 14:19:51,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:19:51,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:19:51,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:19:51,658 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:19:51,661 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:19:51,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-09 14:19:51,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-09 14:19:51,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:19:51,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:19:51,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 14:19:51,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:19:53,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1173 proven. 48 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-01-09 14:19:53,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:19:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-01-09 14:19:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:19:54,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622756348] [2025-01-09 14:19:54,792 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 14:19:54,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142192168] [2025-01-09 14:19:54,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142192168] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:19:54,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 14:19:54,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 31 [2025-01-09 14:19:54,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764876779] [2025-01-09 14:19:54,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 14:19:54,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-01-09 14:19:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:19:54,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-01-09 14:19:54,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=777, Unknown=1, NotChecked=0, Total=930 [2025-01-09 14:19:54,795 INFO L87 Difference]: Start difference. First operand 752 states and 1119 transitions. Second operand has 31 states, 31 states have (on average 4.419354838709677) internal successors, (137), 31 states have internal predecessors, (137), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-01-09 14:19:59,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:04,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:08,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:13,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:20:18,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:20:26,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:20:37,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:46,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:51,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:55,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-01-09 14:20:59,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:21:05,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:21:10,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-01-09 14:21:15,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]