/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-71.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 20:13:59,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 20:13:59,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-22 20:13:59,932 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 20:13:59,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 20:13:59,954 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 20:13:59,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 20:13:59,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 20:13:59,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 20:13:59,957 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 20:13:59,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 20:13:59,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 20:13:59,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 20:13:59,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 20:13:59,959 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 20:13:59,960 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 20:13:59,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 20:13:59,960 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 20:13:59,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 20:13:59,960 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 20:13:59,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 20:13:59,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 20:13:59,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 20:13:59,961 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 20:13:59,961 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 20:13:59,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 20:13:59,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 20:13:59,962 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 20:13:59,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 20:13:59,962 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 20:13:59,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 20:13:59,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 20:13:59,963 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 20:13:59,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 20:13:59,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 20:13:59,964 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 20:13:59,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 20:13:59,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 20:13:59,964 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 20:13:59,964 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 [2023-12-22 20:14:00,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 20:14:00,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 20:14:00,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 20:14:00,170 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 20:14:00,170 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 20:14:00,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2023-12-22 20:14:01,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 20:14:01,330 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 20:14:01,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-71.i [2023-12-22 20:14:01,338 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9abcff04/bb700f07249440edb0bd10ee0d5288ad/FLAG05fdc7f15 [2023-12-22 20:14:01,350 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9abcff04/bb700f07249440edb0bd10ee0d5288ad [2023-12-22 20:14:01,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 20:14:01,354 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 20:14:01,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 20:14:01,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 20:14:01,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 20:14:01,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60aef84f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01, skipping insertion in model container [2023-12-22 20:14:01,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,390 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 20:14:01,490 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-71.i[919,932] [2023-12-22 20:14:01,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 20:14:01,548 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 20:14:01,557 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-71.i[919,932] [2023-12-22 20:14:01,574 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 20:14:01,586 INFO L206 MainTranslator]: Completed translation [2023-12-22 20:14:01,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01 WrapperNode [2023-12-22 20:14:01,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 20:14:01,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 20:14:01,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 20:14:01,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 20:14:01,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,639 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-12-22 20:14:01,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 20:14:01,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 20:14:01,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 20:14:01,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 20:14:01,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,673 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]. [2023-12-22 20:14:01,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 20:14:01,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 20:14:01,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 20:14:01,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 20:14:01,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (1/1) ... [2023-12-22 20:14:01,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 20:14:01,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 20:14:01,716 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) [2023-12-22 20:14:01,738 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 [2023-12-22 20:14:01,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 20:14:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 20:14:01,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-22 20:14:01,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-22 20:14:01,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 20:14:01,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 20:14:01,837 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 20:14:01,839 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 20:14:11,145 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 20:14:11,188 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 20:14:11,188 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 20:14:11,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:14:11 BoogieIcfgContainer [2023-12-22 20:14:11,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 20:14:11,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 20:14:11,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 20:14:11,192 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 20:14:11,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 08:14:01" (1/3) ... [2023-12-22 20:14:11,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bda4278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 08:14:11, skipping insertion in model container [2023-12-22 20:14:11,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:14:01" (2/3) ... [2023-12-22 20:14:11,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bda4278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 08:14:11, skipping insertion in model container [2023-12-22 20:14:11,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:14:11" (3/3) ... [2023-12-22 20:14:11,194 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-71.i [2023-12-22 20:14:11,206 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 20:14:11,206 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 20:14:11,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 20:14:11,246 INFO L357 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, mHoare=true, 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;@6cf931bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 20:14:11,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 20:14:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-22 20:14:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-22 20:14:11,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 20:14:11,258 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 20:14:11,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 20:14:11,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 20:14:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash 998764117, now seen corresponding path program 1 times [2023-12-22 20:14:11,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 20:14:11,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436825725] [2023-12-22 20:14:11,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 20:14:11,271 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 [2023-12-22 20:14:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 20:14:11,273 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) [2023-12-22 20:14:11,278 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 [2023-12-22 20:14:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 20:14:11,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 20:14:11,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 20:14:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2023-12-22 20:14:11,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 20:14:11,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 20:14:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436825725] [2023-12-22 20:14:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436825725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 20:14:11,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 20:14:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 20:14:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985810772] [2023-12-22 20:14:11,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 20:14:11,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 20:14:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 20:14:11,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 20:14:11,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 20:14:11,781 INFO L87 Difference]: Start difference. First operand has 55 states, 31 states have (on average 1.4193548387096775) internal successors, (44), 32 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-22 20:14:16,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 20:14:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 20:14:16,034 INFO L93 Difference]: Finished difference Result 107 states and 191 transitions. [2023-12-22 20:14:16,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 20:14:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2023-12-22 20:14:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 20:14:16,127 INFO L225 Difference]: With dead ends: 107 [2023-12-22 20:14:16,127 INFO L226 Difference]: Without dead ends: 53 [2023-12-22 20:14:16,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 20:14:16,131 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-22 20:14:16,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-22 20:14:16,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-22 20:14:16,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-22 20:14:16,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-22 20:14:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2023-12-22 20:14:16,159 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 128 [2023-12-22 20:14:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 20:14:16,159 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2023-12-22 20:14:16,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-22 20:14:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2023-12-22 20:14:16,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-22 20:14:16,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 20:14:16,162 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 20:14:16,174 INFO L540 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)] Forceful destruction successful, exit code 0 [2023-12-22 20:14:16,371 WARN L477 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 [2023-12-22 20:14:16,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 20:14:16,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 20:14:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash -659258025, now seen corresponding path program 1 times [2023-12-22 20:14:16,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 20:14:16,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411311771] [2023-12-22 20:14:16,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 20:14:16,373 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 [2023-12-22 20:14:16,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 20:14:16,375 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) [2023-12-22 20:14:16,376 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 [2023-12-22 20:14:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 20:14:16,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 20:14:16,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 20:14:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-22 20:14:19,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 20:14:19,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 20:14:19,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411311771] [2023-12-22 20:14:19,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411311771] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 20:14:19,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 20:14:19,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 20:14:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670212398] [2023-12-22 20:14:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 20:14:19,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-22 20:14:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 20:14:19,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-22 20:14:19,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-22 20:14:19,596 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-22 20:14:24,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 20:14:25,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 20:14:29,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 20:14:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 20:14:29,141 INFO L93 Difference]: Finished difference Result 158 states and 242 transitions. [2023-12-22 20:14:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-22 20:14:29,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2023-12-22 20:14:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 20:14:29,238 INFO L225 Difference]: With dead ends: 158 [2023-12-22 20:14:29,238 INFO L226 Difference]: Without dead ends: 106 [2023-12-22 20:14:29,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-22 20:14:29,241 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-12-22 20:14:29,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 220 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 1 Unknown, 0 Unchecked, 9.5s Time] [2023-12-22 20:14:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-22 20:14:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2023-12-22 20:14:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-22 20:14:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 141 transitions. [2023-12-22 20:14:29,259 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 141 transitions. Word has length 128 [2023-12-22 20:14:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 20:14:29,259 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 141 transitions. [2023-12-22 20:14:29,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2023-12-22 20:14:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 141 transitions. [2023-12-22 20:14:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-22 20:14:29,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 20:14:29,261 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 20:14:29,273 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 (3)] Ended with exit code 0 [2023-12-22 20:14:29,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 [2023-12-22 20:14:29,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 20:14:29,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 20:14:29,466 INFO L85 PathProgramCache]: Analyzing trace with hash 20800345, now seen corresponding path program 1 times [2023-12-22 20:14:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 20:14:29,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720445787] [2023-12-22 20:14:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 20:14:29,467 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 [2023-12-22 20:14:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 20:14:29,468 INFO L229 MonitoredProcess]: Starting monitored process 4 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) [2023-12-22 20:14:29,469 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 (4)] Waiting until timeout for monitored process [2023-12-22 20:14:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 20:14:29,839 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-22 20:14:29,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 20:14:48,063 WARN L293 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:15:05,416 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:15:14,073 WARN L293 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:15:23,662 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:15:40,825 WARN L293 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:15:48,576 WARN L293 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:15:53,988 WARN L293 SmtUtils]: Spent 5.41s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:16:01,709 WARN L293 SmtUtils]: Spent 7.72s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:16:07,398 WARN L293 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:16:13,933 WARN L293 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:16:21,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (not (= (_ bv0 8) c_~var_1_2~0)) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 20:16:25,780 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (not (= (_ bv0 8) c_~var_1_2~0)) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-12-22 20:16:31,421 WARN L293 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:16:38,875 WARN L293 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:16:53,886 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:17:04,918 WARN L293 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:17:27,713 WARN L293 SmtUtils]: Spent 6.46s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:17:33,474 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:17:54,584 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:18:02,669 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:18:13,089 WARN L293 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:18:19,453 WARN L293 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:18:26,176 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:18:49,493 WARN L293 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:18:56,356 WARN L293 SmtUtils]: Spent 6.86s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:19:02,226 WARN L293 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:19:10,704 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 20:19:14,819 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-12-22 20:19:21,287 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:19:32,109 WARN L293 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:19:38,558 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:19:48,576 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:19:56,896 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:04,729 WARN L293 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:13,057 WARN L293 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:18,610 WARN L293 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:23,993 WARN L293 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:38,501 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:43,511 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:20:58,181 WARN L293 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:21:05,407 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:21:23,824 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:21:34,938 WARN L293 SmtUtils]: Spent 7.89s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:21:42,851 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-22 20:21:50,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_19~0 .cse0) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_~var_1_3~0 (_ bv0 8)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-22 20:21:54,600 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0)) (.cse5 ((_ sign_extend 24) c_~var_1_4~0))) (and (= ((_ sign_extend 8) c_~var_1_5~0) c_~var_1_21~0) (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (/ 511.0 2.0)))) (let ((.cse9 (fp.gt .cse10 c_~var_1_11~0))) (or (and (= c_~var_1_18~0 c_~var_1_11~0) (not .cse9)) (and (= c_~var_1_18~0 .cse10) .cse9)))) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_19~0 .cse0) (not (bvsgt (bvadd (bvneg .cse0) .cse5) (bvmul ((_ zero_extend 16) c_~last_1_var_1_21~0) (bvadd ((_ sign_extend 16) c_~last_1_var_1_14~0) ((_ zero_extend 16) c_~last_1_var_1_20~0))))) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= c_~var_1_15~0 c_~var_1_20~0) (= c_~var_1_23~0 c_~var_1_22~0) (= c_~var_1_3~0 (_ bv0 8)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true