./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-39.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 0fadbea4ce4d051fd90ea075ad07b7ac800688b213e3e7ee6ba3c0fda07bc228 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:43:09,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:43:09,779 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:43:09,785 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:43:09,786 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:43:09,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:43:09,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:43:09,815 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:43:09,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:43:09,815 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:43:09,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:43:09,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:43:09,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:43:09,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:43:09,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:43:09,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:43:09,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:43:09,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:09,816 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:43:09,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:43:09,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:43:09,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:43:09,817 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 -> 0fadbea4ce4d051fd90ea075ad07b7ac800688b213e3e7ee6ba3c0fda07bc228 [2025-03-17 02:43:10,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:43:10,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:43:10,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:43:10,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:43:10,121 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:43:10,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-39.i [2025-03-17 02:43:11,366 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6388c76ce/399cc1aafadf4b55a634cb9c530442b1/FLAGb7d996665 [2025-03-17 02:43:11,593 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:43:11,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-39.i [2025-03-17 02:43:11,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6388c76ce/399cc1aafadf4b55a634cb9c530442b1/FLAGb7d996665 [2025-03-17 02:43:11,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6388c76ce/399cc1aafadf4b55a634cb9c530442b1 [2025-03-17 02:43:11,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:43:11,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:43:11,618 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:11,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:43:11,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:43:11,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11, skipping insertion in model container [2025-03-17 02:43:11,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,633 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:43:11,750 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_floatingpointinfluence_has-floats_file-39.i[917,930] [2025-03-17 02:43:11,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:11,816 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:43:11,825 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_floatingpointinfluence_has-floats_file-39.i[917,930] [2025-03-17 02:43:11,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:11,855 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:43:11,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11 WrapperNode [2025-03-17 02:43:11,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:11,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:11,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:43:11,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:43:11,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,886 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-17 02:43:11,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:11,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:43:11,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:43:11,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:43:11,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,903 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:43:11,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,904 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:43:11,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:43:11,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:43:11,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:43:11,918 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (1/1) ... [2025-03-17 02:43:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:43:11,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:43:11,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:43:11,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:43:11,968 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:43:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:43:11,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:43:11,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:43:11,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:43:12,032 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:43:12,034 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:43:12,182 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2025-03-17 02:43:12,202 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:43:12,202 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:43:12,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:43:12,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:43:12,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:12 BoogieIcfgContainer [2025-03-17 02:43:12,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:43:12,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:43:12,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:43:12,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:43:12,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:43:11" (1/3) ... [2025-03-17 02:43:12,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:12, skipping insertion in model container [2025-03-17 02:43:12,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:11" (2/3) ... [2025-03-17 02:43:12,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7876bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:12, skipping insertion in model container [2025-03-17 02:43:12,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:12" (3/3) ... [2025-03-17 02:43:12,222 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-39.i [2025-03-17 02:43:12,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:43:12,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-39.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:43:12,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:43:12,284 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;@57cfa2e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:43:12,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:43:12,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:43:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 02:43:12,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:12,297 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:12,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:12,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1109733330, now seen corresponding path program 1 times [2025-03-17 02:43:12,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:43:12,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088653504] [2025-03-17 02:43:12,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:12,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:43:12,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 02:43:12,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 02:43:12,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:12,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:43:12,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:43:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088653504] [2025-03-17 02:43:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088653504] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:43:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223084743] [2025-03-17 02:43:12,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:12,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:43:12,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:43:12,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 02:43:12,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 02:43:12,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 02:43:12,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 02:43:12,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:12,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:12,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:43:12,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:43:12,601 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:43:12,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:43:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223084743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:43:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:43:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:43:12,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566477] [2025-03-17 02:43:12,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:43:12,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:43:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:43:12,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:43:12,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:12,626 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:43:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:43:12,650 INFO L93 Difference]: Finished difference Result 99 states and 164 transitions. [2025-03-17 02:43:12,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:43:12,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2025-03-17 02:43:12,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:43:12,659 INFO L225 Difference]: With dead ends: 99 [2025-03-17 02:43:12,660 INFO L226 Difference]: Without dead ends: 49 [2025-03-17 02:43:12,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:12,669 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:43:12,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:43:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-17 02:43:12,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-17 02:43:12,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:43:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 71 transitions. [2025-03-17 02:43:12,708 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 71 transitions. Word has length 101 [2025-03-17 02:43:12,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:43:12,709 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 71 transitions. [2025-03-17 02:43:12,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:43:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 71 transitions. [2025-03-17 02:43:12,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 02:43:12,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:12,714 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:12,721 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-17 02:43:12,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 02:43:12,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:12,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:12,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1118450090, now seen corresponding path program 1 times [2025-03-17 02:43:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:43:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679607990] [2025-03-17 02:43:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:43:12,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 02:43:12,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 02:43:12,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:12,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 02:43:14,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:43:14,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679607990] [2025-03-17 02:43:14,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679607990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:43:14,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:43:14,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 02:43:14,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713906608] [2025-03-17 02:43:14,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:43:14,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 02:43:14,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:43:14,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 02:43:14,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 02:43:14,068 INFO L87 Difference]: Start difference. First operand 49 states and 71 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:43:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:43:14,338 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2025-03-17 02:43:14,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:43:14,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2025-03-17 02:43:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:43:14,342 INFO L225 Difference]: With dead ends: 115 [2025-03-17 02:43:14,342 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 02:43:14,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 02:43:14,343 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 52 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 02:43:14,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 267 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 02:43:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 02:43:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2025-03-17 02:43:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:43:14,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2025-03-17 02:43:14,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 101 [2025-03-17 02:43:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:43:14,356 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2025-03-17 02:43:14,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 02:43:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2025-03-17 02:43:14,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 02:43:14,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:14,360 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:14,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:43:14,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:14,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:14,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1480642576, now seen corresponding path program 1 times [2025-03-17 02:43:14,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:43:14,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713062185] [2025-03-17 02:43:14,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:43:14,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:43:14,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:43:14,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:14,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:43:14,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:43:14,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 02:43:14,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 02:43:14,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:14,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:43:14,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:43:14,509 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:43:14,510 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:43:14,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:43:14,513 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:43:14,577 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:43:14,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:43:14 BoogieIcfgContainer [2025-03-17 02:43:14,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:43:14,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:43:14,582 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:43:14,582 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:43:14,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:12" (3/4) ... [2025-03-17 02:43:14,585 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:43:14,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:43:14,586 INFO L158 Benchmark]: Toolchain (without parser) took 2968.58ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 104.4MB in the end (delta: 28.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2025-03-17 02:43:14,586 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:43:14,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.45ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:43:14,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.92ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 117.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:43:14,587 INFO L158 Benchmark]: Boogie Preprocessor took 28.54ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 116.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:43:14,587 INFO L158 Benchmark]: IcfgBuilder took 294.88ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 99.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:43:14,588 INFO L158 Benchmark]: TraceAbstraction took 2368.34ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 104.5MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:43:14,588 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 104.4MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:43:14,589 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.45ms. Allocated memory is still 167.8MB. Free memory was 132.5MB in the beginning and 119.8MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.92ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 117.9MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.54ms. Allocated memory is still 167.8MB. Free memory was 117.9MB in the beginning and 116.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 294.88ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 99.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2368.34ms. Allocated memory is still 167.8MB. Free memory was 98.9MB in the beginning and 104.5MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 167.8MB. Free memory was 104.5MB in the beginning and 104.4MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] float var_1_7 = 1.1; [L29] float var_1_8 = 7.8; [L30] float var_1_9 = 1.75; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L72] var_1_7 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L73] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L74] var_1_8 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_9=7/4] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5, var_1_9=7/4] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L80] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L80] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L83] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L97] RET updateVariables() [L98] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L38] COND TRUE var_1_2 >= var_1_1 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=5] [L39] COND TRUE ((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9 [L40] var_1_6 = var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741804, stepLocal_1=18, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741804, var_1_10=1, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] [L89-L90] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=1, var_1_3=18, var_1_4=0, var_1_5=18, var_1_6=18] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 91 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 130 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 405 NumberOfCodeBlocks, 405 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 1552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1410/1440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 02:43:14,607 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_floatingpointinfluence_has-floats_file-39.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 0fadbea4ce4d051fd90ea075ad07b7ac800688b213e3e7ee6ba3c0fda07bc228 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:43:16,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:43:16,756 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:43:16,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:43:16,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:43:16,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:43:16,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:43:16,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:43:16,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:43:16,788 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:43:16,788 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:43:16,788 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:43:16,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:43:16,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:43:16,789 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:43:16,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:43:16,789 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:43:16,790 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:43:16,791 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:43:16,791 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:43:16,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:43:16,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:43:16,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:43:16,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:43:16,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:16,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:43:16,792 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:43:16,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:43:16,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:43:16,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:43:16,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:43:16,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:43:16,793 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 -> 0fadbea4ce4d051fd90ea075ad07b7ac800688b213e3e7ee6ba3c0fda07bc228 [2025-03-17 02:43:17,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:43:17,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:43:17,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:43:17,107 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:43:17,107 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:43:17,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-39.i [2025-03-17 02:43:18,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ada1851/c7edbd1106774747b6a91726ecf4969b/FLAGefb422cac [2025-03-17 02:43:18,602 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:43:18,603 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-39.i [2025-03-17 02:43:18,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ada1851/c7edbd1106774747b6a91726ecf4969b/FLAGefb422cac [2025-03-17 02:43:18,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4ada1851/c7edbd1106774747b6a91726ecf4969b [2025-03-17 02:43:18,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:43:18,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:43:18,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:18,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:43:18,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:43:18,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18, skipping insertion in model container [2025-03-17 02:43:18,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:43:18,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_floatingpointinfluence_has-floats_file-39.i[917,930] [2025-03-17 02:43:18,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:18,793 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:43:18,800 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_floatingpointinfluence_has-floats_file-39.i[917,930] [2025-03-17 02:43:18,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:43:18,831 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:43:18,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18 WrapperNode [2025-03-17 02:43:18,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:43:18,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:18,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:43:18,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:43:18,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,875 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2025-03-17 02:43:18,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:43:18,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:43:18,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:43:18,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:43:18,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,908 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 02:43:18,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,921 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,928 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:43:18,931 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:43:18,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:43:18,931 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:43:18,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (1/1) ... [2025-03-17 02:43:18,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:43:18,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:43:18,968 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 02:43:18,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 02:43:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:43:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:43:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:43:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:43:18,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:43:18,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:43:19,061 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:43:19,064 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:43:19,544 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 02:43:19,546 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:43:19,554 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:43:19,554 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:43:19,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:19 BoogieIcfgContainer [2025-03-17 02:43:19,555 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:43:19,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:43:19,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:43:19,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:43:19,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:43:18" (1/3) ... [2025-03-17 02:43:19,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680368f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:19, skipping insertion in model container [2025-03-17 02:43:19,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:43:18" (2/3) ... [2025-03-17 02:43:19,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@680368f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:43:19, skipping insertion in model container [2025-03-17 02:43:19,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:43:19" (3/3) ... [2025-03-17 02:43:19,565 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-39.i [2025-03-17 02:43:19,575 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:43:19,577 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-39.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:43:19,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:43:19,645 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;@3dada0f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:43:19,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:43:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:43:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 02:43:19,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:19,659 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:19,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2016131497, now seen corresponding path program 1 times [2025-03-17 02:43:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:43:19,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778068959] [2025-03-17 02:43:19,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:19,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:43:19,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:43:19,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:43:19,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 02:43:19,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 02:43:19,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 02:43:19,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:19,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:19,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:43:19,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:43:19,938 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 02:43:19,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:43:19,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:43:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778068959] [2025-03-17 02:43:19,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778068959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:43:19,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:43:19,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:43:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182742606] [2025-03-17 02:43:19,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:43:19,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:43:19,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:43:19,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:43:19,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:19,956 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:43:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:43:19,973 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2025-03-17 02:43:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:43:19,974 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 97 [2025-03-17 02:43:19,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:43:19,978 INFO L225 Difference]: With dead ends: 83 [2025-03-17 02:43:19,978 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 02:43:19,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:43:19,982 INFO L435 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 02:43:19,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:43:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 02:43:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 02:43:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 02:43:20,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-17 02:43:20,027 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 97 [2025-03-17 02:43:20,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:43:20,028 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-17 02:43:20,028 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 02:43:20,028 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-03-17 02:43:20,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-17 02:43:20,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:43:20,030 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 02:43:20,038 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-17 02:43:20,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:43:20,231 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:43:20,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:43:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -698861011, now seen corresponding path program 1 times [2025-03-17 02:43:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:43:20,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521562587] [2025-03-17 02:43:20,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:43:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 02:43:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:43:20,234 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 02:43:20,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 02:43:20,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-17 02:43:20,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-17 02:43:20,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:43:20,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:43:20,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 02:43:20,443 INFO L279 TraceCheckSpWp]: Computing forward predicates...