/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc5 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 06:12:25,845 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 06:12:25,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 06:12:25,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 06:12:25,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 06:12:25,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 06:12:25,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 06:12:25,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 06:12:25,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 06:12:25,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 06:12:25,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 06:12:25,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 06:12:25,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 06:12:25,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 06:12:25,956 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 06:12:25,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 06:12:25,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 06:12:25,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 06:12:25,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 06:12:25,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 06:12:25,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 06:12:25,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 06:12:25,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 06:12:25,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 06:12:25,963 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 06:12:25,963 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 06:12:25,963 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 06:12:25,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 06:12:25,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 06:12:25,964 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 06:12:25,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 06:12:25,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 06:12:25,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 06:12:25,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 06:12:25,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 06:12:25,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 06:12:25,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 06:12:25,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 06:12:25,966 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 06:12:25,966 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 06:12:25,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 06:12:25,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 06:12:25,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 06:12:25,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 06:12:25,969 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:26,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 06:12:26,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 06:12:26,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 06:12:26,244 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 06:12:26,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 06:12:26,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c [2024-11-03 06:12:27,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 06:12:27,865 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 06:12:27,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c [2024-11-03 06:12:27,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f65a5c3/c3e6c735fc3b4ab1bb86cb67ba4a1212/FLAGa1dd4791e [2024-11-03 06:12:27,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f65a5c3/c3e6c735fc3b4ab1bb86cb67ba4a1212 [2024-11-03 06:12:27,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 06:12:27,903 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 06:12:27,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 06:12:27,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 06:12:27,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 06:12:27,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 06:12:27" (1/1) ... [2024-11-03 06:12:27,913 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c16dd2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:27, skipping insertion in model container [2024-11-03 06:12:27,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 06:12:27" (1/1) ... [2024-11-03 06:12:27,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 06:12:28,164 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c[1958,1971] [2024-11-03 06:12:28,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 06:12:28,187 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 06:12:28,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1232b.c[1958,1971] [2024-11-03 06:12:28,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 06:12:28,250 INFO L204 MainTranslator]: Completed translation [2024-11-03 06:12:28,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28 WrapperNode [2024-11-03 06:12:28,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 06:12:28,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 06:12:28,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 06:12:28,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 06:12:28,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,296 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-03 06:12:28,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 06:12:28,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 06:12:28,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 06:12:28,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 06:12:28,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,317 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,336 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-03 06:12:28,336 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 06:12:28,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 06:12:28,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 06:12:28,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 06:12:28,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (1/1) ... [2024-11-03 06:12:28,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 06:12:28,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 06:12:28,396 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) [2024-11-03 06:12:28,403 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 [2024-11-03 06:12:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 06:12:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-03 06:12:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-03 06:12:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-03 06:12:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 06:12:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-03 06:12:28,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-03 06:12:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 06:12:28,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 06:12:28,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 06:12:28,527 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 06:12:28,530 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 06:12:28,761 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-03 06:12:28,761 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 06:12:28,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 06:12:28,772 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-03 06:12:28,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 06:12:28 BoogieIcfgContainer [2024-11-03 06:12:28,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 06:12:28,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 06:12:28,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 06:12:28,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 06:12:28,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 06:12:27" (1/3) ... [2024-11-03 06:12:28,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e9217e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 06:12:28, skipping insertion in model container [2024-11-03 06:12:28,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:28" (2/3) ... [2024-11-03 06:12:28,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e9217e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 06:12:28, skipping insertion in model container [2024-11-03 06:12:28,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 06:12:28" (3/3) ... [2024-11-03 06:12:28,781 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232b.c [2024-11-03 06:12:28,795 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 06:12:28,796 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 06:12:28,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 06:12:28,864 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;@2fea4ef7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 06:12:28,864 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 06:12:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-03 06:12:28,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:28,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:28,879 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-03 06:12:28,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:28,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029928553] [2024-11-03 06:12:28,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:28,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:28,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:28,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:28,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-03 06:12:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:29,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 06:12:29,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:29,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:29,061 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:29,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029928553] [2024-11-03 06:12:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2029928553] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:29,064 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 06:12:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460735937] [2024-11-03 06:12:29,066 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:29,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 06:12:29,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:29,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 06:12:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 06:12:29,098 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 06:12:29,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:29,119 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-03 06:12:29,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 06:12:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-03 06:12:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:29,127 INFO L225 Difference]: With dead ends: 51 [2024-11-03 06:12:29,128 INFO L226 Difference]: Without dead ends: 24 [2024-11-03 06:12:29,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 06:12:29,135 INFO L432 NwaCegarLoop]: 34 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, 34 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 [2024-11-03 06:12:29,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 06:12:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-03 06:12:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-03 06:12:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:29,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-03 06:12:29,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-03 06:12:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:29,177 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-03 06:12:29,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 06:12:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-03 06:12:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 06:12:29,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:29,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:29,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-03 06:12:29,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:29,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:29,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:29,385 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-03 06:12:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:29,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1482831996] [2024-11-03 06:12:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:29,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:29,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:29,389 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:29,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-03 06:12:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:29,480 WARN L253 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-03 06:12:29,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:29,625 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_6| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_6| (_ bv0 1))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_6| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_6|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_6| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:12:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:29,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:30,336 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:30,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1482831996] [2024-11-03 06:12:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1482831996] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:30,337 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:30,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2024-11-03 06:12:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661376530] [2024-11-03 06:12:30,337 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:30,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 06:12:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 06:12:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2024-11-03 06:12:30,340 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:30,626 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-11-03 06:12:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 06:12:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-03 06:12:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:30,629 INFO L225 Difference]: With dead ends: 40 [2024-11-03 06:12:30,629 INFO L226 Difference]: Without dead ends: 31 [2024-11-03 06:12:30,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-11-03 06:12:30,632 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:30,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 54 Unchecked, 0.2s Time] [2024-11-03 06:12:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-03 06:12:30,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-03 06:12:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 06:12:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-03 06:12:30,643 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-03 06:12:30,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:30,643 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-03 06:12:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-03 06:12:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-03 06:12:30,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:30,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:30,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-03 06:12:30,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:30,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:30,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -248422138, now seen corresponding path program 1 times [2024-11-03 06:12:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:30,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [583596811] [2024-11-03 06:12:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:30,852 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:30,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:30,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:30,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-03 06:12:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:30,914 WARN L253 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-03 06:12:30,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:30,988 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_14| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_14| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_14|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_14| (_ bv8 32)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_14| (_ bv0 1))))) is different from true [2024-11-03 06:12:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:31,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:31,506 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [583596811] [2024-11-03 06:12:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [583596811] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:31,506 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 10 [2024-11-03 06:12:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572482043] [2024-11-03 06:12:31,507 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:31,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 06:12:31,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 06:12:31,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-11-03 06:12:31,509 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:31,581 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-03 06:12:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 06:12:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-03 06:12:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:31,582 INFO L225 Difference]: With dead ends: 31 [2024-11-03 06:12:31,583 INFO L226 Difference]: Without dead ends: 28 [2024-11-03 06:12:31,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2024-11-03 06:12:31,584 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:31,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2024-11-03 06:12:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-03 06:12:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-03 06:12:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 06:12:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-03 06:12:31,590 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2024-11-03 06:12:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:31,591 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-03 06:12:31,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-03 06:12:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-03 06:12:31,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:31,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:31,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-03 06:12:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:31,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:31,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1493632229, now seen corresponding path program 1 times [2024-11-03 06:12:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1517163874] [2024-11-03 06:12:31,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:31,795 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:31,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:31,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-03 06:12:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:31,914 WARN L253 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-03 06:12:31,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:32,072 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|))) (and (= (select .cse0 (_ bv0 32)) c___fpclassify_double_~lsw~0) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= (select .cse0 (_ bv4 32)) c___fpclassify_double_~msw~0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|)))) is different from true [2024-11-03 06:12:32,238 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (and (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32))) (and (not (= (_ bv0 32) (bvadd (_ bv2147483648 32) (select (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv4 32))))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|))) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))))) (exists ((|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (and (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32))) (and (not (= (select (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32)) (_ bv0 32))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|)))))) is different from true [2024-11-03 06:12:32,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:32,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:32,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:33,303 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:33,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1517163874] [2024-11-03 06:12:33,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1517163874] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:33,303 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:33,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2024-11-03 06:12:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367095422] [2024-11-03 06:12:33,304 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:33,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 06:12:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 06:12:33,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2024-11-03 06:12:33,309 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:33,923 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|))) (and (= (select .cse0 (_ bv0 32)) c___fpclassify_double_~lsw~0) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= (select .cse0 (_ bv4 32)) c___fpclassify_double_~msw~0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|)))) (or (exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) |c___fpclassify_double_#in~x|) (not (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_21|) (_ bv0 32))))) (exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvadd (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) |c___fpclassify_double_#in~x|))))) is different from true [2024-11-03 06:12:34,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:34,171 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-11-03 06:12:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 06:12:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-03 06:12:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:34,174 INFO L225 Difference]: With dead ends: 58 [2024-11-03 06:12:34,174 INFO L226 Difference]: Without dead ends: 34 [2024-11-03 06:12:34,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=53, Invalid=137, Unknown=4, NotChecked=78, Total=272 [2024-11-03 06:12:34,176 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:34,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 127 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2024-11-03 06:12:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-03 06:12:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-03 06:12:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-03 06:12:34,189 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2024-11-03 06:12:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:34,189 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-03 06:12:34,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-03 06:12:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 06:12:34,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:34,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:34,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-03 06:12:34,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:34,392 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:34,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1347694819, now seen corresponding path program 1 times [2024-11-03 06:12:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:34,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [795625899] [2024-11-03 06:12:34,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:34,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:34,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:34,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:34,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-03 06:12:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:34,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-03 06:12:34,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:34,550 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_32| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_25| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_32| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_32|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_25|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_25|)))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_32| (_ bv0 1)) |c_#valid|) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_32| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:12:34,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-03 06:12:34,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:34,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:34,793 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_33| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_33| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_33|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|)))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_33| (_ bv0 1)) |c_#valid|) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_33| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:12:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-03 06:12:34,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-03 06:12:35,626 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:35,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [795625899] [2024-11-03 06:12:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [795625899] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 06:12:35,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 06:12:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-03 06:12:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779234655] [2024-11-03 06:12:35,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:35,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 06:12:35,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:35,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 06:12:35,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-11-03 06:12:35,628 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:35,655 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-03 06:12:35,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 06:12:35,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-03 06:12:35,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:35,657 INFO L225 Difference]: With dead ends: 42 [2024-11-03 06:12:35,657 INFO L226 Difference]: Without dead ends: 33 [2024-11-03 06:12:35,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-11-03 06:12:35,658 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:35,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 06:12:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-03 06:12:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-03 06:12:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-03 06:12:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-03 06:12:35,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 26 [2024-11-03 06:12:35,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:35,668 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-03 06:12:35,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:35,668 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-03 06:12:35,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 06:12:35,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:35,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:35,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-03 06:12:35,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:35,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:35,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:35,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-03 06:12:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1341036852] [2024-11-03 06:12:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:35,872 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:35,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:35,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-03 06:12:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 06:12:35,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 06:12:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 06:12:36,109 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 06:12:36,109 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 06:12:36,110 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 06:12:36,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-03 06:12:36,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:36,316 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-03 06:12:36,350 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 06:12:36,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 06:12:36 BoogieIcfgContainer [2024-11-03 06:12:36,353 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 06:12:36,354 INFO L158 Benchmark]: Toolchain (without parser) took 8451.02ms. Allocated memory is still 333.4MB. Free memory was 280.1MB in the beginning and 224.8MB in the end (delta: 55.3MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. [2024-11-03 06:12:36,354 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 205.5MB. Free memory was 159.1MB in the beginning and 159.0MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 06:12:36,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.02ms. Allocated memory is still 333.4MB. Free memory was 279.6MB in the beginning and 266.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 06:12:36,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.70ms. Allocated memory is still 333.4MB. Free memory was 266.0MB in the beginning and 264.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 06:12:36,355 INFO L158 Benchmark]: Boogie Preprocessor took 61.75ms. Allocated memory is still 333.4MB. Free memory was 264.4MB in the beginning and 261.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 06:12:36,355 INFO L158 Benchmark]: RCFGBuilder took 411.82ms. Allocated memory is still 333.4MB. Free memory was 261.8MB in the beginning and 246.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2024-11-03 06:12:36,358 INFO L158 Benchmark]: TraceAbstraction took 7578.01ms. Allocated memory is still 333.4MB. Free memory was 246.1MB in the beginning and 224.8MB in the end (delta: 21.2MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2024-11-03 06:12:36,359 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.32ms. Allocated memory is still 205.5MB. Free memory was 159.1MB in the beginning and 159.0MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 348.02ms. Allocated memory is still 333.4MB. Free memory was 279.6MB in the beginning and 266.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.70ms. Allocated memory is still 333.4MB. Free memory was 266.0MB in the beginning and 264.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.75ms. Allocated memory is still 333.4MB. Free memory was 264.4MB in the beginning and 261.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 411.82ms. Allocated memory is still 333.4MB. Free memory was 261.8MB in the beginning and 246.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7578.01ms. Allocated memory is still 333.4MB. Free memory was 246.1MB in the beginning and 224.8MB in the end (delta: 21.2MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. * 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 - CounterExampleResult [Line: 82]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L76] double x = -0.0; [L77] double y = 0.0; [L78] CALL, EXPR fmin_double(x, y) [L48] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L48] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L48] COND FALSE !(__fpclassify_double(x) == 0) [L50] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L21] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (msw) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (lsw) = ew_u.parts.lsw [L30-L31] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L32] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L50] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L50] COND FALSE !(__fpclassify_double(y) == 0) [L53] return x < y ? x : y; VAL [\result=0.0] [L78] RET, EXPR fmin_double(x, y) [L78] double res = fmin_double(x, y); [L81] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=0.0] [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] CALL, EXPR __signbit_double(res) [L57] __uint32_t msw; VAL [x=0.0] [L60] ieee_double_shape_type gh_u; [L61] gh_u.value = (x) [L62] EXPR gh_u.parts.msw [L62] (msw) = gh_u.parts.msw [L65] return (msw & 0x80000000) != 0; VAL [\result=0, x=0.0] [L81] RET, EXPR __signbit_double(res) [L81] EXPR res == -0.0 && __signbit_double(res) == 1 [L81] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L82] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 453 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 311 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 142 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 172 ConstructedInterpolants, 37 QuantifiedInterpolants, 1924 SizeOfPredicates, 43 NumberOfNonLiveVariables, 331 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 10/12 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-03 06:12:36,397 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...