./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_amount25_file-34.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 5adbbf8a924bfe8763640545f809c584dffdae3b3be7bc6b6666374423fa435d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:27:40,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:27:40,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:27:40,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:27:40,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:27:40,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:27:40,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:27:40,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:27:40,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:27:40,681 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:27:40,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:27:40,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:27:40,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:27:40,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:27:40,682 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:27:40,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:27:40,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:27:40,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:27:40,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:27:40,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:27:40,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:27:40,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:27:40,686 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 -> 5adbbf8a924bfe8763640545f809c584dffdae3b3be7bc6b6666374423fa435d [2025-02-06 02:27:40,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:27:40,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:27:40,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:27:40,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:27:40,891 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:27:40,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2025-02-06 02:27:42,083 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07ad0d3b6/f0ab126525474df589d5dbf19ca1d0d3/FLAG778a6cd23 [2025-02-06 02:27:42,330 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:27:42,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2025-02-06 02:27:42,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07ad0d3b6/f0ab126525474df589d5dbf19ca1d0d3/FLAG778a6cd23 [2025-02-06 02:27:42,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/07ad0d3b6/f0ab126525474df589d5dbf19ca1d0d3 [2025-02-06 02:27:42,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:27:42,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:27:42,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:27:42,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:27:42,360 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:27:42,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c2ddbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42, skipping insertion in model container [2025-02-06 02:27:42,362 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:27:42,490 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_amount25_file-34.i[915,928] [2025-02-06 02:27:42,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:27:42,519 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:27:42,527 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_amount25_file-34.i[915,928] [2025-02-06 02:27:42,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:27:42,547 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:27:42,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42 WrapperNode [2025-02-06 02:27:42,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:27:42,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:27:42,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:27:42,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:27:42,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,574 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 85 [2025-02-06 02:27:42,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:27:42,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:27:42,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:27:42,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:27:42,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,587 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,595 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-02-06 02:27:42,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:27:42,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:27:42,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:27:42,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:27:42,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (1/1) ... [2025-02-06 02:27:42,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:27:42,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:42,633 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-02-06 02:27:42,636 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-02-06 02:27:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:27:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:27:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:27:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:27:42,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:27:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:27:42,693 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:27:42,694 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:27:42,870 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-02-06 02:27:42,870 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:27:42,876 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:27:42,876 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:27:42,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:42 BoogieIcfgContainer [2025-02-06 02:27:42,877 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:27:42,879 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:27:42,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:27:42,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:27:42,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:27:42" (1/3) ... [2025-02-06 02:27:42,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5787f005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:27:42, skipping insertion in model container [2025-02-06 02:27:42,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:27:42" (2/3) ... [2025-02-06 02:27:42,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5787f005 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:27:42, skipping insertion in model container [2025-02-06 02:27:42,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:42" (3/3) ... [2025-02-06 02:27:42,883 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-34.i [2025-02-06 02:27:42,894 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:27:42,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-34.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:27:42,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:27:42,934 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;@14e3ad7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:27:42,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:27:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 02:27:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 02:27:42,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:42,942 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:42,943 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:42,946 INFO L85 PathProgramCache]: Analyzing trace with hash -203959768, now seen corresponding path program 1 times [2025-02-06 02:27:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:42,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372887788] [2025-02-06 02:27:42,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:43,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 02:27:43,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 02:27:43,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 02:27:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372887788] [2025-02-06 02:27:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372887788] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:27:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815330508] [2025-02-06 02:27:43,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:43,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:43,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:43,121 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-02-06 02:27:43,123 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-02-06 02:27:43,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 02:27:43,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 02:27:43,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:43,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:27:43,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:27:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 02:27:43,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:27:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815330508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:27:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:27:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059315488] [2025-02-06 02:27:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:43,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:27:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:43,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:27:43,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:27:43,255 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 02:27:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:43,270 INFO L93 Difference]: Finished difference Result 70 states and 110 transitions. [2025-02-06 02:27:43,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:27:43,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2025-02-06 02:27:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:43,277 INFO L225 Difference]: With dead ends: 70 [2025-02-06 02:27:43,277 INFO L226 Difference]: Without dead ends: 35 [2025-02-06 02:27:43,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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-02-06 02:27:43,283 INFO L435 NwaCegarLoop]: 48 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, 48 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-02-06 02:27:43,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-06 02:27:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-02-06 02:27:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-06 02:27:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-02-06 02:27:43,315 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 63 [2025-02-06 02:27:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:43,315 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-02-06 02:27:43,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-06 02:27:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-02-06 02:27:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 02:27:43,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:43,318 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:43,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:27:43,518 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-02-06 02:27:43,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:43,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash 450325767, now seen corresponding path program 1 times [2025-02-06 02:27:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:43,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088658019] [2025-02-06 02:27:43,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:43,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:43,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 02:27:43,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 02:27:43,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:43,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 02:27:45,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:45,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088658019] [2025-02-06 02:27:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088658019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:45,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:27:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704078714] [2025-02-06 02:27:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:45,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:27:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:45,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:27:45,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:45,407 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:45,901 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2025-02-06 02:27:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:27:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2025-02-06 02:27:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:45,903 INFO L225 Difference]: With dead ends: 94 [2025-02-06 02:27:45,903 INFO L226 Difference]: Without dead ends: 92 [2025-02-06 02:27:45,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:27:45,904 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:45,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 216 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:45,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-06 02:27:45,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2025-02-06 02:27:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 02:27:45,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2025-02-06 02:27:45,919 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 63 [2025-02-06 02:27:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2025-02-06 02:27:45,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2025-02-06 02:27:45,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-06 02:27:45,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:45,920 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:45,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:27:45,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:45,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:45,921 INFO L85 PathProgramCache]: Analyzing trace with hash 451249288, now seen corresponding path program 1 times [2025-02-06 02:27:45,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:45,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220301745] [2025-02-06 02:27:45,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:45,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:45,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-06 02:27:45,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-06 02:27:45,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:45,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 02:27:46,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:46,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220301745] [2025-02-06 02:27:46,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220301745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:46,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:46,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:27:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814221544] [2025-02-06 02:27:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:46,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:27:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:46,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:27:46,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:27:46,815 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:47,199 INFO L93 Difference]: Finished difference Result 234 states and 315 transitions. [2025-02-06 02:27:47,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:27:47,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2025-02-06 02:27:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:47,201 INFO L225 Difference]: With dead ends: 234 [2025-02-06 02:27:47,201 INFO L226 Difference]: Without dead ends: 166 [2025-02-06 02:27:47,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:27:47,202 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 72 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:47,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 308 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:27:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-06 02:27:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2025-02-06 02:27:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.168421052631579) internal successors, (111), 95 states have internal predecessors, (111), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 02:27:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2025-02-06 02:27:47,232 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 63 [2025-02-06 02:27:47,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:47,233 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2025-02-06 02:27:47,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2025-02-06 02:27:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 02:27:47,234 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:47,234 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:47,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:27:47,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:47,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:47,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1362128889, now seen corresponding path program 1 times [2025-02-06 02:27:47,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:47,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216641892] [2025-02-06 02:27:47,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:47,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:47,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 02:27:47,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 02:27:47,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:47,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 02:27:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216641892] [2025-02-06 02:27:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216641892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:47,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:27:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735191767] [2025-02-06 02:27:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:47,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:27:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:47,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:27:47,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:27:47,342 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:47,417 INFO L93 Difference]: Finished difference Result 327 states and 430 transitions. [2025-02-06 02:27:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:27:47,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 02:27:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:47,421 INFO L225 Difference]: With dead ends: 327 [2025-02-06 02:27:47,421 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 02:27:47,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:47,422 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:47,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 126 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 02:27:47,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2025-02-06 02:27:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 107 states have (on average 1.158878504672897) internal successors, (124), 107 states have internal predecessors, (124), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-06 02:27:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2025-02-06 02:27:47,460 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 64 [2025-02-06 02:27:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2025-02-06 02:27:47,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2025-02-06 02:27:47,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 02:27:47,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:47,462 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:47,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:27:47,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:47,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:47,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1190028072, now seen corresponding path program 1 times [2025-02-06 02:27:47,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:47,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044679481] [2025-02-06 02:27:47,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:47,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:47,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 02:27:47,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 02:27:47,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:47,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 02:27:47,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:47,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044679481] [2025-02-06 02:27:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044679481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:47,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:27:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735577946] [2025-02-06 02:27:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:27:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:47,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:27:47,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:27:47,568 INFO L87 Difference]: Start difference. First operand 162 states and 214 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:47,640 INFO L93 Difference]: Finished difference Result 389 states and 517 transitions. [2025-02-06 02:27:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:27:47,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 02:27:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:47,643 INFO L225 Difference]: With dead ends: 389 [2025-02-06 02:27:47,643 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 02:27:47,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:47,644 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 55 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:47,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 137 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 02:27:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 186. [2025-02-06 02:27:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 121 states have (on average 1.1487603305785123) internal successors, (139), 123 states have internal predecessors, (139), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 02:27:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2025-02-06 02:27:47,682 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 64 [2025-02-06 02:27:47,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:47,684 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2025-02-06 02:27:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2025-02-06 02:27:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 02:27:47,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:47,685 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:47,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:27:47,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:47,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash 245936572, now seen corresponding path program 1 times [2025-02-06 02:27:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600512976] [2025-02-06 02:27:47,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:47,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 02:27:47,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 02:27:47,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 02:27:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600512976] [2025-02-06 02:27:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600512976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:27:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374544703] [2025-02-06 02:27:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:27:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:49,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:27:49,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:49,123 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:49,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:49,390 INFO L93 Difference]: Finished difference Result 319 states and 419 transitions. [2025-02-06 02:27:49,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:27:49,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2025-02-06 02:27:49,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:49,393 INFO L225 Difference]: With dead ends: 319 [2025-02-06 02:27:49,393 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 02:27:49,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:27:49,395 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 44 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:49,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 191 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 02:27:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 192. [2025-02-06 02:27:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 129 states have internal predecessors, (147), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2025-02-06 02:27:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2025-02-06 02:27:49,424 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 64 [2025-02-06 02:27:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:49,424 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2025-02-06 02:27:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-06 02:27:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2025-02-06 02:27:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-06 02:27:49,425 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:49,425 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:27:49,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:27:49,426 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:49,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 274565723, now seen corresponding path program 1 times [2025-02-06 02:27:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080711184] [2025-02-06 02:27:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:49,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 02:27:49,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 02:27:49,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:49,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 02:27:49,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080711184] [2025-02-06 02:27:49,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080711184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:27:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963655766] [2025-02-06 02:27:49,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:49,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:49,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:49,597 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-02-06 02:27:49,598 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-02-06 02:27:49,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 02:27:49,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 02:27:49,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:49,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:49,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 02:27:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:27:49,726 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-06 02:27:49,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:27:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-02-06 02:27:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963655766] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:27:49,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:27:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-06 02:27:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860883804] [2025-02-06 02:27:49,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:27:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:27:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:49,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:27:49,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:27:49,826 INFO L87 Difference]: Start difference. First operand 192 states and 255 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 02:27:49,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:49,934 INFO L93 Difference]: Finished difference Result 309 states and 398 transitions. [2025-02-06 02:27:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:27:49,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 64 [2025-02-06 02:27:49,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:49,935 INFO L225 Difference]: With dead ends: 309 [2025-02-06 02:27:49,935 INFO L226 Difference]: Without dead ends: 120 [2025-02-06 02:27:49,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:27:49,936 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 99 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:49,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 73 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:27:49,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-02-06 02:27:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2025-02-06 02:27:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 02:27:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2025-02-06 02:27:49,948 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 64 [2025-02-06 02:27:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:49,949 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2025-02-06 02:27:49,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 02:27:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2025-02-06 02:27:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 02:27:49,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:49,950 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:27:49,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:27:50,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:50,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:50,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:50,155 INFO L85 PathProgramCache]: Analyzing trace with hash -527391843, now seen corresponding path program 1 times [2025-02-06 02:27:50,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:50,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896455677] [2025-02-06 02:27:50,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:50,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:50,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:27:50,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:27:50,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:50,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 02:27:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896455677] [2025-02-06 02:27:50,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896455677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:27:50,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:27:50,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:27:50,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833621661] [2025-02-06 02:27:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:27:50,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:27:50,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:27:50,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:27:50,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:27:50,253 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 02:27:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:27:50,298 INFO L93 Difference]: Finished difference Result 213 states and 261 transitions. [2025-02-06 02:27:50,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:27:50,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2025-02-06 02:27:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:27:50,299 INFO L225 Difference]: With dead ends: 213 [2025-02-06 02:27:50,299 INFO L226 Difference]: Without dead ends: 108 [2025-02-06 02:27:50,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:27:50,300 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:27:50,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:27:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-06 02:27:50,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-06 02:27:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 73 states have internal predecessors, (77), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 02:27:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2025-02-06 02:27:50,312 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 124 [2025-02-06 02:27:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:27:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2025-02-06 02:27:50,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 02:27:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2025-02-06 02:27:50,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 02:27:50,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:27:50,314 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:27:50,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:27:50,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:27:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:27:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1215418492, now seen corresponding path program 1 times [2025-02-06 02:27:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:27:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856401768] [2025-02-06 02:27:50,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:27:50,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:27:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:27:50,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:50,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-02-06 02:27:51,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:27:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856401768] [2025-02-06 02:27:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856401768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:27:51,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166804988] [2025-02-06 02:27:51,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:27:51,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:27:51,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:27:51,471 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-02-06 02:27:51,473 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-02-06 02:27:51,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 02:27:51,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 02:27:51,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:27:51,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:27:51,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 02:27:51,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:29:02,177 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 259 proven. 51 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-02-06 02:29:02,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:29:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 53 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2025-02-06 02:29:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166804988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:29:12,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:29:12,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2025-02-06 02:29:12,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308874958] [2025-02-06 02:29:12,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:29:12,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 02:29:12,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:29:12,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 02:29:12,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-02-06 02:29:12,631 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-06 02:29:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:29:14,372 INFO L93 Difference]: Finished difference Result 151 states and 176 transitions. [2025-02-06 02:29:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 02:29:14,372 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 124 [2025-02-06 02:29:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:29:14,373 INFO L225 Difference]: With dead ends: 151 [2025-02-06 02:29:14,373 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 02:29:14,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=533, Invalid=1917, Unknown=0, NotChecked=0, Total=2450 [2025-02-06 02:29:14,375 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 152 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:29:14,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 287 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:29:14,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 02:29:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 02:29:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 02:29:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 02:29:14,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2025-02-06 02:29:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:29:14,376 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 02:29:14,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 3 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2025-02-06 02:29:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 02:29:14,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 02:29:14,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 02:29:14,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 02:29:14,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:29:14,582 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:29:14,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 02:29:15,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 02:29:15,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 02:29:15 BoogieIcfgContainer [2025-02-06 02:29:15,876 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 02:29:15,877 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 02:29:15,877 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 02:29:15,877 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 02:29:15,878 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:27:42" (3/4) ... [2025-02-06 02:29:15,879 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 02:29:15,886 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 02:29:15,889 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 02:29:15,889 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 02:29:15,889 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 02:29:15,889 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 02:29:15,960 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 02:29:15,961 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 02:29:15,961 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 02:29:15,961 INFO L158 Benchmark]: Toolchain (without parser) took 93604.64ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 123.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 343.4MB. Max. memory is 16.1GB. [2025-02-06 02:29:15,962 INFO L158 Benchmark]: CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:29:15,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.87ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 111.2MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:29:15,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.39ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 02:29:15,962 INFO L158 Benchmark]: Boogie Preprocessor took 26.99ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:29:15,963 INFO L158 Benchmark]: IcfgBuilder took 274.62ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 93.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:29:15,963 INFO L158 Benchmark]: TraceAbstraction took 92997.66ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-06 02:29:15,963 INFO L158 Benchmark]: Witness Printer took 83.97ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 02:29:15,964 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99ms. Allocated memory is still 201.3MB. Free memory is still 120.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.87ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 111.2MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.39ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.99ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 274.62ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 93.6MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 92997.66ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 92.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 83.97ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 91.7s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 557 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1018 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 811 IncrementalHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 409 mSDtfsCounter, 811 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 550 GetRequests, 448 SyntacticMatches, 4 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=6, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 188 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 87.0s InterpolantComputationTime, 944 NumberOfCodeBlocks, 944 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1118 ConstructedInterpolants, 0 QuantifiedInterpolants, 4500 SizeOfPredicates, 20 NumberOfNonLiveVariables, 643 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 3850/3980 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Location Invariant Derived location invariant: (((((0 <= 0) && (var_1_8 <= 0)) && (last_1_var_1_17 <= 0)) && (var_1_17 <= 0)) && (var_1_11 <= 0)) RESULT: Ultimate proved your program to be correct! [2025-02-06 02:29:15,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE