./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:34:04,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:34:04,401 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-13 23:34:04,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:34:04,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:34:04,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:34:04,429 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:34:04,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:34:04,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:34:04,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:34:04,430 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:34:04,430 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:34:04,431 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-13 23:34:04,431 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-13 23:34:04,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:34:04,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:34:04,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:34:04,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:34:04,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:34:04,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:34:04,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:34:04,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:34:04,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:34:04,433 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:34:04,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:34:04,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:34:04,434 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:34:04,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:34:04,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:34:04,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:34:04,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:34:04,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:34:04,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:34:04,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:34:04,435 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-13 23:34:04,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:34:04,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:34:04,435 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:34:04,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 23:34:04,436 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2024-11-13 23:34:04,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:34:04,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:34:04,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:34:04,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:34:04,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:34:04,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/zonotope_2.c Unable to find full path for "g++" [2024-11-13 23:34:06,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:34:07,033 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:34:07,034 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/sv-benchmarks/c/float-benchs/zonotope_2.c [2024-11-13 23:34:07,041 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data/eafc98c36/a19c78519bc4493ba6fa9fcc19bfd6cd/FLAG4593f4a11 [2024-11-13 23:34:07,057 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data/eafc98c36/a19c78519bc4493ba6fa9fcc19bfd6cd [2024-11-13 23:34:07,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:34:07,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:34:07,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:34:07,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:34:07,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:34:07,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4dc8ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07, skipping insertion in model container [2024-11-13 23:34:07,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:34:07,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-13 23:34:07,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:34:07,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:34:07,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-13 23:34:07,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:34:07,339 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:34:07,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07 WrapperNode [2024-11-13 23:34:07,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:34:07,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:34:07,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:34:07,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:34:07,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,376 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2024-11-13 23:34:07,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:34:07,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:34:07,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:34:07,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:34:07,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,389 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,406 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,407 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,408 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:34:07,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:34:07,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:34:07,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:34:07,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (1/1) ... [2024-11-13 23:34:07,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:34:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:34:07,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:34:07,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:34:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:34:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:34:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:34:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:34:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 23:34:07,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 23:34:07,549 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:34:07,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:34:07,662 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-13 23:34:07,662 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:34:07,692 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:34:07,692 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:34:07,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:34:07 BoogieIcfgContainer [2024-11-13 23:34:07,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:34:07,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:34:07,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:34:07,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:34:07,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:34:07" (1/3) ... [2024-11-13 23:34:07,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bf19e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:34:07, skipping insertion in model container [2024-11-13 23:34:07,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:07" (2/3) ... [2024-11-13 23:34:07,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bf19e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:34:07, skipping insertion in model container [2024-11-13 23:34:07,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:34:07" (3/3) ... [2024-11-13 23:34:07,707 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2024-11-13 23:34:07,721 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:34:07,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG zonotope_2.c that has 2 procedures, 14 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:34:07,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:34:07,797 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=FINITE_AUTOMATA, 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;@d710492, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:34:07,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:34:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:34:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-13 23:34:07,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:07,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-13 23:34:07,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:34:07,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash 2014280827, now seen corresponding path program 1 times [2024-11-13 23:34:07,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-13 23:34:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265367917] [2024-11-13 23:34:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:34:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:34:07,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 23:34:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 23:34:07,983 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-13 23:34:07,985 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 23:34:07,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 23:34:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 23:34:07,997 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-13 23:34:08,021 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 23:34:08,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 11:34:08 BoogieIcfgContainer [2024-11-13 23:34:08,026 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 23:34:08,026 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 23:34:08,029 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 23:34:08,029 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 23:34:08,030 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:34:07" (3/4) ... [2024-11-13 23:34:08,032 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 23:34:08,033 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 23:34:08,035 INFO L158 Benchmark]: Toolchain (without parser) took 973.96ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 56.8MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 23:34:08,035 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:34:08,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.32ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 81.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:34:08,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.19ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:34:08,037 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.9MB in the end (delta: 730.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:34:08,040 INFO L158 Benchmark]: RCFGBuilder took 280.86ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 69.7MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 23:34:08,040 INFO L158 Benchmark]: TraceAbstraction took 330.56ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 57.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:34:08,041 INFO L158 Benchmark]: Witness Printer took 7.23ms. Allocated memory is still 117.4MB. Free memory was 57.1MB in the beginning and 56.8MB in the end (delta: 309.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:34:08,045 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.34ms. Allocated memory is still 117.4MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.32ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 81.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.19ms. Allocated memory is still 117.4MB. Free memory was 81.7MB in the beginning and 80.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 79.9MB in the end (delta: 730.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 280.86ms. Allocated memory is still 117.4MB. Free memory was 79.9MB in the beginning and 69.7MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 330.56ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 57.1MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 7.23ms. Allocated memory is still 117.4MB. Free memory was 57.1MB in the beginning and 56.8MB in the end (delta: 309.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 10]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x1=12, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0] [L10] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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 could not prove your program: unable to determine feasibility of some traces [2024-11-13 23:34:08,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:34:11,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:34:11,130 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-13 23:34:11,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:34:11,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 23:34:11,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:34:11,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 23:34:11,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 23:34:11,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:34:11,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 23:34:11,202 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-13 23:34:11,202 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-13 23:34:11,202 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-13 23:34:11,202 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-13 23:34:11,202 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-13 23:34:11,203 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-13 23:34:11,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:34:11,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:34:11,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:34:11,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:34:11,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:34:11,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:34:11,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:34:11,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:34:11,206 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:34:11,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 23:34:11,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 23:34:11,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 23:34:11,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:34:11,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:34:11,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:34:11,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:34:11,209 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:34:11,209 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:34:11,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 23:34:11,209 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-13 23:34:11,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2024-11-13 23:34:11,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:34:11,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:34:11,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:34:11,542 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:34:11,543 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:34:11,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/float-benchs/zonotope_2.c Unable to find full path for "g++" [2024-11-13 23:34:13,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:34:13,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:34:13,956 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/sv-benchmarks/c/float-benchs/zonotope_2.c [2024-11-13 23:34:13,972 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data/cb73d5c81/cacb88409e7245b596c58d27b0b7fa34/FLAG28e1944e9 [2024-11-13 23:34:14,210 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/data/cb73d5c81/cacb88409e7245b596c58d27b0b7fa34 [2024-11-13 23:34:14,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:34:14,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:34:14,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:34:14,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:34:14,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:34:14,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d5602c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14, skipping insertion in model container [2024-11-13 23:34:14,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,245 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:34:14,420 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-13 23:34:14,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:34:14,473 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:34:14,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2024-11-13 23:34:14,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:34:14,519 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:34:14,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14 WrapperNode [2024-11-13 23:34:14,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:34:14,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:34:14,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:34:14,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:34:14,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,564 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2024-11-13 23:34:14,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:34:14,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:34:14,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:34:14,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:34:14,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:34:14,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:34:14,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:34:14,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:34:14,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (1/1) ... [2024-11-13 23:34:14,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 23:34:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:34:14,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-13 23:34:14,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-13 23:34:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:34:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:34:14,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:34:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:34:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-13 23:34:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-13 23:34:14,789 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:34:14,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:34:15,415 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-13 23:34:15,415 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:34:15,431 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:34:15,431 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 23:34:15,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:34:15 BoogieIcfgContainer [2024-11-13 23:34:15,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:34:15,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 23:34:15,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 23:34:15,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 23:34:15,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 11:34:14" (1/3) ... [2024-11-13 23:34:15,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea86956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:34:15, skipping insertion in model container [2024-11-13 23:34:15,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:34:14" (2/3) ... [2024-11-13 23:34:15,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea86956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 11:34:15, skipping insertion in model container [2024-11-13 23:34:15,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:34:15" (3/3) ... [2024-11-13 23:34:15,443 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2024-11-13 23:34:15,461 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 23:34:15,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG zonotope_2.c that has 2 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 23:34:15,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 23:34:15,527 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=FINITE_AUTOMATA, 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;@3028a67f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 23:34:15,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 23:34:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:34:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:34:15,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:15,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:34:15,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:34:15,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:15,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1808581016, now seen corresponding path program 1 times [2024-11-13 23:34:15,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:34:15,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717887559] [2024-11-13 23:34:15,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:15,551 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 [2024-11-13 23:34:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:34:15,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:34:15,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:34:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:15,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 23:34:15,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:34:15,730 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-13 23:34:15,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:34:15,731 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:34:15,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717887559] [2024-11-13 23:34:15,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717887559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:34:15,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:34:15,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 23:34:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780992257] [2024-11-13 23:34:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 23:34:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:34:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 23:34:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:34:15,760 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:17,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:19,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:20,018 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2024-11-13 23:34:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 23:34:20,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 23:34:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:20,028 INFO L225 Difference]: With dead ends: 36 [2024-11-13 23:34:20,028 INFO L226 Difference]: Without dead ends: 17 [2024-11-13 23:34:20,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 23:34:20,034 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:20,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2024-11-13 23:34:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-13 23:34:20,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2024-11-13 23:34:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-13 23:34:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2024-11-13 23:34:20,072 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2024-11-13 23:34:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:20,073 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2024-11-13 23:34:20,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2024-11-13 23:34:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-13 23:34:20,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:20,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:34:20,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-13 23:34:20,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:34:20,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:34:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1810308894, now seen corresponding path program 1 times [2024-11-13 23:34:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:34:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490053269] [2024-11-13 23:34:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:20,277 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 [2024-11-13 23:34:20,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:34:20,278 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:34:20,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:34:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:20,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 23:34:20,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:34:22,289 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-13 23:34:22,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 23:34:22,289 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:34:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490053269] [2024-11-13 23:34:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490053269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 23:34:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 23:34:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-13 23:34:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126596063] [2024-11-13 23:34:22,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:22,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 23:34:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:34:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 23:34:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:34:22,292 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:23,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:25,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:27,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:29,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:31,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:33,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:35,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:38,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:34:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:34:38,085 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-13 23:34:38,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 23:34:38,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-13 23:34:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:34:38,113 INFO L225 Difference]: With dead ends: 25 [2024-11-13 23:34:38,113 INFO L226 Difference]: Without dead ends: 23 [2024-11-13 23:34:38,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-13 23:34:38,115 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-13 23:34:38,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 31 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 6 Unknown, 0 Unchecked, 15.7s Time] [2024-11-13 23:34:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-13 23:34:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2024-11-13 23:34:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-13 23:34:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2024-11-13 23:34:38,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 7 [2024-11-13 23:34:38,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:34:38,126 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2024-11-13 23:34:38,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 23:34:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2024-11-13 23:34:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:34:38,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:34:38,127 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:34:38,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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)] Forceful destruction successful, exit code 0 [2024-11-13 23:34:38,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:34:38,328 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:34:38,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:34:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash 417096921, now seen corresponding path program 1 times [2024-11-13 23:34:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:34:38,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563172971] [2024-11-13 23:34:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:34:38,329 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 [2024-11-13 23:34:38,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:34:38,331 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:34:38,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:34:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:34:38,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 23:34:38,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:34:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:34:39,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:34:51,864 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-13 23:34:51,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:34:51,903 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:34:51,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563172971] [2024-11-13 23:34:51,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563172971] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 23:34:51,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 23:34:51,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2024-11-13 23:34:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902203599] [2024-11-13 23:34:51,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 23:34:51,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:34:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:34:51,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:34:51,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2024-11-13 23:34:51,909 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:34:53,949 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from false [2024-11-13 23:34:55,966 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from true [2024-11-13 23:34:58,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:00,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:02,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:04,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:06,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:35:06,640 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-13 23:35:06,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:35:06,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-13 23:35:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:35:06,666 INFO L225 Difference]: With dead ends: 29 [2024-11-13 23:35:06,666 INFO L226 Difference]: Without dead ends: 27 [2024-11-13 23:35:06,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=31, Invalid=84, Unknown=3, NotChecked=38, Total=156 [2024-11-13 23:35:06,667 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:35:06,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 5 Unknown, 29 Unchecked, 10.6s Time] [2024-11-13 23:35:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-13 23:35:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-13 23:35:06,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-13 23:35:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-11-13 23:35:06,676 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 12 [2024-11-13 23:35:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:35:06,677 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-11-13 23:35:06,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-13 23:35:06,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-11-13 23:35:06,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:35:06,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:35:06,680 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:35:06,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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)] Ended with exit code 0 [2024-11-13 23:35:06,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:35:06,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:35:06,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:35:06,882 INFO L85 PathProgramCache]: Analyzing trace with hash -287872743, now seen corresponding path program 1 times [2024-11-13 23:35:06,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:35:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957268391] [2024-11-13 23:35:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:35:06,882 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 [2024-11-13 23:35:06,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:35:06,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:35:06,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 (5)] Waiting until timeout for monitored process [2024-11-13 23:35:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:35:07,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:35:07,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:35:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:07,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:35:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:07,458 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:35:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957268391] [2024-11-13 23:35:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957268391] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:35:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1093057889] [2024-11-13 23:35:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:35:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:35:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:35:07,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:35:07,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-13 23:35:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:35:07,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:35:07,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:35:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:07,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:35:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1093057889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:35:08,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330153797] [2024-11-13 23:35:08,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:35:08,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:35:08,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:35:08,069 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:35:08,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 23:35:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:35:08,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 23:35:08,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:35:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:08,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:35:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330153797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:35:08,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-13 23:35:08,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2024-11-13 23:35:08,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024736596] [2024-11-13 23:35:08,427 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-13 23:35:08,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 23:35:08,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:35:08,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 23:35:08,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-13 23:35:08,429 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 23:35:10,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:12,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:14,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:16,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:18,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:20,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:22,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:24,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:26,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:28,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:30,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:33,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:35,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:37,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:35:37,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:35:37,101 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2024-11-13 23:35:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 23:35:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2024-11-13 23:35:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:35:37,127 INFO L225 Difference]: With dead ends: 41 [2024-11-13 23:35:37,127 INFO L226 Difference]: Without dead ends: 34 [2024-11-13 23:35:37,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-13 23:35:37,128 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.6s IncrementalHoareTripleChecker+Time [2024-11-13 23:35:37,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 40 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 28.6s Time] [2024-11-13 23:35:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-13 23:35:37,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-13 23:35:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:35:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-13 23:35:37,143 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2024-11-13 23:35:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:35:37,143 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-13 23:35:37,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-13 23:35:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-13 23:35:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-13 23:35:37,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:35:37,144 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 23:35:37,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 23:35:37,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 (5)] Ended with exit code 0 [2024-11-13 23:35:37,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-13 23:35:37,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt [2024-11-13 23:35:37,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:35:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:35:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -286144865, now seen corresponding path program 1 times [2024-11-13 23:35:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:35:37,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805921404] [2024-11-13 23:35:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:35:37,747 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 [2024-11-13 23:35:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:35:37,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:35:37,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 (8)] Waiting until timeout for monitored process [2024-11-13 23:35:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:35:38,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:35:38,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:35:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:35:43,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:35:54,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2024-11-13 23:35:56,321 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2024-11-13 23:36:30,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-13 23:36:32,671 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-13 23:36:32,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-13 23:36:32,741 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:36:32,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805921404] [2024-11-13 23:36:32,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805921404] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:36:32,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1548671840] [2024-11-13 23:36:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:36:32,742 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:36:32,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:36:32,744 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:36:32,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-13 23:36:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:36:33,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:36:33,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:36:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:36:33,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:37:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-13 23:37:14,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1548671840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:37:14,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301522810] [2024-11-13 23:37:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 23:37:14,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:37:14,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:37:14,288 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:37:14,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 23:37:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:37:30,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 23:37:30,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:37:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:37:31,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:38:08,119 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))))) is different from true [2024-11-13 23:38:33,715 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from true [2024-11-13 23:39:07,808 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (let ((.cse3 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2)))))))) is different from true [2024-11-13 23:39:34,100 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from true [2024-11-13 23:41:44,904 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))))) is different from true [2024-11-13 23:43:49,919 WARN L851 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))))) is different from false [2024-11-13 23:43:52,013 WARN L873 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))))) is different from true [2024-11-13 23:44:15,358 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from false [2024-11-13 23:44:17,408 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from true [2024-11-13 23:44:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2024-11-13 23:44:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301522810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:44:17,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-13 23:44:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 13] total 22 [2024-11-13 23:44:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699990099] [2024-11-13 23:44:17,474 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-13 23:44:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 23:44:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-13 23:44:17,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 23:44:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=125, Unknown=15, NotChecked=270, Total=462 [2024-11-13 23:44:17,477 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 23:44:19,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:21,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:23,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2024-11-13 23:44:26,001 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2024-11-13 23:44:28,879 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse5 (fp.leq .cse4 .cse6))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) .cse5 (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse6)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse6)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) .cse5))))) is different from true [2024-11-13 23:44:31,095 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse1 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse3 .cse2)) (fp.geq .cse3 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (or .cse0 (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse1) (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 23:44:33,299 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (not (fp.leq .cse2 .cse1)) (fp.geq .cse2 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse1) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse1))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse4)) .cse1) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) .cse1)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse0) .cse0 (or .cse0 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse4) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse4)) .cse1)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 23:44:36,183 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.geq .cse7 (_ +zero 8 24))) (.cse6 (fp.leq .cse7 .cse5))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) .cse4 (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse5)) (and .cse4 .cse6) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) .cse6 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2024-11-13 23:44:38,933 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-13 23:44:41,417 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse1 (not (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 .cse1 (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse3 .cse2)) (fp.geq .cse3 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse5)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (or .cse0 (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse1) (or .cse1 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse5) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse5)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) .cse1 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (= (_ bv1 32) c___VERIFIER_assert_~cond) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-13 23:44:43,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:45,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:47,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:49,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:51,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:53,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:55,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:57,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:44:59,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:01,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:03,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:05,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:07,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:09,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:11,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:13,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:15,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:17,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:19,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:21,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:23,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:25,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 23:45:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 23:45:26,146 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-13 23:45:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-13 23:45:26,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 19 [2024-11-13 23:45:26,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 23:45:26,152 INFO L225 Difference]: With dead ends: 38 [2024-11-13 23:45:26,152 INFO L226 Difference]: Without dead ends: 36 [2024-11-13 23:45:26,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 55.8s TimeCoverageRelationStatistics Valid=72, Invalid=151, Unknown=23, NotChecked=624, Total=870 [2024-11-13 23:45:26,158 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 49.2s IncrementalHoareTripleChecker+Time [2024-11-13 23:45:26,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 41 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 24 Unknown, 410 Unchecked, 49.2s Time] [2024-11-13 23:45:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-13 23:45:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-13 23:45:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-13 23:45:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-13 23:45:26,172 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 19 [2024-11-13 23:45:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 23:45:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-13 23:45:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-13 23:45:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-13 23:45:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-13 23:45:26,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 23:45:26,174 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-13 23:45:26,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-13 23:45:26,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 23:45:26,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 (8)] Ended with exit code 0 [2024-11-13 23:45:26,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 [2024-11-13 23:45:26,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 23:45:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:45:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1048361480, now seen corresponding path program 2 times [2024-11-13 23:45:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-13 23:45:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148011107] [2024-11-13 23:45:26,776 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:45:26,776 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 [2024-11-13 23:45:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-13 23:45:26,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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) [2024-11-13 23:45:26,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/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 (11)] Waiting until timeout for monitored process [2024-11-13 23:45:27,176 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 23:45:27,176 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:45:27,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:45:27,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:45:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:45:34,658 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:45:45,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-13 23:45:47,794 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-13 23:46:22,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2024-11-13 23:46:25,053 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2024-11-13 23:46:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2024-11-13 23:46:25,135 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-13 23:46:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148011107] [2024-11-13 23:46:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148011107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:46:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1320709513] [2024-11-13 23:46:25,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:46:25,135 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:46:25,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 [2024-11-13 23:46:25,137 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:46:25,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-13 23:46:25,949 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 23:46:25,949 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:46:25,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:46:25,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:46:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 23:46:27,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 23:47:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2024-11-13 23:47:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1320709513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 23:47:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010865851] [2024-11-13 23:47:07,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 23:47:07,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 23:47:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-13 23:47:07,733 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 23:47:07,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4803d260-6a12-419e-bfd5-341c7ec24cd5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 23:47:35,158 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 23:47:35,158 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 23:47:35,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 23:47:35,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:47:49,988 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) .cse2) (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 16.0) .cse2)))) (and (= (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_45| .cse2)) |c_ULTIMATE.start_main_~x1~0#1|) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse2))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_45| ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 23:48:07,254 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) .cse2) (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 16.0) .cse2))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_45| .cse2)) .cse3) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse2))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_45| .cse3) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-13 23:48:47,251 WARN L851 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (and (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) .cse1) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 16.0) .cse1)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse1)) (.cse3 (fp.div roundNearestTiesToEven .cse5 .cse1)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24))) (and (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~y1~0#1_45| .cse1)) .cse2) (not (fp.geq (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24)))) (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24))) (and (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~y1~0#1_45| .cse1)) .cse2) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_45| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24)))))))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from false [2024-11-13 23:49:20,101 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) .cse1) (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 16.0) .cse1)))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse1)) (.cse3 (fp.div roundNearestTiesToEven .cse5 .cse1)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24))) (and (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~y1~0#1_45| .cse1)) .cse2) (not (fp.geq (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24)))) (exists ((|v_ULTIMATE.start_main_~y1~0#1_45| (_ FloatingPoint 8 24))) (and (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~y1~0#1_45| .cse1)) .cse2) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_45| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |v_ULTIMATE.start_main_~y1~0#1_45|) .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_45| (_ +zero 8 24))))))))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) is different from false