./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.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 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:03:12,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:03:12,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:03:12,060 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:03:12,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:03:12,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:03:12,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:03:12,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:03:12,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:03:12,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:03:12,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:03:12,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:03:12,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:03:12,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:03:12,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:03:12,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:03:12,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:03:12,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:03:12,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:12,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:03:12,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:03:12,083 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 -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2025-03-04 00:03:12,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:03:12,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:03:12,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:03:12,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:03:12,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:03:12,295 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-18.i [2025-03-04 00:03:13,389 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10edfd196/de93c5b087924e2c86cedbdef19f0d96/FLAG998011665 [2025-03-04 00:03:13,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:03:13,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2025-03-04 00:03:13,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10edfd196/de93c5b087924e2c86cedbdef19f0d96/FLAG998011665 [2025-03-04 00:03:13,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10edfd196/de93c5b087924e2c86cedbdef19f0d96 [2025-03-04 00:03:13,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:03:13,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:03:13,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:13,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:03:13,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:03:13,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da00cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13, skipping insertion in model container [2025-03-04 00:03:13,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:03:13,751 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-18.i[915,928] [2025-03-04 00:03:13,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:13,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:03:13,794 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-18.i[915,928] [2025-03-04 00:03:13,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:13,819 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:03:13,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13 WrapperNode [2025-03-04 00:03:13,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:13,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:13,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:03:13,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:03:13,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,850 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2025-03-04 00:03:13,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:13,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:03:13,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:03:13,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:03:13,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:03:13,879 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:03:13,892 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:03:13,892 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:03:13,892 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:03:13,893 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (1/1) ... [2025-03-04 00:03:13,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:13,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:03:13,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:03:13,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:03:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:03:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:03:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:03:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:03:13,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:03:13,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:03:13,991 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:03:13,992 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:03:14,093 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:03:14,093 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:03:14,099 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:03:14,099 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:03:14,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:14 BoogieIcfgContainer [2025-03-04 00:03:14,100 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:03:14,101 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:03:14,101 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:03:14,104 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:03:14,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:03:13" (1/3) ... [2025-03-04 00:03:14,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5708a972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:03:14, skipping insertion in model container [2025-03-04 00:03:14,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:13" (2/3) ... [2025-03-04 00:03:14,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5708a972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:03:14, skipping insertion in model container [2025-03-04 00:03:14,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:14" (3/3) ... [2025-03-04 00:03:14,106 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2025-03-04 00:03:14,116 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:03:14,118 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-18.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:03:14,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:03:14,170 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;@287b3e91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:03:14,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:03:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:03:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 00:03:14,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:14,181 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:03:14,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:14,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:14,187 INFO L85 PathProgramCache]: Analyzing trace with hash 919941997, now seen corresponding path program 1 times [2025-03-04 00:03:14,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:03:14,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257973432] [2025-03-04 00:03:14,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:14,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:03:14,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 00:03:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 00:03:14,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:14,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:03:14,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:03:14,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257973432] [2025-03-04 00:03:14,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257973432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:03:14,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163493190] [2025-03-04 00:03:14,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:14,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:03:14,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:03:14,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:03:14,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:03:14,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 00:03:14,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 00:03:14,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:14,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:14,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:03:14,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:03:14,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:03:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163493190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:03:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:03:14,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:03:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737221173] [2025-03-04 00:03:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:03:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:03:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:03:14,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:03:14,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:03:14,503 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:03:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:03:14,518 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2025-03-04 00:03:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:03:14,520 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2025-03-04 00:03:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:03:14,524 INFO L225 Difference]: With dead ends: 66 [2025-03-04 00:03:14,524 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 00:03:14,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:03:14,528 INFO L435 NwaCegarLoop]: 43 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, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:03:14,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:03:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 00:03:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 00:03:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:03:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-04 00:03:14,553 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2025-03-04 00:03:14,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:03:14,554 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-04 00:03:14,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-04 00:03:14,554 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-04 00:03:14,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 00:03:14,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:14,556 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:03:14,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:03:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:03:14,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 875478413, now seen corresponding path program 1 times [2025-03-04 00:03:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:03:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120912147] [2025-03-04 00:03:14,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:14,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:03:14,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 00:03:14,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 00:03:14,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:14,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:03:14,825 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:03:14,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 00:03:14,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 00:03:14,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:14,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:03:14,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:03:14,889 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:03:14,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:03:14,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:03:14,893 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:03:14,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:03:14,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:03:14 BoogieIcfgContainer [2025-03-04 00:03:14,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:03:14,929 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:03:14,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:03:14,929 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:03:14,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:14" (3/4) ... [2025-03-04 00:03:14,931 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:03:14,931 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:03:14,932 INFO L158 Benchmark]: Toolchain (without parser) took 1294.35ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 36.6MB in the end (delta: 69.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-04 00:03:14,932 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:14,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.49ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:14,933 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.46ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.2MB in the end (delta: 911.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:14,933 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.2MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:14,933 INFO L158 Benchmark]: IcfgBuilder took 207.44ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 79.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:03:14,933 INFO L158 Benchmark]: TraceAbstraction took 826.92ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 36.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 00:03:14,934 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 142.6MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:03:14,935 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.12ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.49ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.1MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.46ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.2MB in the end (delta: 911.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 92.2MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 207.44ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 79.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 826.92ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 36.6MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 142.6MB. Free memory is still 36.6MB. 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 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] double var_1_2 = 24.75; [L24] double var_1_3 = 16.7; [L25] double var_1_4 = 0.8; [L26] signed short int var_1_5 = -1; [L27] signed short int var_1_6 = 4; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; VAL [isInitial=0, var_1_1=-1, var_1_2=99/4, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] 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=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L42] 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=-1, var_1_3=167/10, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L43] var_1_3 = __VERIFIER_nondet_double() [L44] 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=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L44] 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=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L45] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, var_1_1=-1, var_1_4=4/5, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L46] var_1_4 = __VERIFIER_nondet_double() [L47] 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_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L47] 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_1=-1, var_1_5=-1, var_1_6=4, var_1_7=0, var_1_8=1] [L48] var_1_5 = __VERIFIER_nondet_short() [L49] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=4, var_1_7=0, var_1_8=1] [L49] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=4, var_1_7=0, var_1_8=1] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=4, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=4, var_1_7=0, var_1_8=1] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=4, var_1_7=0, var_1_8=1] [L51] var_1_6 = __VERIFIER_nondet_short() [L52] CALL assume_abort_if_not(var_1_6 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=1] [L52] RET assume_abort_if_not(var_1_6 >= -16383) VAL [isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=1] [L53] CALL assume_abort_if_not(var_1_6 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=1] [L53] RET assume_abort_if_not(var_1_6 <= 16383) VAL [isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=1] [L54] var_1_8 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L55] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L56] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L56] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_1=-1, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L69] RET updateVariables() [L70] CALL step() [L33] COND TRUE (var_1_2 + (15.3 / var_1_3)) > (- var_1_4) [L34] var_1_1 = (var_1_5 + var_1_6) VAL [isInitial=1, var_1_1=32766, var_1_5=16383, var_1_6=16383, var_1_7=0, var_1_8=-255] [L38] var_1_7 = var_1_8 VAL [isInitial=1, var_1_1=32766, var_1_5=16383, var_1_6=16383, var_1_7=-255, var_1_8=-255] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return (((var_1_2 + (15.3 / var_1_3)) > (- var_1_4)) ? (var_1_1 == ((signed short int) (var_1_5 + var_1_6))) : (var_1_1 == ((signed short int) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5)))))) && (var_1_7 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_1=32766, var_1_5=16383, var_1_6=16383, var_1_7=-255, var_1_8=-255] [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=32766, var_1_5=16383, var_1_6=16383, var_1_7=-255, var_1_8=-255] [L19] reach_error() VAL [isInitial=1, var_1_1=32766, var_1_5=16383, var_1_6=16383, var_1_7=-255, var_1_8=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 10, 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, 43 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, 43 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 132 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 342/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:03:14,951 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-18.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 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:03:16,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:03:16,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:03:16,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:03:16,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:03:16,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:03:16,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:03:16,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:03:16,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:03:16,802 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:03:16,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:03:16,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:03:16,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:03:16,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:03:16,803 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:03:16,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:03:16,804 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:03:16,805 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:03:16,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:03:16,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:03:16,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:03:16,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:03:16,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:16,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:03:16,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:03:16,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:03:16,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:03:16,807 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 -> 09678c77438823f5421658f269ea899b63adcdec9e9a366091e7381adf928989 [2025-03-04 00:03:17,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:03:17,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:03:17,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:03:17,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:03:17,012 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:03:17,013 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-18.i [2025-03-04 00:03:18,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416a88651/1767b3c9eeb848878a3941d48bad20f8/FLAG77f1c9856 [2025-03-04 00:03:18,355 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:03:18,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-18.i [2025-03-04 00:03:18,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416a88651/1767b3c9eeb848878a3941d48bad20f8/FLAG77f1c9856 [2025-03-04 00:03:18,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/416a88651/1767b3c9eeb848878a3941d48bad20f8 [2025-03-04 00:03:18,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:03:18,722 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:03:18,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:18,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:03:18,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:03:18,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c29e12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18, skipping insertion in model container [2025-03-04 00:03:18,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:03:18,828 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-18.i[915,928] [2025-03-04 00:03:18,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:18,870 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:03:18,877 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-18.i[915,928] [2025-03-04 00:03:18,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:03:18,904 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:03:18,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18 WrapperNode [2025-03-04 00:03:18,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:03:18,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:18,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:03:18,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:03:18,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,934 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 71 [2025-03-04 00:03:18,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:03:18,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:03:18,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:03:18,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:03:18,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:03:18,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:03:18,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:03:18,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:03:18,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:03:18,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (1/1) ... [2025-03-04 00:03:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:03:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:03:19,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:03:19,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:03:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:03:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:03:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:03:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:03:19,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:03:19,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:03:19,079 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:03:19,081 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:03:31,645 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:03:31,645 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:03:31,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:03:31,653 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:03:31,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:31 BoogieIcfgContainer [2025-03-04 00:03:31,653 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:03:31,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:03:31,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:03:31,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:03:31,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:03:18" (1/3) ... [2025-03-04 00:03:31,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278226a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:03:31, skipping insertion in model container [2025-03-04 00:03:31,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:03:18" (2/3) ... [2025-03-04 00:03:31,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278226a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:03:31, skipping insertion in model container [2025-03-04 00:03:31,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:03:31" (3/3) ... [2025-03-04 00:03:31,660 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-18.i [2025-03-04 00:03:31,669 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:03:31,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-18.i that has 2 procedures, 36 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:03:31,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:03:31,712 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;@6054ed20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:03:31,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:03:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:03:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 00:03:31,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:31,723 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:03:31,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:31,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:31,729 INFO L85 PathProgramCache]: Analyzing trace with hash 919941997, now seen corresponding path program 1 times [2025-03-04 00:03:31,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:03:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [14706419] [2025-03-04 00:03:31,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:31,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:03:31,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:03:31,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:03:31,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:03:31,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 00:03:32,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 00:03:32,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:32,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:32,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:03:32,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-04 00:03:32,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:03:32,439 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:03:32,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [14706419] [2025-03-04 00:03:32,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [14706419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:03:32,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:03:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:03:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628195398] [2025-03-04 00:03:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:03:32,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:03:32,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:03:32,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:03:32,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:03:32,456 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 00:03:32,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:03:32,471 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2025-03-04 00:03:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:03:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 67 [2025-03-04 00:03:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:03:32,476 INFO L225 Difference]: With dead ends: 66 [2025-03-04 00:03:32,477 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 00:03:32,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:03:32,480 INFO L435 NwaCegarLoop]: 43 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, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:03:32,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:03:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 00:03:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-04 00:03:32,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:03:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2025-03-04 00:03:32,507 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 67 [2025-03-04 00:03:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:03:32,507 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2025-03-04 00:03:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-04 00:03:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2025-03-04 00:03:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 00:03:32,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:03:32,509 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:03:32,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:03:32,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:03:32,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:03:32,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:03:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash 875478413, now seen corresponding path program 1 times [2025-03-04 00:03:32,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:03:32,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699067775] [2025-03-04 00:03:32,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:03:32,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-04 00:03:32,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:03:32,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:03:32,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:03:32,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 00:03:33,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 00:03:33,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:03:33,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:03:33,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 00:03:33,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:03:41,539 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:03:49,823 WARN L286 SmtUtils]: Spent 8.28s 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-04 00:03:53,919 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2025-03-04 00:03:57,998 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2025-03-04 00:04:06,157 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:04:14,428 WARN L286 SmtUtils]: Spent 8.27s 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-04 00:04:22,700 WARN L286 SmtUtils]: Spent 8.27s 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-04 00:04:26,778 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_7~0 c_~var_1_8~0) (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from false [2025-03-04 00:04:30,856 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_7~0 c_~var_1_8~0) (= c_~var_1_1~0 ((_ extract 15 0) (bvadd ((_ sign_extend 16) c_~var_1_6~0) ((_ sign_extend 16) c_~var_1_5~0)))) (fp.gt (fp.add c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 153.0 10.0)) c_~var_1_3~0)) (fp.neg c_~var_1_4~0))) is different from true [2025-03-04 00:04:43,627 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:04:47,723 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_property_#res#1| (_ bv1 32)) (exists ((~var_1_3~0 (_ FloatingPoint 11 53)) (~var_1_2~0 (_ FloatingPoint 11 53)) (~var_1_4~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (fp.gt (fp.add currentRoundingMode ~var_1_2~0 (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 153.0 10.0)) ~var_1_3~0)) (fp.neg ~var_1_4~0)))) is different from false [2025-03-04 00:05:00,021 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)