./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.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-61.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 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:16:33,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:16:33,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:16:33,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:16:33,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:16:33,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:16:33,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:16:33,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:16:33,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:16:33,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:16:33,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:16:33,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:16:33,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:33,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:16:33,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:16:33,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:16:33,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:16:33,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:16:33,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:16:33,332 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 -> 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 [2025-03-08 15:16:33,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:16:33,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:16:33,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:16:33,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:16:33,542 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:16:33,542 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-61.i [2025-03-08 15:16:34,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7449d8143/a49ca80cee244de8bac02883c17fb22e/FLAG4fe153ac7 [2025-03-08 15:16:34,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:16:34,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2025-03-08 15:16:34,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7449d8143/a49ca80cee244de8bac02883c17fb22e/FLAG4fe153ac7 [2025-03-08 15:16:35,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7449d8143/a49ca80cee244de8bac02883c17fb22e [2025-03-08 15:16:35,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:16:35,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:16:35,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:35,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:16:35,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:16:35,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f4b53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35, skipping insertion in model container [2025-03-08 15:16:35,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,278 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:16:35,380 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-61.i[915,928] [2025-03-08 15:16:35,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:35,419 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:16:35,429 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-61.i[915,928] [2025-03-08 15:16:35,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:35,454 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:16:35,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35 WrapperNode [2025-03-08 15:16:35,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:35,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:35,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:16:35,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:16:35,460 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:16:35" (1/1) ... [2025-03-08 15:16:35,465 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:16:35" (1/1) ... [2025-03-08 15:16:35,480 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2025-03-08 15:16:35,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:35,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:16:35,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:16:35,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:16:35,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,491 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,507 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:16:35,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:16:35,521 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:16:35,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:16:35,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:16:35,522 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (1/1) ... [2025-03-08 15:16:35,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:16:35,550 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:16:35,552 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:16:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:16:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:16:35,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:16:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:16:35,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:16:35,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:16:35,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:16:35,620 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:16:35,771 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:16:35,771 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:16:35,777 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:16:35,780 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:16:35,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:35 BoogieIcfgContainer [2025-03-08 15:16:35,780 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:16:35,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:16:35,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:16:35,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:16:35,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:16:35" (1/3) ... [2025-03-08 15:16:35,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d06ccc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:35, skipping insertion in model container [2025-03-08 15:16:35,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:35" (2/3) ... [2025-03-08 15:16:35,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d06ccc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:35, skipping insertion in model container [2025-03-08 15:16:35,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:35" (3/3) ... [2025-03-08 15:16:35,787 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-61.i [2025-03-08 15:16:35,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:16:35,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-61.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:16:35,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:16:35,847 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;@77e88b97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:16:35,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:16:35,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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:16:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 15:16:35,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:35,859 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] [2025-03-08 15:16:35,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:35,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 922767047, now seen corresponding path program 1 times [2025-03-08 15:16:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:16:35,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667167482] [2025-03-08 15:16:35,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:16:35,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 15:16:35,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 15:16:35,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:35,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:36,014 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:16:36,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:16:36,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667167482] [2025-03-08 15:16:36,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667167482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:16:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642435] [2025-03-08 15:16:36,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:36,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:16:36,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:16:36,019 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:16:36,021 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:16:36,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 15:16:36,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 15:16:36,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:36,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:36,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:16:36,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:16:36,138 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:16:36,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:16:36,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:16:36,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:16:36,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:16:36,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172623127] [2025-03-08 15:16:36,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:16:36,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:16:36,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:16:36,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:16:36,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:16:36,156 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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.0) internal successors, (22), 2 states have internal predecessors, (22), 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:16:36,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:16:36,171 INFO L93 Difference]: Finished difference Result 68 states and 106 transitions. [2025-03-08 15:16:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:16:36,173 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, (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 72 [2025-03-08 15:16:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:16:36,177 INFO L225 Difference]: With dead ends: 68 [2025-03-08 15:16:36,177 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 15:16:36,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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:16:36,183 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:16:36,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:16:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 15:16:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 15:16:36,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:16:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 15:16:36,210 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 72 [2025-03-08 15:16:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:16:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 15:16:36,212 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, (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:16:36,212 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 15:16:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 15:16:36,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:36,215 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] [2025-03-08 15:16:36,222 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:16:36,420 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:16:36,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:36,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:36,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1134929722, now seen corresponding path program 1 times [2025-03-08 15:16:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:16:36,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516869171] [2025-03-08 15:16:36,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:16:36,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 15:16:36,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 15:16:36,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:36,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:16:36,505 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:16:36,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 15:16:36,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 15:16:36,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:36,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:16:36,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:16:36,575 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:16:36,576 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:16:36,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:16:36,580 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:16:36,635 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:16:36,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:16:36 BoogieIcfgContainer [2025-03-08 15:16:36,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:16:36,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:16:36,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:16:36,642 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:16:36,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:35" (3/4) ... [2025-03-08 15:16:36,644 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:16:36,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:16:36,646 INFO L158 Benchmark]: Toolchain (without parser) took 1385.31ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 104.0MB in the end (delta: 1.7MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2025-03-08 15:16:36,646 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 115.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:16:36,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.19ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:16:36,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.46ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:16:36,647 INFO L158 Benchmark]: Boogie Preprocessor took 37.51ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 91.2MB in the end (delta: 744.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:16:36,648 INFO L158 Benchmark]: IcfgBuilder took 258.85ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 78.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:16:36,648 INFO L158 Benchmark]: TraceAbstraction took 858.65ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 104.0MB in the end (delta: -26.6MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2025-03-08 15:16:36,648 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 142.6MB. Free memory is still 104.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:16:36,649 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 115.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.19ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 93.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.46ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.51ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 91.2MB in the end (delta: 744.4kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 258.85ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 78.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 858.65ms. Allocated memory is still 142.6MB. Free memory was 77.5MB in the beginning and 104.0MB in the end (delta: -26.6MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 142.6MB. Free memory is still 104.0MB. 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 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 0; [L23] double var_1_2 = 199.5; [L24] double var_1_3 = 10.25; [L25] signed char var_1_4 = 5; [L26] signed char var_1_5 = 64; [L27] signed char var_1_6 = 8; [L28] signed char var_1_7 = 5; [L29] unsigned long int var_1_8 = 8; VAL [isInitial=0, var_1_1=0, var_1_2=399/2, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] FCALL updateLastVariables() [L70] 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=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [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=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L43] CALL assume_abort_if_not(var_1_2 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L43] RET assume_abort_if_not(var_1_2 != 0.0F) VAL [isInitial=1, var_1_1=0, var_1_3=41/4, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L44] var_1_3 = __VERIFIER_nondet_double() [L45] 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=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L45] 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=0, var_1_4=5, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L46] var_1_4 = __VERIFIER_nondet_char() [L47] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L47] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L48] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L48] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=64, var_1_6=8, var_1_7=5, var_1_8=8] [L49] var_1_5 = __VERIFIER_nondet_char() [L50] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L50] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L51] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L51] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=8, var_1_7=5, var_1_8=8] [L52] var_1_6 = __VERIFIER_nondet_char() [L53] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L53] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L54] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L54] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=5, var_1_8=8] [L55] var_1_7 = __VERIFIER_nondet_char() [L56] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L56] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L57] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L57] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_1=0, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L70] RET updateVariables() [L71] CALL step() [L33] COND TRUE (999.375 / ((((var_1_2) > (-0.19)) ? (var_1_2) : (-0.19)))) >= var_1_3 [L34] var_1_1 = (var_1_4 + -32) VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=8] [L38] var_1_8 = var_1_7 VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((999.375 / ((((var_1_2) > (-0.19)) ? (var_1_2) : (-0.19)))) >= var_1_3) ? (var_1_1 == ((signed char) (var_1_4 + -32))) : (var_1_1 == ((signed char) (((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) - var_1_7)))) && (var_1_8 == ((unsigned long int) var_1_7)) ; VAL [\result=0, isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_1=-32, var_1_4=0, var_1_5=126, var_1_6=126, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 37 locations, 61 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, 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, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 45 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 171 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:16:36,665 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-61.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 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:16:38,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:16:38,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:16:38,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:16:38,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:16:38,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:16:38,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:16:38,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:16:38,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:16:38,609 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:16:38,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:16:38,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:16:38,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:16:38,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:16:38,610 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:16:38,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:16:38,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:16:38,610 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:16:38,611 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:38,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:16:38,611 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:16:38,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:16:38,612 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 -> 5d36c740de441534d386d096ea681ce3661c00ad30f9b23294cc7086c26f7103 [2025-03-08 15:16:38,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:16:38,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:16:38,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:16:38,870 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:16:38,870 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:16:38,871 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-61.i [2025-03-08 15:16:40,016 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4664aa1/7d6ece879fbb40768848b97b24d30e62/FLAGc0b62748e [2025-03-08 15:16:40,194 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:16:40,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-61.i [2025-03-08 15:16:40,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4664aa1/7d6ece879fbb40768848b97b24d30e62/FLAGc0b62748e [2025-03-08 15:16:40,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4664aa1/7d6ece879fbb40768848b97b24d30e62 [2025-03-08 15:16:40,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:16:40,601 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:16:40,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:40,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:16:40,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:16:40,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42186410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40, skipping insertion in model container [2025-03-08 15:16:40,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:16:40,703 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-61.i[915,928] [2025-03-08 15:16:40,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:40,751 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:16:40,759 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-61.i[915,928] [2025-03-08 15:16:40,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:16:40,790 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:16:40,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40 WrapperNode [2025-03-08 15:16:40,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:16:40,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:40,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:16:40,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:16:40,796 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:16:40" (1/1) ... [2025-03-08 15:16:40,802 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:16:40" (1/1) ... [2025-03-08 15:16:40,814 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2025-03-08 15:16:40,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:16:40,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:16:40,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:16:40,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:16:40,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,832 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:16:40,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:16:40,842 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:16:40,842 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:16:40,842 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:16:40,843 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (1/1) ... [2025-03-08 15:16:40,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:16:40,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:16:40,871 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:16:40,875 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:16:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:16:40,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:16:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:16:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:16:40,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:16:40,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:16:40,944 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:16:40,945 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:16:51,901 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 15:16:51,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:16:51,908 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:16:51,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:16:51,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:51 BoogieIcfgContainer [2025-03-08 15:16:51,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:16:51,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:16:51,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:16:51,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:16:51,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:16:40" (1/3) ... [2025-03-08 15:16:51,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f995f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:51, skipping insertion in model container [2025-03-08 15:16:51,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:16:40" (2/3) ... [2025-03-08 15:16:51,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f995f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:16:51, skipping insertion in model container [2025-03-08 15:16:51,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:16:51" (3/3) ... [2025-03-08 15:16:51,916 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-61.i [2025-03-08 15:16:51,925 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:16:51,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-61.i that has 2 procedures, 37 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:16:51,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:16:51,967 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;@2fcd6bbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:16:51,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:16:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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:16:51,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 15:16:51,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:51,976 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] [2025-03-08 15:16:51,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:51,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:51,980 INFO L85 PathProgramCache]: Analyzing trace with hash 922767047, now seen corresponding path program 1 times [2025-03-08 15:16:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:16:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49233870] [2025-03-08 15:16:51,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:51,988 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:16:51,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:16:51,990 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:16:51,991 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:16:52,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 15:16:52,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 15:16:52,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:52,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:52,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:16:52,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:16:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 15:16:52,656 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:16:52,657 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:16:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49233870] [2025-03-08 15:16:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49233870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:16:52,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:16:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:16:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041543551] [2025-03-08 15:16:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:16:52,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:16:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:16:52,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:16:52,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:16:52,677 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 15:16:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:16:52,695 INFO L93 Difference]: Finished difference Result 68 states and 106 transitions. [2025-03-08 15:16:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:16:52,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2025-03-08 15:16:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:16:52,707 INFO L225 Difference]: With dead ends: 68 [2025-03-08 15:16:52,707 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 15:16:52,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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:16:52,715 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:16:52,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:16:52,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 15:16:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 15:16:52,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:16:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2025-03-08 15:16:52,739 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 72 [2025-03-08 15:16:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:16:52,740 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2025-03-08 15:16:52,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 15:16:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2025-03-08 15:16:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 15:16:52,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:16:52,741 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] [2025-03-08 15:16:52,758 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:16:52,942 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:16:52,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:16:52,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:16:52,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1134929722, now seen corresponding path program 1 times [2025-03-08 15:16:52,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:16:52,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [145462721] [2025-03-08 15:16:52,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:16:52,944 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:16:52,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:16:52,947 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:16:52,948 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:16:52,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 15:16:53,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 15:16:53,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:16:53,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:16:53,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:16:53,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:17:02,083 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:17:10,968 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:17:18,482 WARN L286 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:17:26,878 WARN L286 SmtUtils]: Spent 8.40s 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:17:31,000 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0)) is different from false [2025-03-08 15:17:35,117 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0)) is different from true [2025-03-08 15:17:43,549 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:17:53,053 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:18:00,642 WARN L286 SmtUtils]: Spent 7.59s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:18:07,572 WARN L286 SmtUtils]: Spent 6.93s 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:18:16,011 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:18:20,149 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0) (= ((_ sign_extend 24) c_~var_1_7~0) c_~var_1_8~0)) is different from false [2025-03-08 15:18:24,272 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 19.0 100.0))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7995.0 8.0))) (.cse2 (fp.gt c_~var_1_2~0 .cse1))) (or (and (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) c_~var_1_3~0) (not .cse2)) (and (fp.geq (fp.div c_currentRoundingMode .cse0 c_~var_1_2~0) c_~var_1_3~0) .cse2)))) (= ((_ extract 7 0) (bvadd (_ bv4294967264 32) ((_ sign_extend 24) c_~var_1_4~0))) c_~var_1_1~0) (= ((_ sign_extend 24) c_~var_1_7~0) c_~var_1_8~0)) is different from true