./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.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 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:15:19,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:15:19,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:15:19,828 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:15:19,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:15:19,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:15:19,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:15:19,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:15:19,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:15:19,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:15:19,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:15:19,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:15:19,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:15:19,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:15:19,857 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:15:19,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:15:19,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:15:19,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:15:19,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:15:19,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:15:19,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:15:19,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:15:19,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:15:19,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:19,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:15:19,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:15:19,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:15:19,860 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 -> 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 [2025-03-08 15:15:20,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:15:20,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:15:20,077 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:15:20,078 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:15:20,078 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:15:20,079 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-28.i [2025-03-08 15:15:21,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70dff234/1e051e8edd944287896fd54939af294d/FLAG02a75ce2c [2025-03-08 15:15:21,396 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:15:21,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2025-03-08 15:15:21,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70dff234/1e051e8edd944287896fd54939af294d/FLAG02a75ce2c [2025-03-08 15:15:21,421 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70dff234/1e051e8edd944287896fd54939af294d [2025-03-08 15:15:21,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:15:21,425 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:15:21,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:21,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:15:21,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:15:21,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f68d2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21, skipping insertion in model container [2025-03-08 15:15:21,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:15:21,549 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-28.i[915,928] [2025-03-08 15:15:21,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:21,589 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:15:21,597 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-28.i[915,928] [2025-03-08 15:15:21,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:21,626 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:15:21,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21 WrapperNode [2025-03-08 15:15:21,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:21,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:21,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:15:21,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:15:21,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,652 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-08 15:15:21,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:21,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:15:21,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:15:21,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:15:21,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,669 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:15:21,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,672 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:15:21,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:15:21,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:15:21,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:15:21,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (1/1) ... [2025-03-08 15:15:21,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:15:21,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:15:21,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:15:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:15:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:15:21,716 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:15:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:15:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:15:21,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:15:21,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:15:21,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:15:21,906 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:15:21,906 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:15:21,914 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:15:21,914 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:15:21,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:21 BoogieIcfgContainer [2025-03-08 15:15:21,914 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:15:21,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:15:21,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:15:21,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:15:21,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:15:21" (1/3) ... [2025-03-08 15:15:21,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773dcb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:21, skipping insertion in model container [2025-03-08 15:15:21,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:21" (2/3) ... [2025-03-08 15:15:21,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773dcb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:21, skipping insertion in model container [2025-03-08 15:15:21,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:21" (3/3) ... [2025-03-08 15:15:21,921 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2025-03-08 15:15:21,931 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:15:21,932 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-28.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:15:21,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:15:21,982 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;@29cf00e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:15:21,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:15:21,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 15:15:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 15:15:21,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:21,989 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:15:21,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:21,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:21,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1407922302, now seen corresponding path program 1 times [2025-03-08 15:15:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:15:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132371080] [2025-03-08 15:15:21,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:15:22,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 15:15:22,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 15:15:22,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:22,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 15:15:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:15:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132371080] [2025-03-08 15:15:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132371080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:15:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967418800] [2025-03-08 15:15:22,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:22,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:15:22,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:15:22,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:15:22,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:15:22,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 15:15:22,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 15:15:22,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:22,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:22,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:15:22,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:22,266 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 15:15:22,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:15:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967418800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:15:22,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:15:22,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:15:22,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410572328] [2025-03-08 15:15:22,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:15:22,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:15:22,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:15:22,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:15:22,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:15:22,287 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 15:15:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:15:22,299 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-03-08 15:15:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:15:22,301 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2025-03-08 15:15:22,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:15:22,304 INFO L225 Difference]: With dead ends: 70 [2025-03-08 15:15:22,304 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 15:15:22,306 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-08 15:15:22,307 INFO L435 NwaCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:15:22,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:15:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 15:15:22,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 15:15:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 15:15:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-08 15:15:22,336 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 73 [2025-03-08 15:15:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:15:22,336 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-08 15:15:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 15:15:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-08 15:15:22,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 15:15:22,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:22,338 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:15:22,344 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-08 15:15:22,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:15:22,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:22,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:22,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1306454431, now seen corresponding path program 1 times [2025-03-08 15:15:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:15:22,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118484570] [2025-03-08 15:15:22,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:22,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:15:22,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 15:15:22,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 15:15:22,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:22,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:15:22,619 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:15:22,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 15:15:22,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 15:15:22,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:22,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:15:22,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:15:22,697 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:15:22,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:15:22,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:15:22,702 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:15:22,750 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:15:22,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:15:22 BoogieIcfgContainer [2025-03-08 15:15:22,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:15:22,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:15:22,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:15:22,754 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:15:22,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:21" (3/4) ... [2025-03-08 15:15:22,756 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:15:22,757 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:15:22,757 INFO L158 Benchmark]: Toolchain (without parser) took 1332.09ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 81.2MB in the end (delta: 77.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-08 15:15:22,757 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:22,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.73ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 146.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:22,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.16ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 144.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:15:22,759 INFO L158 Benchmark]: Boogie Preprocessor took 21.88ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 143.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:22,759 INFO L158 Benchmark]: IcfgBuilder took 239.34ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 129.7MB in the end (delta: 13.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:22,759 INFO L158 Benchmark]: TraceAbstraction took 837.03ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 81.5MB in the end (delta: 47.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 15:15:22,759 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 201.3MB. Free memory was 81.5MB in the beginning and 81.2MB in the end (delta: 278.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:15:22,760 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.73ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 146.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.16ms. Allocated memory is still 201.3MB. Free memory was 146.5MB in the beginning and 144.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.88ms. Allocated memory is still 201.3MB. Free memory was 144.8MB in the beginning and 143.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 239.34ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 129.7MB in the end (delta: 13.6MB). There was no memory consumed. Max. memory is 16.1GB. * TraceAbstraction took 837.03ms. Allocated memory is still 201.3MB. Free memory was 129.1MB in the beginning and 81.5MB in the end (delta: 47.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 201.3MB. Free memory was 81.5MB in the beginning and 81.2MB in the end (delta: 278.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] double var_1_2 = 10.6; [L24] double var_1_3 = 1.8; [L25] double var_1_4 = 31.8; [L26] double var_1_5 = 24.25; [L27] signed char var_1_6 = 1; [L28] signed char var_1_7 = -25; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 8; VAL [isInitial=0, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_2=53/5, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L46] var_1_2 = __VERIFIER_nondet_double() [L47] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L47] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_3=9/5, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L48] var_1_3 = __VERIFIER_nondet_double() [L49] 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_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L49] 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_10=0, var_1_11=8, var_1_1=-10, var_1_4=159/5, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L50] var_1_4 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L51] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_5=97/4, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L52] var_1_5 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L53] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_5 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L54] RET assume_abort_if_not(var_1_5 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=1, var_1_7=-25, var_1_8=1, var_1_9=0] [L55] var_1_6 = __VERIFIER_nondet_char() [L56] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L56] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L57] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=-25, var_1_8=1, var_1_9=0] [L58] var_1_7 = __VERIFIER_nondet_char() [L59] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L59] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L60] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L60] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1] [L63] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L63] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=-10, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L76] RET updateVariables() [L77] CALL step() [L36] COND TRUE var_1_2 > ((var_1_3 * var_1_4) / var_1_5) [L37] var_1_1 = ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=1, var_1_9=0] [L41] var_1_8 = var_1_9 [L42] var_1_10 = var_1_9 [L43] var_1_11 = 10 VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 > ((var_1_3 * var_1_4) / var_1_5)) ? (var_1_1 == ((signed char) ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_7))) && (var_1_8 == ((unsigned char) var_1_9))) && (var_1_10 == ((unsigned char) var_1_9))) && (var_1_11 == ((unsigned char) 10)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=10, var_1_1=125, var_1_6=125, var_1_7=126, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 62 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 11, 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, 46 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, 46 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=38occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 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-08 15:15:22,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-28.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 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:15:24,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:15:24,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:15:24,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:15:24,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:15:24,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:15:24,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:15:24,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:15:24,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:15:24,587 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:15:24,588 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:15:24,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:15:24,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:15:24,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:15:24,588 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:15:24,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:15:24,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:15:24,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:15:24,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:24,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:15:24,591 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:15:24,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:15:24,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:15:24,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:15:24,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:15:24,592 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 -> 2a8173a95b98f2f1ade3ddbfa72a82a390b4308045cd4f85b878a79ad12c3bb8 [2025-03-08 15:15:24,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:15:24,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:15:24,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:15:24,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:15:24,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:15:24,855 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-28.i [2025-03-08 15:15:25,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe571c2/e6757ecacfcc4ef8a7c115d98634c4bd/FLAG98bfb8c1c [2025-03-08 15:15:26,181 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:15:26,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-28.i [2025-03-08 15:15:26,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe571c2/e6757ecacfcc4ef8a7c115d98634c4bd/FLAG98bfb8c1c [2025-03-08 15:15:26,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6abe571c2/e6757ecacfcc4ef8a7c115d98634c4bd [2025-03-08 15:15:26,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:15:26,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:15:26,207 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:26,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:15:26,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:15:26,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18342c23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26, skipping insertion in model container [2025-03-08 15:15:26,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:15:26,331 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-28.i[915,928] [2025-03-08 15:15:26,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:26,375 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:15:26,385 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-28.i[915,928] [2025-03-08 15:15:26,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:15:26,408 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:15:26,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26 WrapperNode [2025-03-08 15:15:26,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:15:26,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:26,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:15:26,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:15:26,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,438 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2025-03-08 15:15:26,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:15:26,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:15:26,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:15:26,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:15:26,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:15:26,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:15:26,477 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:15:26,477 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:15:26,477 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:15:26,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (1/1) ... [2025-03-08 15:15:26,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:15:26,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:15:26,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:15:26,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:15:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:15:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:15:26,523 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:15:26,523 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:15:26,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:15:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:15:26,576 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:15:26,577 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:15:39,618 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:15:39,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:15:39,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:15:39,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:15:39,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:39 BoogieIcfgContainer [2025-03-08 15:15:39,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:15:39,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:15:39,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:15:39,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:15:39,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:15:26" (1/3) ... [2025-03-08 15:15:39,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649edf65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:39, skipping insertion in model container [2025-03-08 15:15:39,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:15:26" (2/3) ... [2025-03-08 15:15:39,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649edf65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:15:39, skipping insertion in model container [2025-03-08 15:15:39,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:15:39" (3/3) ... [2025-03-08 15:15:39,633 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-28.i [2025-03-08 15:15:39,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:15:39,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-28.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:15:39,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:15:39,690 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;@2f8c77b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:15:39,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:15:39,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 15:15:39,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 15:15:39,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:39,698 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:15:39,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:39,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:39,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1407922302, now seen corresponding path program 1 times [2025-03-08 15:15:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:15:39,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908153315] [2025-03-08 15:15:39,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:39,711 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-08 15:15:39,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:15:39,714 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-08 15:15:39,716 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-08 15:15:39,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 15:15:40,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 15:15:40,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:40,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:40,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:15:40,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:40,531 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-08 15:15:40,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:15:40,533 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:15:40,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908153315] [2025-03-08 15:15:40,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908153315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:15:40,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:15:40,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:15:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877559479] [2025-03-08 15:15:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:15:40,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:15:40,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:15:40,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:15:40,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:15:40,556 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 15:15:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:15:40,574 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-03-08 15:15:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:15:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2025-03-08 15:15:40,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:15:40,580 INFO L225 Difference]: With dead ends: 70 [2025-03-08 15:15:40,580 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 15:15:40,583 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-08 15:15:40,586 INFO L435 NwaCegarLoop]: 46 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, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:15:40,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:15:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 15:15:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 15:15:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 15:15:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2025-03-08 15:15:40,619 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 73 [2025-03-08 15:15:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:15:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2025-03-08 15:15:40,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 15:15:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2025-03-08 15:15:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 15:15:40,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:15:40,623 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:15:40,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 15:15:40,824 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-08 15:15:40,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:15:40,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:15:40,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1306454431, now seen corresponding path program 1 times [2025-03-08 15:15:40,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:15:40,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861485424] [2025-03-08 15:15:40,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:15:40,826 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-08 15:15:40,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:15:40,828 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-08 15:15:40,829 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-08 15:15:40,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 15:15:41,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 15:15:41,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:15:41,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:15:41,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 15:15:41,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:15:49,947 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:15:58,505 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:16:07,029 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:16:15,602 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:16:24,164 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:16:28,363 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ sign_extend 24) c_~var_1_6~0)) (.cse0 ((_ sign_extend 24) c_~var_1_7~0))) (let ((.cse1 (bvslt .cse2 .cse0))) (or (and (= c_~var_1_1~0 ((_ extract 7 0) .cse0)) (not .cse1)) (and (= ((_ extract 7 0) .cse2) c_~var_1_1~0) .cse1)))) (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) is different from false [2025-03-08 15:16:32,543 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ sign_extend 24) c_~var_1_6~0)) (.cse0 ((_ sign_extend 24) c_~var_1_7~0))) (let ((.cse1 (bvslt .cse2 .cse0))) (or (and (= c_~var_1_1~0 ((_ extract 7 0) .cse0)) (not .cse1)) (and (= ((_ extract 7 0) .cse2) c_~var_1_1~0) .cse1)))) (fp.gt c_~var_1_2~0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0) c_~var_1_5~0))) is different from true [2025-03-08 15:16:40,910 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:16:49,485 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:16:58,062 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:17:06,585 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)