./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_amount10_file-52.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 b5838620bd457809ceed4f0c203968d420f7009ec8bbf098cce61ac908814018 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:17,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:17,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:23:17,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:17,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:17,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:17,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:17,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:17,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:17,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:17,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:17,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:17,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:17,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:17,806 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:17,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:17,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:17,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:17,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:17,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:17,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:17,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:17,808 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 -> b5838620bd457809ceed4f0c203968d420f7009ec8bbf098cce61ac908814018 [2025-03-17 04:23:18,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:18,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:18,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:18,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:18,030 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:18,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i [2025-03-17 04:23:19,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2d93ecf/3eb0c436bba741f7ab8b9da221e6c641/FLAG34c9e3c63 [2025-03-17 04:23:19,405 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:19,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-52.i [2025-03-17 04:23:19,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2d93ecf/3eb0c436bba741f7ab8b9da221e6c641/FLAG34c9e3c63 [2025-03-17 04:23:19,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2d93ecf/3eb0c436bba741f7ab8b9da221e6c641 [2025-03-17 04:23:19,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:19,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:19,437 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:19,437 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:19,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:19,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d2a2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19, skipping insertion in model container [2025-03-17 04:23:19,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,454 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:19,551 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_amount10_file-52.i[915,928] [2025-03-17 04:23:19,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:19,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:19,585 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_amount10_file-52.i[915,928] [2025-03-17 04:23:19,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:19,602 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:19,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19 WrapperNode [2025-03-17 04:23:19,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:19,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:19,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:19,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:19,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,629 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 60 [2025-03-17 04:23:19,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:19,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:19,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:19,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:19,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,643 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-17 04:23:19,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:19,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:19,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:19,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:19,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (1/1) ... [2025-03-17 04:23:19,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:19,672 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-17 04:23:19,674 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-17 04:23:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:19,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:19,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:23:19,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:19,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:19,729 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:19,731 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:19,848 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:19,848 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:19,854 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:19,854 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:19,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:19 BoogieIcfgContainer [2025-03-17 04:23:19,855 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:19,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:19,857 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:19,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:19,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:19" (1/3) ... [2025-03-17 04:23:19,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29141a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:19, skipping insertion in model container [2025-03-17 04:23:19,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:19" (2/3) ... [2025-03-17 04:23:19,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29141a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:19, skipping insertion in model container [2025-03-17 04:23:19,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:19" (3/3) ... [2025-03-17 04:23:19,861 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-52.i [2025-03-17 04:23:19,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:19,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-52.i that has 2 procedures, 26 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:19,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:19,922 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;@4c066ee9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:19,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:19,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 04:23:19,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 04:23:19,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:19,931 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 04:23:19,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:19,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:19,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1578430097, now seen corresponding path program 1 times [2025-03-17 04:23:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:19,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724212248] [2025-03-17 04:23:19,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:19,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 04:23:20,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 04:23:20,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:20,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 04:23:20,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:20,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724212248] [2025-03-17 04:23:20,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724212248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:23:20,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378642310] [2025-03-17 04:23:20,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:20,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:23:20,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:20,072 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-17 04:23:20,076 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-17 04:23:20,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 04:23:20,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 04:23:20,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:20,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:20,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-17 04:23:20,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378642310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:23:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:23:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676459754] [2025-03-17 04:23:20,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:20,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:20,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:20,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:20,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:20,198 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 04:23:20,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:20,212 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2025-03-17 04:23:20,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:20,214 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2025-03-17 04:23:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:20,219 INFO L225 Difference]: With dead ends: 49 [2025-03-17 04:23:20,219 INFO L226 Difference]: Without dead ends: 24 [2025-03-17 04:23:20,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 42 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-17 04:23:20,226 INFO L435 NwaCegarLoop]: 32 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, 32 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-17 04:23:20,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:20,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-17 04:23:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 04:23:20,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 04:23:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-03-17 04:23:20,256 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 41 [2025-03-17 04:23:20,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:20,257 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-03-17 04:23:20,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 04:23:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-03-17 04:23:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 04:23:20,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:20,259 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 04:23:20,266 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-17 04:23:20,459 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-17 04:23:20,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:20,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1705359153, now seen corresponding path program 1 times [2025-03-17 04:23:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:20,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624121357] [2025-03-17 04:23:20,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:20,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:20,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 04:23:20,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 04:23:20,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:20,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 04:23:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624121357] [2025-03-17 04:23:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624121357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:20,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:20,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:23:20,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011392734] [2025-03-17 04:23:20,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:20,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:23:20,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:20,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:23:20,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:23:20,903 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:20,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:20,994 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-17 04:23:20,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:23:20,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2025-03-17 04:23:20,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:20,996 INFO L225 Difference]: With dead ends: 39 [2025-03-17 04:23:20,996 INFO L226 Difference]: Without dead ends: 37 [2025-03-17 04:23:20,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:20,996 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:20,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:23:20,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-17 04:23:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2025-03-17 04:23:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 04:23:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-17 04:23:21,004 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 41 [2025-03-17 04:23:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:21,005 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-17 04:23:21,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-17 04:23:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 04:23:21,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:21,007 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 04:23:21,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:23:21,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:21,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:21,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1676730002, now seen corresponding path program 1 times [2025-03-17 04:23:21,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:21,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788848333] [2025-03-17 04:23:21,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:21,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:21,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 04:23:21,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 04:23:21,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 04:23:21,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:21,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788848333] [2025-03-17 04:23:21,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788848333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:21,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:21,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:23:21,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114413620] [2025-03-17 04:23:21,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:21,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:23:21,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:21,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:23:21,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:23:21,998 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:22,153 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2025-03-17 04:23:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:23:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2025-03-17 04:23:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:22,154 INFO L225 Difference]: With dead ends: 40 [2025-03-17 04:23:22,154 INFO L226 Difference]: Without dead ends: 38 [2025-03-17 04:23:22,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:22,155 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:22,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:23:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-17 04:23:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2025-03-17 04:23:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 04:23:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-17 04:23:22,159 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 41 [2025-03-17 04:23:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:22,160 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-17 04:23:22,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:22,160 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-17 04:23:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 04:23:22,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:22,160 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 04:23:22,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:23:22,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1327417965, now seen corresponding path program 1 times [2025-03-17 04:23:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759593103] [2025-03-17 04:23:22,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:22,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 04:23:22,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 04:23:22,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:22,497 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 04:23:22,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:22,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759593103] [2025-03-17 04:23:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759593103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:22,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:22,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:23:22,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103341179] [2025-03-17 04:23:22,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:23:22,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:22,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:23:22,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:22,499 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:22,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:22,594 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2025-03-17 04:23:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:23:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-03-17 04:23:22,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:22,596 INFO L225 Difference]: With dead ends: 45 [2025-03-17 04:23:22,596 INFO L226 Difference]: Without dead ends: 43 [2025-03-17 04:23:22,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:23:22,596 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:22,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:23:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-17 04:23:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2025-03-17 04:23:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 04:23:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-17 04:23:22,603 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 42 [2025-03-17 04:23:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:22,603 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-17 04:23:22,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-17 04:23:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 04:23:22,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:22,604 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 04:23:22,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:23:22,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:22,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1327388174, now seen corresponding path program 1 times [2025-03-17 04:23:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040893712] [2025-03-17 04:23:22,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:22,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 04:23:22,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 04:23:22,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 04:23:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040893712] [2025-03-17 04:23:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040893712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:23,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:23,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:23:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186080976] [2025-03-17 04:23:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:23,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:23:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:23,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:23:23,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:23,456 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:23,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:23,543 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2025-03-17 04:23:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:23:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-03-17 04:23:23,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:23,545 INFO L225 Difference]: With dead ends: 37 [2025-03-17 04:23:23,546 INFO L226 Difference]: Without dead ends: 35 [2025-03-17 04:23:23,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:23:23,547 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:23,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:23:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-17 04:23:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2025-03-17 04:23:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 04:23:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2025-03-17 04:23:23,552 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 42 [2025-03-17 04:23:23,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2025-03-17 04:23:23,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:23,553 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2025-03-17 04:23:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 04:23:23,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:23,553 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 04:23:23,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:23:23,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:23,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:23,554 INFO L85 PathProgramCache]: Analyzing trace with hash -439914284, now seen corresponding path program 1 times [2025-03-17 04:23:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102784973] [2025-03-17 04:23:23,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:23,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:23,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 04:23:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 04:23:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 04:23:23,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:23,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102784973] [2025-03-17 04:23:23,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102784973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:23,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:23,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 04:23:23,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857247071] [2025-03-17 04:23:23,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:23,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:23:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:23,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:23:23,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:23:23,815 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:23,882 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2025-03-17 04:23:23,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:23:23,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2025-03-17 04:23:23,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:23,883 INFO L225 Difference]: With dead ends: 36 [2025-03-17 04:23:23,883 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:23:23,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:23:23,883 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:23,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:23:23,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:23:23,884 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-17 04:23:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:23:23,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2025-03-17 04:23:23,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:23,885 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:23:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 04:23:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:23:23,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:23:23,887 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:23:23,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:23:23,889 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 04:23:23,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:23:23,903 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:23:23,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:23:23 BoogieIcfgContainer [2025-03-17 04:23:23,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:23:23,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:23:23,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:23:23,910 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:23:23,910 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:19" (3/4) ... [2025-03-17 04:23:23,912 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:23:23,916 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:23:23,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-17 04:23:23,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 04:23:23,918 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:23:23,919 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:23:23,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:23:23,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:23:23,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:23:23,972 INFO L158 Benchmark]: Toolchain (without parser) took 4536.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 122.1MB in the beginning and 116.4MB in the end (delta: 5.7MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,972 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:23,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.18ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.94ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:23,973 INFO L158 Benchmark]: Boogie Preprocessor took 18.97ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,973 INFO L158 Benchmark]: IcfgBuilder took 205.70ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 94.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,974 INFO L158 Benchmark]: TraceAbstraction took 4052.73ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 94.2MB in the beginning and 122.5MB in the end (delta: -28.3MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,974 INFO L158 Benchmark]: Witness Printer took 60.82ms. Allocated memory is still 201.3MB. Free memory was 122.5MB in the beginning and 116.4MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:23,975 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.21ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.18ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 110.5MB in the end (delta: 11.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.94ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 109.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.97ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 205.70ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 94.7MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4052.73ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 94.2MB in the beginning and 122.5MB in the end (delta: -28.3MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Witness Printer took 60.82ms. Allocated memory is still 201.3MB. Free memory was 122.5MB in the beginning and 116.4MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 42 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 62 mSDsluCounter, 452 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 186 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 181 mSDtfsCounter, 186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 283 ConstructedInterpolants, 0 QuantifiedInterpolants, 1115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 410/420 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-17 04:23:23,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE