./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:13,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:13,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:23:13,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:13,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:13,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:13,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:13,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:13,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:13,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:13,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:13,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:13,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:13,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:13,808 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:13,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:13,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:13,809 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:13,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:13,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:13,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:13,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:13,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:13,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:13,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:13,811 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2025-03-17 04:23:14,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:14,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:14,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:14,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:14,050 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:14,052 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-50.i [2025-03-17 04:23:15,172 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71ff274e/cc20f2ff74b34056bbfa928dbdec4644/FLAG931a24f73 [2025-03-17 04:23:15,386 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:15,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2025-03-17 04:23:15,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71ff274e/cc20f2ff74b34056bbfa928dbdec4644/FLAG931a24f73 [2025-03-17 04:23:15,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c71ff274e/cc20f2ff74b34056bbfa928dbdec4644 [2025-03-17 04:23:15,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:15,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:15,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:15,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:15,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:15,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:15,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e02eb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15, skipping insertion in model container [2025-03-17 04:23:15,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:15,764 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:15,881 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-50.i[915,928] [2025-03-17 04:23:15,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:15,927 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:15,935 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-50.i[915,928] [2025-03-17 04:23:15,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:15,982 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:15,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15 WrapperNode [2025-03-17 04:23:15,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:15,985 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:15,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:15,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:15,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,016 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-17 04:23:16,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:16,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:16,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:16,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:16,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,032 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:23:16,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:16,040 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:16,040 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:16,040 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:16,041 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (1/1) ... [2025-03-17 04:23:16,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:16,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:16,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:23:16,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:23:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:16,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:23:16,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:16,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:16,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:16,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:16,301 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:16,301 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:16,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:16,312 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:16,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:16 BoogieIcfgContainer [2025-03-17 04:23:16,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:16,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:16,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:16,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:16,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:15" (1/3) ... [2025-03-17 04:23:16,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46466b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:16, skipping insertion in model container [2025-03-17 04:23:16,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:15" (2/3) ... [2025-03-17 04:23:16,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46466b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:16, skipping insertion in model container [2025-03-17 04:23:16,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:16" (3/3) ... [2025-03-17 04:23:16,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2025-03-17 04:23:16,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:16,334 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-50.i that has 2 procedures, 34 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:16,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:16,388 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;@784bf4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:16,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:23:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 04:23:16,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:16,397 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:16,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -595614769, now seen corresponding path program 1 times [2025-03-17 04:23:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:16,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908863564] [2025-03-17 04:23:16,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:16,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:16,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:16,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:16,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 04:23:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:23:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908863564] [2025-03-17 04:23:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908863564] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:23:16,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631582579] [2025-03-17 04:23:16,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:16,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:23:16,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:16,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:23:16,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:23:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:16,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:16,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:16,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:16,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:16,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 04:23:16,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631582579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:23:16,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:23:16,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168641789] [2025-03-17 04:23:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:16,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:23:16,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:16,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:16,696 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:23:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:16,712 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2025-03-17 04:23:16,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:16,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 73 [2025-03-17 04:23:16,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:16,717 INFO L225 Difference]: With dead ends: 65 [2025-03-17 04:23:16,717 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 04:23:16,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:16,720 INFO L435 NwaCegarLoop]: 45 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, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:16,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 04:23:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 04:23:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:23:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2025-03-17 04:23:16,744 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 73 [2025-03-17 04:23:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:16,744 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2025-03-17 04:23:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:23:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2025-03-17 04:23:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 04:23:16,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:16,746 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:16,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:23:16,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:23:16,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:16,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:16,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2014304689, now seen corresponding path program 1 times [2025-03-17 04:23:16,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:23:16,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788463931] [2025-03-17 04:23:16,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:16,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:23:16,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:17,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:23:17,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436877641] [2025-03-17 04:23:17,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:23:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:17,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:23:17,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:23:17,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:17,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:17,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:17,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:23:17,105 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 04:23:17,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:17,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:17,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:17,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 04:23:17,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 04:23:17,160 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 04:23:17,161 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:23:17,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:23:17,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 04:23:17,366 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 04:23:17,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:23:17,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:23:17 BoogieIcfgContainer [2025-03-17 04:23:17,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:23:17,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:23:17,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:23:17,404 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:23:17,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:16" (3/4) ... [2025-03-17 04:23:17,406 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 04:23:17,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:23:17,407 INFO L158 Benchmark]: Toolchain (without parser) took 1661.34ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 76.8MB in the end (delta: 78.3MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-17 04:23:17,408 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:17,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.31ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 143.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:17,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.47ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:17,411 INFO L158 Benchmark]: Boogie Preprocessor took 22.50ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 140.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:17,411 INFO L158 Benchmark]: IcfgBuilder took 272.48ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 126.9MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:17,411 INFO L158 Benchmark]: TraceAbstraction took 1088.96ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 77.2MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-17 04:23:17,411 INFO L158 Benchmark]: Witness Printer took 2.55ms. Allocated memory is still 201.3MB. Free memory was 77.2MB in the beginning and 76.8MB in the end (delta: 409.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:17,412 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.37ms. Allocated memory is still 201.3MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.31ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 143.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.47ms. Allocated memory is still 201.3MB. Free memory was 143.1MB in the beginning and 141.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.50ms. Allocated memory is still 201.3MB. Free memory was 141.9MB in the beginning and 140.2MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 272.48ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 126.9MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1088.96ms. Allocated memory is still 201.3MB. Free memory was 126.5MB in the beginning and 77.2MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.55ms. Allocated memory is still 201.3MB. Free memory was 77.2MB in the beginning and 76.8MB in the end (delta: 409.8kB). 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 someUnaryDOUBLEoperation at line 24, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] double var_1_2 = 99999.67; [L24] double var_1_3 = -0.05; [L25] signed short int var_1_4 = 128; [L26] signed short int var_1_5 = 128; [L27] signed long int var_1_6 = -10; [L28] double var_1_7 = 8.6; [L29] unsigned char var_1_8 = 1; [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L45] var_1_2 = __VERIFIER_nondet_double() [L46] 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_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L46] 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_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L47] var_1_3 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && 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_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L48] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=128, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L49] var_1_4 = __VERIFIER_nondet_short() [L50] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L50] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L51] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=128, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L52] var_1_5 = __VERIFIER_nondet_short() [L53] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L53] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L54] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L55] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=-10, var_1_7=43/5, var_1_8=1] [L56] var_1_6 = __VERIFIER_nondet_long() [L57] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L57] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L58] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_7=43/5, var_1_8=1] [L59] var_1_7 = __VERIFIER_nondet_double() [L60] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=1] [L60] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=1] [L61] var_1_8 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1] [L62] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1] [L63] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L63] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L76] RET updateVariables() [L77] CALL step() [L33] unsigned char stepLocal_0 = ((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_1=5, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L34] COND FALSE !(stepLocal_0 && ((var_1_4 / var_1_5) < var_1_6)) [L41] var_1_1 = 10 VAL [isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((((63.6) < (var_1_2)) ? (63.6) : (var_1_2))) != var_1_3) && ((var_1_4 / var_1_5) < var_1_6)) ? ((var_1_3 >= (var_1_2 + var_1_7)) ? (var_1_1 == ((unsigned char) var_1_8)) : (var_1_1 == ((unsigned char) var_1_8))) : (var_1_1 == ((unsigned char) 10)) ; [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=10, var_1_4=1, var_1_5=2, var_1_6=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 61 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 173 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 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-17 04:23:17,425 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-50.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 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:23:19,275 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:23:19,381 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 04:23:19,387 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:23:19,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:23:19,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:23:19,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:23:19,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:23:19,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:23:19,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:23:19,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:23:19,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:23:19,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:23:19,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:23:19,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:23:19,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 04:23:19,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:23:19,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:23:19,411 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:23:19,411 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:23:19,411 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:23:19,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:23:19,411 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:23:19,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:19,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:23:19,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:23:19,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:23:19,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:23:19,413 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 -> 31c38fc0029b15eea235546e14c5b61b4e70b436ee39f6c640a47d6a6b4e9a18 [2025-03-17 04:23:19,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:23:19,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:23:19,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:23:19,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:23:19,668 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:23:19,669 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-50.i [2025-03-17 04:23:20,940 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664e9a9dc/4fe895e1b1684510b622cefb61e97ba7/FLAG2c6fa748b [2025-03-17 04:23:21,123 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:23:21,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-50.i [2025-03-17 04:23:21,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664e9a9dc/4fe895e1b1684510b622cefb61e97ba7/FLAG2c6fa748b [2025-03-17 04:23:21,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664e9a9dc/4fe895e1b1684510b622cefb61e97ba7 [2025-03-17 04:23:21,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:23:21,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:23:21,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:21,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:23:21,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:23:21,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c88946c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21, skipping insertion in model container [2025-03-17 04:23:21,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:23:21,287 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-50.i[915,928] [2025-03-17 04:23:21,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:21,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:23:21,346 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-50.i[915,928] [2025-03-17 04:23:21,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:23:21,378 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:23:21,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21 WrapperNode [2025-03-17 04:23:21,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:23:21,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:21,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:23:21,379 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:23:21,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,411 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 78 [2025-03-17 04:23:21,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:23:21,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:23:21,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:23:21,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:23:21,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,431 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:23:21,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,432 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:23:21,444 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:23:21,444 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:23:21,444 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:23:21,445 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (1/1) ... [2025-03-17 04:23:21,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:23:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:23:21,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:23:21,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:23:21,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:23:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 04:23:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:23:21,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:23:21,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:23:21,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:23:21,560 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:23:21,562 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:23:21,984 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 04:23:21,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:23:21,990 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:23:21,991 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:23:21,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:21 BoogieIcfgContainer [2025-03-17 04:23:21,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:23:21,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:23:21,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:23:21,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:23:21,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:23:21" (1/3) ... [2025-03-17 04:23:21,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae9df7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:21, skipping insertion in model container [2025-03-17 04:23:21,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:23:21" (2/3) ... [2025-03-17 04:23:21,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ae9df7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:23:21, skipping insertion in model container [2025-03-17 04:23:21,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:21" (3/3) ... [2025-03-17 04:23:22,000 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-50.i [2025-03-17 04:23:22,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:23:22,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-50.i that has 2 procedures, 34 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:23:22,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:23:22,063 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;@6f7edefd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:23:22,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:23:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:23:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 04:23:22,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:22,072 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:22,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:22,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash -595614769, now seen corresponding path program 1 times [2025-03-17 04:23:22,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:22,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148528957] [2025-03-17 04:23:22,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,084 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-17 04:23:22,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:22,086 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-17 04:23:22,087 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-17 04:23:22,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:22,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:22,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:22,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:23:22,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 04:23:22,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:22,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:22,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148528957] [2025-03-17 04:23:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148528957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:22,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:23:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383000922] [2025-03-17 04:23:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:22,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:23:22,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:22,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:23:22,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:22,281 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:23:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:22,299 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2025-03-17 04:23:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:23:22,300 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 73 [2025-03-17 04:23:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:22,306 INFO L225 Difference]: With dead ends: 65 [2025-03-17 04:23:22,307 INFO L226 Difference]: Without dead ends: 32 [2025-03-17 04:23:22,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:23:22,313 INFO L435 NwaCegarLoop]: 45 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, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:22,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:23:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-17 04:23:22,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-17 04:23:22,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:23:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2025-03-17 04:23:22,350 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 73 [2025-03-17 04:23:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:22,351 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2025-03-17 04:23:22,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 04:23:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2025-03-17 04:23:22,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-17 04:23:22,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:22,354 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:22,362 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:23:22,555 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-17 04:23:22,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:22,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2014304689, now seen corresponding path program 1 times [2025-03-17 04:23:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203412967] [2025-03-17 04:23:22,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:22,557 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-17 04:23:22,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:22,559 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-17 04:23:22,560 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-17 04:23:22,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 04:23:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 04:23:22,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:22,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:22,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 04:23:22,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 04:23:24,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:24,303 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203412967] [2025-03-17 04:23:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203412967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:24,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:23:24,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282754312] [2025-03-17 04:23:24,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:24,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:23:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:24,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:23:24,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:23:24,305 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:23:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:25,392 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-03-17 04:23:25,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:23:25,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 73 [2025-03-17 04:23:25,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:25,399 INFO L225 Difference]: With dead ends: 38 [2025-03-17 04:23:25,399 INFO L226 Difference]: Without dead ends: 36 [2025-03-17 04:23:25,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:25,400 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:25,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 137 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:23:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-17 04:23:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-17 04:23:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 04:23:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2025-03-17 04:23:25,410 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 73 [2025-03-17 04:23:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:25,411 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2025-03-17 04:23:25,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:23:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2025-03-17 04:23:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-17 04:23:25,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:23:25,412 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:23:25,433 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 (3)] Ended with exit code 0 [2025-03-17 04:23:25,615 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-17 04:23:25,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:23:25,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:23:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1980108813, now seen corresponding path program 1 times [2025-03-17 04:23:25,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 04:23:25,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793652512] [2025-03-17 04:23:25,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:23:25,621 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-17 04:23:25,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 04:23:25,624 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-17 04:23:25,626 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-17 04:23:25,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 04:23:25,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 04:23:25,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:23:25,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:23:25,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 04:23:25,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:23:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 04:23:27,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:23:27,144 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 04:23:27,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793652512] [2025-03-17 04:23:27,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793652512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:23:27,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:23:27,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:23:27,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586352850] [2025-03-17 04:23:27,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:23:27,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:23:27,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 04:23:27,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:23:27,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:23:27,146 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:23:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:23:28,340 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2025-03-17 04:23:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:23:28,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2025-03-17 04:23:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:23:28,344 INFO L225 Difference]: With dead ends: 36 [2025-03-17 04:23:28,344 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 04:23:28,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:23:28,345 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:23:28,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 131 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:23:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 04:23:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 04:23:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 04:23:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 04:23:28,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2025-03-17 04:23:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:23:28,346 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 04:23:28,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 04:23:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 04:23:28,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 04:23:28,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 04:23:28,355 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-17 04:23:28,552 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-17 04:23:28,554 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 04:23:28,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 04:23:28,574 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 04:23:28,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 04:23:28 BoogieIcfgContainer [2025-03-17 04:23:28,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 04:23:28,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 04:23:28,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 04:23:28,584 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 04:23:28,584 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:23:21" (3/4) ... [2025-03-17 04:23:28,586 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 04:23:28,589 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-17 04:23:28,593 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 04:23:28,593 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 04:23:28,593 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 04:23:28,593 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 04:23:28,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 04:23:28,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 04:23:28,648 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 04:23:28,649 INFO L158 Benchmark]: Toolchain (without parser) took 7495.55ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 92.3MB in the beginning and 116.0MB in the end (delta: -23.7MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-03-17 04:23:28,652 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:28,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.25ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:28,652 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.40ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:28,653 INFO L158 Benchmark]: Boogie Preprocessor took 31.52ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:28,653 INFO L158 Benchmark]: IcfgBuilder took 546.98ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 63.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 04:23:28,653 INFO L158 Benchmark]: TraceAbstraction took 6587.71ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 63.1MB in the beginning and 122.5MB in the end (delta: -59.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:28,653 INFO L158 Benchmark]: Witness Printer took 67.00ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 116.0MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 04:23:28,654 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.24ms. Allocated memory is still 83.9MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.25ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 79.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.40ms. Allocated memory is still 117.4MB. Free memory was 79.7MB in the beginning and 78.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.52ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 76.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 546.98ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 63.6MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6587.71ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 63.1MB in the beginning and 122.5MB in the end (delta: -59.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 67.00ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 116.0MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 61 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 313 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 128 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 13, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 459 SizeOfPredicates, 16 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 792/792 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 04:23:28,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE