./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 bfef9e0cd5324afc9386a78468bea49ee605e5037c2d685b322567d67d524bb4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:38:53,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:38:53,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:38:53,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:38:53,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:38:53,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:38:53,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:38:53,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:38:53,726 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:38:53,726 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:38:53,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:38:53,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:38:53,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:38:53,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:38:53,727 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:38:53,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:38:53,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:38:53,729 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:38:53,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:38:53,729 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:38:53,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:38:53,730 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/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 -> bfef9e0cd5324afc9386a78468bea49ee605e5037c2d685b322567d67d524bb4 [2025-03-08 15:38:53,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:38:53,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:38:53,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:38:53,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:38:53,957 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:38:53,958 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i [2025-03-08 15:38:55,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad0fba42/e18cddfa5b9c4e9d94cc084fe789151f/FLAGc18965908 [2025-03-08 15:38:55,378 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:38:55,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i [2025-03-08 15:38:55,385 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad0fba42/e18cddfa5b9c4e9d94cc084fe789151f/FLAGc18965908 [2025-03-08 15:38:55,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ad0fba42/e18cddfa5b9c4e9d94cc084fe789151f [2025-03-08 15:38:55,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:38:55,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:38:55,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:38:55,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:38:55,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:38:55,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87a86ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55, skipping insertion in model container [2025-03-08 15:38:55,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:38:55,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i[915,928] [2025-03-08 15:38:55,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:38:55,560 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:38:55,568 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-86.i[915,928] [2025-03-08 15:38:55,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:38:55,604 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:38:55,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55 WrapperNode [2025-03-08 15:38:55,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:38:55,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:38:55,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:38:55,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:38:55,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,653 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-03-08 15:38:55,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:38:55,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:38:55,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:38:55,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:38:55,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,692 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-03-08 15:38:55,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:38:55,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:38:55,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:38:55,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:38:55,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (1/1) ... [2025-03-08 15:38:55,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:38:55,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:38:55,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:38:55,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:38:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:38:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:38:55,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:38:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:38:55,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:38:55,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:38:55,803 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:38:55,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:38:56,024 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 15:38:56,024 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:38:56,033 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:38:56,035 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:38:56,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:38:56 BoogieIcfgContainer [2025-03-08 15:38:56,036 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:38:56,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:38:56,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:38:56,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:38:56,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:38:55" (1/3) ... [2025-03-08 15:38:56,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3903ea66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:38:56, skipping insertion in model container [2025-03-08 15:38:56,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:38:55" (2/3) ... [2025-03-08 15:38:56,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3903ea66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:38:56, skipping insertion in model container [2025-03-08 15:38:56,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:38:56" (3/3) ... [2025-03-08 15:38:56,043 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-86.i [2025-03-08 15:38:56,054 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:38:56,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-86.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:38:56,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:38:56,109 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;@1fc8946e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:38:56,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:38:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 15:38:56,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 15:38:56,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:38:56,121 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:38:56,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:38:56,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:38:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1455454040, now seen corresponding path program 1 times [2025-03-08 15:38:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:38:56,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176916494] [2025-03-08 15:38:56,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:38:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:38:56,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 15:38:56,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 15:38:56,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:38:56,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:38:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 15:38:56,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:38:56,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176916494] [2025-03-08 15:38:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176916494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:38:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089216403] [2025-03-08 15:38:56,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:38:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:38:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:38:56,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:38:56,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:38:56,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 15:38:56,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 15:38:56,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:38:56,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:38:56,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:38:56,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:38:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 15:38:56,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:38:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089216403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:38:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:38:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:38:56,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987060454] [2025-03-08 15:38:56,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:38:56,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:38:56,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:38:56,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:38:56,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:38:56,509 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 15:38:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:38:56,522 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2025-03-08 15:38:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:38:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 15:38:56,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:38:56,527 INFO L225 Difference]: With dead ends: 94 [2025-03-08 15:38:56,527 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 15:38:56,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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-03-08 15:38:56,531 INFO L435 NwaCegarLoop]: 68 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, 68 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-03-08 15:38:56,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:38:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 15:38:56,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-08 15:38:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 15:38:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-08 15:38:56,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 108 [2025-03-08 15:38:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:38:56,562 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-08 15:38:56,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 15:38:56,564 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-03-08 15:38:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 15:38:56,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:38:56,568 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:38:56,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:38:56,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:38:56,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:38:56,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:38:56,769 INFO L85 PathProgramCache]: Analyzing trace with hash 359904903, now seen corresponding path program 1 times [2025-03-08 15:38:56,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:38:56,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142136066] [2025-03-08 15:38:56,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:38:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:38:56,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 15:38:56,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 15:38:56,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:38:56,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:38:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 15:38:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:38:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142136066] [2025-03-08 15:38:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142136066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:38:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:38:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:38:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503534513] [2025-03-08 15:38:57,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:38:57,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:38:57,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:38:57,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:38:57,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:38:57,963 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 15:38:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:38:58,158 INFO L93 Difference]: Finished difference Result 164 states and 238 transitions. [2025-03-08 15:38:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:38:58,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 108 [2025-03-08 15:38:58,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:38:58,161 INFO L225 Difference]: With dead ends: 164 [2025-03-08 15:38:58,161 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 15:38:58,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:38:58,162 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 99 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:38:58,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 158 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:38:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 15:38:58,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2025-03-08 15:38:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.196969696969697) internal successors, (79), 67 states have internal predecessors, (79), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:38:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2025-03-08 15:38:58,190 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 108 [2025-03-08 15:38:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:38:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2025-03-08 15:38:58,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 15:38:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2025-03-08 15:38:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 15:38:58,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:38:58,195 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:38:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:38:58,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:38:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:38:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 388534054, now seen corresponding path program 1 times [2025-03-08 15:38:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:38:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459595038] [2025-03-08 15:38:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:38:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:38:58,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 15:38:58,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 15:38:58,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:38:58,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 15:39:00,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:00,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459595038] [2025-03-08 15:39:00,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459595038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:39:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:39:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:39:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106221463] [2025-03-08 15:39:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:00,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:39:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:00,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:39:00,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:39:00,785 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:39:01,158 INFO L93 Difference]: Finished difference Result 166 states and 230 transitions. [2025-03-08 15:39:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:39:01,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 15:39:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:39:01,161 INFO L225 Difference]: With dead ends: 166 [2025-03-08 15:39:01,161 INFO L226 Difference]: Without dead ends: 164 [2025-03-08 15:39:01,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:39:01,162 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 70 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:39:01,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 256 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:39:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-08 15:39:01,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2025-03-08 15:39:01,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 85 states have internal predecessors, (104), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:39:01,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2025-03-08 15:39:01,182 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 108 [2025-03-08 15:39:01,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:39:01,182 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2025-03-08 15:39:01,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:01,183 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2025-03-08 15:39:01,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 15:39:01,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:39:01,184 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:39:01,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:39:01,184 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:39:01,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:39:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 389457575, now seen corresponding path program 1 times [2025-03-08 15:39:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:39:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725819857] [2025-03-08 15:39:01,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:39:01,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 15:39:01,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 15:39:01,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:01,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 15:39:03,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:03,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725819857] [2025-03-08 15:39:03,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725819857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:39:03,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:39:03,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:39:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472936438] [2025-03-08 15:39:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:03,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:39:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:03,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:39:03,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:39:03,136 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:39:03,457 INFO L93 Difference]: Finished difference Result 161 states and 224 transitions. [2025-03-08 15:39:03,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:39:03,458 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 15:39:03,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:39:03,460 INFO L225 Difference]: With dead ends: 161 [2025-03-08 15:39:03,460 INFO L226 Difference]: Without dead ends: 159 [2025-03-08 15:39:03,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:39:03,461 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 41 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:39:03,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 260 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:39:03,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-08 15:39:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2025-03-08 15:39:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 85 states have internal predecessors, (104), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:39:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 194 transitions. [2025-03-08 15:39:03,493 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 194 transitions. Word has length 108 [2025-03-08 15:39:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:39:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 194 transitions. [2025-03-08 15:39:03,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 194 transitions. [2025-03-08 15:39:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 15:39:03,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:39:03,497 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:39:03,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:39:03,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:39:03,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:39:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash 192020549, now seen corresponding path program 1 times [2025-03-08 15:39:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:39:03,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212621099] [2025-03-08 15:39:03,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:39:03,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 15:39:03,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 15:39:03,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:03,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 15:39:04,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:04,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212621099] [2025-03-08 15:39:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212621099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:39:04,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:39:04,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 15:39:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161645324] [2025-03-08 15:39:04,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:04,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:39:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:04,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:39:04,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:39:04,904 INFO L87 Difference]: Start difference. First operand 133 states and 194 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:39:05,117 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2025-03-08 15:39:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 15:39:05,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-08 15:39:05,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:39:05,121 INFO L225 Difference]: With dead ends: 146 [2025-03-08 15:39:05,121 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 15:39:05,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 15:39:05,122 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:39:05,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 320 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:39:05,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 15:39:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2025-03-08 15:39:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 79 states have internal predecessors, (95), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 15:39:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2025-03-08 15:39:05,141 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 108 [2025-03-08 15:39:05,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:39:05,143 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2025-03-08 15:39:05,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:05,143 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2025-03-08 15:39:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 15:39:05,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:39:05,144 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:39:05,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:39:05,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:39:05,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:39:05,144 INFO L85 PathProgramCache]: Analyzing trace with hash -639301667, now seen corresponding path program 1 times [2025-03-08 15:39:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:39:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032878530] [2025-03-08 15:39:05,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:39:05,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 15:39:05,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 15:39:05,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:05,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 15:39:05,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032878530] [2025-03-08 15:39:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032878530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:39:05,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:39:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:39:05,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986737618] [2025-03-08 15:39:05,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:05,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:39:05,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:05,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:39:05,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:39:05,189 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:39:05,228 INFO L93 Difference]: Finished difference Result 369 states and 539 transitions. [2025-03-08 15:39:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:39:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-08 15:39:05,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:39:05,231 INFO L225 Difference]: With dead ends: 369 [2025-03-08 15:39:05,233 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 15:39:05,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:39:05,235 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 58 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:39:05,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:39:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 15:39:05,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2025-03-08 15:39:05,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 145 states have (on average 1.1655172413793105) internal successors, (169), 147 states have internal predecessors, (169), 90 states have call successors, (90), 6 states have call predecessors, (90), 6 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-08 15:39:05,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 349 transitions. [2025-03-08 15:39:05,271 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 349 transitions. Word has length 109 [2025-03-08 15:39:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:39:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 349 transitions. [2025-03-08 15:39:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:05,273 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 349 transitions. [2025-03-08 15:39:05,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 15:39:05,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:39:05,274 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:39:05,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:39:05,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:39:05,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:39:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash -638378146, now seen corresponding path program 1 times [2025-03-08 15:39:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:39:05,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729744567] [2025-03-08 15:39:05,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:39:05,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 15:39:05,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 15:39:05,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:05,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 15:39:06,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:06,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729744567] [2025-03-08 15:39:06,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729744567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:39:06,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:39:06,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:39:06,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834168127] [2025-03-08 15:39:06,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:06,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:39:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:06,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:39:06,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:39:06,004 INFO L87 Difference]: Start difference. First operand 242 states and 349 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:39:06,209 INFO L93 Difference]: Finished difference Result 446 states and 630 transitions. [2025-03-08 15:39:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:39:06,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-08 15:39:06,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:39:06,212 INFO L225 Difference]: With dead ends: 446 [2025-03-08 15:39:06,212 INFO L226 Difference]: Without dead ends: 293 [2025-03-08 15:39:06,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:39:06,213 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 47 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:39:06,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 337 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:39:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-08 15:39:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 264. [2025-03-08 15:39:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 157 states have (on average 1.1464968152866242) internal successors, (180), 160 states have internal predecessors, (180), 99 states have call successors, (99), 7 states have call predecessors, (99), 7 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 15:39:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 378 transitions. [2025-03-08 15:39:06,268 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 378 transitions. Word has length 109 [2025-03-08 15:39:06,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:39:06,268 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 378 transitions. [2025-03-08 15:39:06,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 378 transitions. [2025-03-08 15:39:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 15:39:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:39:06,271 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 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, 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, 1, 1, 1, 1] [2025-03-08 15:39:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:39:06,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:39:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:39:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1992128257, now seen corresponding path program 1 times [2025-03-08 15:39:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:39:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711168182] [2025-03-08 15:39:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:39:06,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 15:39:06,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 15:39:06,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:06,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2272 trivial. 0 not checked. [2025-03-08 15:39:07,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:07,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711168182] [2025-03-08 15:39:07,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711168182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:39:07,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:39:07,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 15:39:07,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795667737] [2025-03-08 15:39:07,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:07,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:39:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:07,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:39:07,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:39:07,973 INFO L87 Difference]: Start difference. First operand 264 states and 378 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:39:08,530 INFO L93 Difference]: Finished difference Result 444 states and 635 transitions. [2025-03-08 15:39:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 15:39:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 214 [2025-03-08 15:39:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:39:08,537 INFO L225 Difference]: With dead ends: 444 [2025-03-08 15:39:08,538 INFO L226 Difference]: Without dead ends: 442 [2025-03-08 15:39:08,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:39:08,538 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:39:08,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 251 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:39:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-08 15:39:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 436. [2025-03-08 15:39:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 241 states have (on average 1.099585062240664) internal successors, (265), 250 states have internal predecessors, (265), 181 states have call successors, (181), 13 states have call predecessors, (181), 13 states have return successors, (181), 172 states have call predecessors, (181), 181 states have call successors, (181) [2025-03-08 15:39:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 627 transitions. [2025-03-08 15:39:08,584 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 627 transitions. Word has length 214 [2025-03-08 15:39:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:39:08,584 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 627 transitions. [2025-03-08 15:39:08,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 627 transitions. [2025-03-08 15:39:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 15:39:08,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:39:08,588 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 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, 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, 1, 1] [2025-03-08 15:39:08,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:39:08,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:39:08,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:39:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1993051778, now seen corresponding path program 1 times [2025-03-08 15:39:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:39:08,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435223566] [2025-03-08 15:39:08,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:39:08,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 15:39:08,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 15:39:08,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:08,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:11,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2025-03-08 15:39:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:39:11,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435223566] [2025-03-08 15:39:11,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435223566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:39:11,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156887918] [2025-03-08 15:39:11,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:39:11,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:39:11,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:39:11,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:39:11,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:39:11,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 15:39:11,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 15:39:11,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:39:11,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:39:11,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 15:39:11,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:39:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 263 proven. 66 refuted. 0 times theorem prover too weak. 1951 trivial. 0 not checked. [2025-03-08 15:39:19,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:39:35,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2272 trivial. 0 not checked. [2025-03-08 15:39:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156887918] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 15:39:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:39:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 15] total 33 [2025-03-08 15:39:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500701153] [2025-03-08 15:39:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:39:35,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:39:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:39:35,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:39:35,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=944, Unknown=1, NotChecked=0, Total=1056 [2025-03-08 15:39:35,142 INFO L87 Difference]: Start difference. First operand 436 states and 627 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:39:43,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:39:47,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:39:50,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:39:57,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:40:01,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:40:12,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:40:16,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-08 15:40:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:40:17,568 INFO L93 Difference]: Finished difference Result 563 states and 799 transitions. [2025-03-08 15:40:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 15:40:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 214 [2025-03-08 15:40:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:40:17,572 INFO L225 Difference]: With dead ends: 563 [2025-03-08 15:40:17,572 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 15:40:17,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=153, Invalid=1325, Unknown=4, NotChecked=0, Total=1482 [2025-03-08 15:40:17,575 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 116 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 18 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:40:17,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 287 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 27.8s Time] [2025-03-08 15:40:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 15:40:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 15:40:17,576 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-03-08 15:40:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 15:40:17,576 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 214 [2025-03-08 15:40:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:40:17,576 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 15:40:17,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 15:40:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 15:40:17,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 15:40:17,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:40:17,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:40:17,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 15:40:17,784 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:40:17,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 15:40:17,915 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:40:17,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:40:17 BoogieIcfgContainer [2025-03-08 15:40:17,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:40:17,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:40:17,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:40:17,923 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:40:17,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:38:56" (3/4) ... [2025-03-08 15:40:17,925 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 15:40:17,930 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 15:40:17,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-08 15:40:17,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 15:40:17,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 15:40:17,933 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 15:40:17,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 15:40:17,990 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 15:40:17,990 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:40:17,991 INFO L158 Benchmark]: Toolchain (without parser) took 82593.01ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 123.3MB in the beginning and 767.6MB in the end (delta: -644.3MB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. [2025-03-08 15:40:17,991 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:40:17,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.90ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:40:17,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.35ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 107.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:40:17,992 INFO L158 Benchmark]: Boogie Preprocessor took 49.51ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 103.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:40:17,992 INFO L158 Benchmark]: IcfgBuilder took 327.40ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 83.7MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 15:40:17,992 INFO L158 Benchmark]: TraceAbstraction took 81884.43ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 83.7MB in the beginning and 775.9MB in the end (delta: -692.2MB). Peak memory consumption was 224.0MB. Max. memory is 16.1GB. [2025-03-08 15:40:17,992 INFO L158 Benchmark]: Witness Printer took 67.45ms. Allocated memory is still 1.1GB. Free memory was 775.9MB in the beginning and 767.6MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:40:17,993 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.90ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.35ms. Allocated memory is still 167.8MB. Free memory was 110.7MB in the beginning and 107.9MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.51ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 103.0MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 327.40ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 83.7MB in the end (delta: 19.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 81884.43ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 914.4MB). Free memory was 83.7MB in the beginning and 775.9MB in the end (delta: -692.2MB). Peak memory consumption was 224.0MB. Max. memory is 16.1GB. * Witness Printer took 67.45ms. Allocated memory is still 1.1GB. Free memory was 775.9MB in the beginning and 767.6MB in the end (delta: 8.3MB). There was no memory consumed. 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, 50 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.7s, OverallIterations: 9, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 524 SdHoareTripleChecker+Valid, 28.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 524 mSDsluCounter, 2123 SdHoareTripleChecker+Invalid, 28.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1462 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 875 IncrementalHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 661 mSDtfsCounter, 875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 23.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=8, InterpolantAutomatonStates: 65, 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, 117 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1508 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1710 ConstructedInterpolants, 1 QuantifiedInterpolants, 7924 SizeOfPredicates, 23 NumberOfNonLiveVariables, 694 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 13369/13472 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 RESULT: Ultimate proved your program to be correct! [2025-03-08 15:40:18,198 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 15:40:18,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE