./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-99.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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:12,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:12,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:07:12,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:12,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:12,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:12,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:12,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:12,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:12,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:12,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:12,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:12,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:12,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:12,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:12,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:12,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:12,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:12,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:12,555 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:12,555 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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2025-03-04 00:07:12,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:12,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:12,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:12,846 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:12,847 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:12,848 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-99.i [2025-03-04 00:07:14,352 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affa3e303/8d8018b6bf4f405297daf1d92c4b6a6f/FLAG214078cad [2025-03-04 00:07:14,719 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:14,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2025-03-04 00:07:14,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affa3e303/8d8018b6bf4f405297daf1d92c4b6a6f/FLAG214078cad [2025-03-04 00:07:14,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/affa3e303/8d8018b6bf4f405297daf1d92c4b6a6f [2025-03-04 00:07:14,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:14,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:14,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:14,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:14,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:14,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:14,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1800e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14, skipping insertion in model container [2025-03-04 00:07:14,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:14,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:14,878 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-99.i[915,928] [2025-03-04 00:07:14,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:14,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:14,934 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-99.i[915,928] [2025-03-04 00:07:14,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:14,985 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:14,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14 WrapperNode [2025-03-04 00:07:14,986 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:14,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:14,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:14,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:14,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,049 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-03-04 00:07:15,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:15,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:15,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:15,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:15,065 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,094 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-04 00:07:15,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:15,113 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:15,113 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:15,113 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:15,114 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (1/1) ... [2025-03-04 00:07:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:15,178 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-04 00:07:15,217 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-04 00:07:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:07:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:15,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:15,320 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:15,593 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:15,594 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:15,603 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:15,604 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:15,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:15 BoogieIcfgContainer [2025-03-04 00:07:15,604 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:15,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:15,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:15,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:15,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:14" (1/3) ... [2025-03-04 00:07:15,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9aa9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:15, skipping insertion in model container [2025-03-04 00:07:15,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:14" (2/3) ... [2025-03-04 00:07:15,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9aa9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:15, skipping insertion in model container [2025-03-04 00:07:15,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:15" (3/3) ... [2025-03-04 00:07:15,619 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2025-03-04 00:07:15,634 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:15,637 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-99.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:15,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:15,692 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;@697661d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:15,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:07:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 00:07:15,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:15,706 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:15,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:15,714 INFO L85 PathProgramCache]: Analyzing trace with hash -275748770, now seen corresponding path program 1 times [2025-03-04 00:07:15,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:15,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502147800] [2025-03-04 00:07:15,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:15,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:15,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:15,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:15,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:15,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 00:07:15,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502147800] [2025-03-04 00:07:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502147800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934012272] [2025-03-04 00:07:15,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:15,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:07:15,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:15,999 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-04 00:07:16,001 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-04 00:07:16,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:16,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:16,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:16,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:16,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-04 00:07:16,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934012272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:16,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:16,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:07:16,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299535519] [2025-03-04 00:07:16,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:16,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:16,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:16,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:16,210 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:07:16,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:16,227 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2025-03-04 00:07:16,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2025-03-04 00:07:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:16,234 INFO L225 Difference]: With dead ends: 76 [2025-03-04 00:07:16,235 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 00:07:16,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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-04 00:07:16,240 INFO L435 NwaCegarLoop]: 51 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, 51 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-04 00:07:16,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:16,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 00:07:16,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 00:07:16,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:07:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-03-04 00:07:16,293 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 84 [2025-03-04 00:07:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:16,294 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-03-04 00:07:16,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:07:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-03-04 00:07:16,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 00:07:16,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:16,298 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:16,313 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-04 00:07:16,499 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-04 00:07:16,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:16,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:16,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1670817153, now seen corresponding path program 1 times [2025-03-04 00:07:16,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:16,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121076967] [2025-03-04 00:07:16,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:16,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:16,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:16,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:16,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 00:07:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:07:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121076967] [2025-03-04 00:07:17,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121076967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:17,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:07:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966472860] [2025-03-04 00:07:17,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:17,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:07:17,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:07:17,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:07:17,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:07:17,777 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:07:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:18,002 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-03-04 00:07:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:07:18,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-04 00:07:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:18,004 INFO L225 Difference]: With dead ends: 61 [2025-03-04 00:07:18,004 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 00:07:18,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:07:18,005 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:18,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 194 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:07:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 00:07:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-04 00:07:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:07:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-03-04 00:07:18,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 84 [2025-03-04 00:07:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-03-04 00:07:18,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:07:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-03-04 00:07:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 00:07:18,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:18,025 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:18,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:07:18,026 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:18,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1699446304, now seen corresponding path program 1 times [2025-03-04 00:07:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:07:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032517408] [2025-03-04 00:07:18,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:18,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:07:18,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:18,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:18,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:18,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:07:18,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:07:18,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:18,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:18,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:18,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:07:18,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:07:18,120 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:07:18,121 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:07:18,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:07:18,125 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:07:18,174 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:07:18,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:07:18 BoogieIcfgContainer [2025-03-04 00:07:18,178 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:07:18,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:07:18,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:07:18,179 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:07:18,179 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:15" (3/4) ... [2025-03-04 00:07:18,181 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:07:18,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:07:18,183 INFO L158 Benchmark]: Toolchain (without parser) took 3428.77ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 100.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2025-03-04 00:07:18,183 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:18,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.86ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 111.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:18,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.91ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 110.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:18,184 INFO L158 Benchmark]: Boogie Preprocessor took 62.50ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:18,184 INFO L158 Benchmark]: IcfgBuilder took 491.71ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 93.7MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:18,185 INFO L158 Benchmark]: TraceAbstraction took 2571.37ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 100.3MB in the end (delta: -7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:18,185 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 100.3MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:18,187 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.20ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.86ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 111.8MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.91ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 110.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.50ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.1MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 491.71ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 93.7MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2571.37ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 100.3MB in the end (delta: -7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 167.8MB. Free memory was 100.3MB in the beginning and 100.3MB in the end (delta: 33.1kB). 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 3.25; [L24] double var_1_3 = 32.75; [L25] double var_1_4 = 128.75; [L26] unsigned char var_1_6 = 32; [L27] unsigned char var_1_7 = 32; [L28] unsigned char var_1_8 = 16; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] signed short int var_1_12 = 10; VAL [isInitial=0, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_2=13/4, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_double() [L44] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L44] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L45] var_1_3 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L46] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L47] var_1_4 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L48] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L49] var_1_6 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L50] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L51] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L51] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L52] var_1_7 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_7 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L53] RET assume_abort_if_not(var_1_7 >= 32) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L54] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=16, var_1_9=0] [L55] var_1_8 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_9=0] [L56] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=0] [L57] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=0] [L58] var_1_9 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193] [L59] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193] [L60] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L60] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L61] var_1_11 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L62] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L63] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L63] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L76] RET updateVariables() [L77] CALL step() [L36] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L37] COND FALSE !((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L40] var_1_12 = var_1_1 VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) ? (var_1_1 == ((unsigned char) (((var_1_6 + var_1_7) - var_1_8) + var_1_9))) : 1) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((signed short int) var_1_1)) ; VAL [\result=0, isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=49439, var_1_7=32, var_1_8=-193, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 110 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 395 SizeOfPredicates, 0 NumberOfNonLiveVariables, 195 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 912/936 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:07:18,204 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-99.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:07:20,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:07:20,518 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:07:20,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:07:20,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:07:20,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:07:20,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:07:20,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:07:20,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:07:20,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:07:20,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:07:20,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:07:20,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:07:20,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:07:20,543 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:07:20,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:07:20,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:07:20,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:07:20,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:07:20,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:07:20,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:07:20,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:20,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:07:20,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:07:20,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:07:20,548 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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2025-03-04 00:07:20,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:07:20,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:07:20,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:07:20,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:07:20,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:07:20,803 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-99.i [2025-03-04 00:07:22,113 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320be582c/e46195f2da054a6eb64ec1f73c01b607/FLAG7a8489120 [2025-03-04 00:07:22,299 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:07:22,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2025-03-04 00:07:22,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320be582c/e46195f2da054a6eb64ec1f73c01b607/FLAG7a8489120 [2025-03-04 00:07:22,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/320be582c/e46195f2da054a6eb64ec1f73c01b607 [2025-03-04 00:07:22,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:07:22,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:07:22,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:22,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:07:22,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:07:22,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@794c8e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22, skipping insertion in model container [2025-03-04 00:07:22,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:07:22,482 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-99.i[915,928] [2025-03-04 00:07:22,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:22,563 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:07:22,575 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-99.i[915,928] [2025-03-04 00:07:22,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:07:22,615 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:07:22,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22 WrapperNode [2025-03-04 00:07:22,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:07:22,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:22,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:07:22,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:07:22,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,670 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2025-03-04 00:07:22,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:07:22,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:07:22,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:07:22,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:07:22,678 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,700 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-04 00:07:22,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:07:22,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:07:22,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:07:22,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:07:22,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (1/1) ... [2025-03-04 00:07:22,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:07:22,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:07:22,743 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-04 00:07:22,752 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-04 00:07:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:07:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:07:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:07:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:07:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:07:22,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:07:22,818 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:07:22,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:07:23,350 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:07:23,350 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:07:23,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:07:23,357 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:07:23,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:23 BoogieIcfgContainer [2025-03-04 00:07:23,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:07:23,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:07:23,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:07:23,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:07:23,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:07:22" (1/3) ... [2025-03-04 00:07:23,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef91c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:23, skipping insertion in model container [2025-03-04 00:07:23,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:07:22" (2/3) ... [2025-03-04 00:07:23,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef91c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:07:23, skipping insertion in model container [2025-03-04 00:07:23,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:23" (3/3) ... [2025-03-04 00:07:23,366 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2025-03-04 00:07:23,377 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:07:23,378 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-99.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:07:23,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:07:23,426 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;@17568b52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:07:23,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:07:23,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:07:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 00:07:23,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:23,438 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:23,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:23,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -275748770, now seen corresponding path program 1 times [2025-03-04 00:07:23,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:07:23,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911958641] [2025-03-04 00:07:23,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:23,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:23,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:07:23,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:07:23,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:07:23,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:23,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:23,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:07:23,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-04 00:07:23,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:23,662 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911958641] [2025-03-04 00:07:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911958641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:07:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298268802] [2025-03-04 00:07:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:23,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:07:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:23,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:07:23,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:07:23,685 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:07:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:23,707 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2025-03-04 00:07:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:07:23,709 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2025-03-04 00:07:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:23,714 INFO L225 Difference]: With dead ends: 76 [2025-03-04 00:07:23,715 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 00:07:23,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-04 00:07:23,721 INFO L435 NwaCegarLoop]: 51 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, 51 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-04 00:07:23,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:07:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 00:07:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 00:07:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 00:07:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2025-03-04 00:07:23,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 84 [2025-03-04 00:07:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:23,756 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2025-03-04 00:07:23,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:07:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2025-03-04 00:07:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 00:07:23,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:23,759 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:23,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:07:23,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:23,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:23,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1670817153, now seen corresponding path program 1 times [2025-03-04 00:07:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:07:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876603189] [2025-03-04 00:07:23,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:07:23,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:07:23,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:07:24,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:24,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:24,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:24,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:24,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 00:07:24,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:25,679 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 00:07:25,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:07:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 00:07:26,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876603189] [2025-03-04 00:07:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876603189] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:07:26,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:07:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [25] total 30 [2025-03-04 00:07:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242424648] [2025-03-04 00:07:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:07:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:26,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:07:26,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2025-03-04 00:07:26,344 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:07:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:27,260 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2025-03-04 00:07:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:07:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 84 [2025-03-04 00:07:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:27,262 INFO L225 Difference]: With dead ends: 61 [2025-03-04 00:07:27,262 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 00:07:27,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=816, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:07:27,263 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:27,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 196 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:07:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 00:07:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-04 00:07:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 00:07:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2025-03-04 00:07:27,278 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 84 [2025-03-04 00:07:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:27,279 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2025-03-04 00:07:27,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 00:07:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2025-03-04 00:07:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 00:07:27,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:07:27,282 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:07:27,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:07:27,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:27,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:07:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:07:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1699446304, now seen corresponding path program 1 times [2025-03-04 00:07:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:07:27,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423326547] [2025-03-04 00:07:27,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:07:27,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:27,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:07:27,486 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:07:27,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:07:27,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 00:07:27,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 00:07:27,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:07:27,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:07:27,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:07:27,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:07:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 00:07:34,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:34,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423326547] [2025-03-04 00:07:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423326547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:34,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:34,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 00:07:34,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213898177] [2025-03-04 00:07:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:07:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:34,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:07:34,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:07:34,471 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:07:44,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:07:44,417 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-03-04 00:07:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:07:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 84 [2025-03-04 00:07:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:07:44,429 INFO L225 Difference]: With dead ends: 66 [2025-03-04 00:07:44,429 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:07:44,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:07:44,430 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:07:44,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 180 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-04 00:07:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:07:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:07:44,430 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-04 00:07:44,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:07:44,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2025-03-04 00:07:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:07:44,430 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:07:44,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 00:07:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:07:44,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:07:44,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:07:44,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 00:07:44,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:07:44,638 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:07:44,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:07:47,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:07:47,580 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:07:47,581 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2025-03-04 00:07:47,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:07:47 BoogieIcfgContainer [2025-03-04 00:07:47,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:07:47,583 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:07:47,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:07:47,584 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:07:47,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:07:23" (3/4) ... [2025-03-04 00:07:47,585 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:07:47,589 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:07:47,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-04 00:07:47,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:07:47,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:07:47,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:07:47,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:07:47,650 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:07:47,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:07:47,650 INFO L158 Benchmark]: Toolchain (without parser) took 25321.98ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 75.8MB in the end (delta: 16.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2025-03-04 00:07:47,650 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:47,651 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.69ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 79.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:47,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.35ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:47,652 INFO L158 Benchmark]: Boogie Preprocessor took 42.73ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:07:47,653 INFO L158 Benchmark]: IcfgBuilder took 643.34ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 63.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:47,653 INFO L158 Benchmark]: TraceAbstraction took 24224.09ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 82.9MB in the end (delta: -19.9MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2025-03-04 00:07:47,654 INFO L158 Benchmark]: Witness Printer took 66.14ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 75.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:07:47,655 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.32ms. Allocated memory is still 83.9MB. Free memory was 62.0MB in the beginning and 62.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.69ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 79.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.35ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 78.3MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.73ms. Allocated memory is still 117.4MB. Free memory was 78.3MB in the beginning and 76.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 643.34ms. Allocated memory is still 117.4MB. Free memory was 76.7MB in the beginning and 63.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 24224.09ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 82.9MB in the end (delta: -19.9MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. * Witness Printer took 66.14ms. Allocated memory is still 117.4MB. Free memory was 82.6MB in the beginning and 75.8MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 427 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 282 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 145 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 339 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=2, InterpolantAutomatonStates: 25, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 332 ConstructedInterpolants, 0 QuantifiedInterpolants, 1484 SizeOfPredicates, 28 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1185/1248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Location Invariant Derived location invariant: ((((var_1_11 >= 1) && (var_1_11 <= 1)) && (var_1_11 == var_1_10)) || ((((var_1_11 >= 1) && (var_1_1 == var_1_12)) && (var_1_11 <= 1)) && (var_1_11 == var_1_10))) RESULT: Ultimate proved your program to be correct! [2025-03-04 00:07:47,684 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE