./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh --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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:21:34,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:21:34,217 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 15:21:34,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:21:34,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:21:34,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:21:34,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:21:34,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:21:34,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:21:34,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:21:34,244 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:21:34,244 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:21:34,245 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:21:34,245 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:21:34,246 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:21:34,246 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:21:34,247 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:21:34,247 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:21:34,248 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:21:34,248 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:21:34,249 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:21:34,249 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:21:34,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:21:34,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:21:34,251 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:21:34,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:21:34,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:21:34,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:21:34,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:21:34,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:21:34,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:21:34,253 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:21:34,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:21:34,254 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:21:34,254 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:21:34,254 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:21:34,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:21:34,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:34,255 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:21:34,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:21:34,255 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:21:34,255 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:21:34,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:21:34,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:21:34,256 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:21:34,256 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:21:34,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:21:34,256 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2023-12-02 15:21:34,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:21:34,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:21:34,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:21:34,479 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:21:34,480 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:21:34,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2023-12-02 15:21:37,181 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:21:37,356 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:21:37,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2023-12-02 15:21:37,363 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data/512fdccbd/6f6f3a2c3d1342698c2291bd73627561/FLAG91e0bcc52 [2023-12-02 15:21:37,376 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data/512fdccbd/6f6f3a2c3d1342698c2291bd73627561 [2023-12-02 15:21:37,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:21:37,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:21:37,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:37,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:21:37,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:21:37,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c829ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37, skipping insertion in model container [2023-12-02 15:21:37,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,409 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:37,550 WARN L240 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_12c91b6f-39bb-452b-8b35-86ac9bd9897f/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2023-12-02 15:21:37,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:37,570 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:21:37,593 WARN L240 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_12c91b6f-39bb-452b-8b35-86ac9bd9897f/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2023-12-02 15:21:37,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:37,612 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:21:37,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37 WrapperNode [2023-12-02 15:21:37,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:37,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:37,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:21:37,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:21:37,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,628 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,655 INFO L138 Inliner]: procedures = 18, calls = 78, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 201 [2023-12-02 15:21:37,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:37,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:21:37,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:21:37,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:21:37,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:21:37,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:21:37,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:21:37,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:21:37,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (1/1) ... [2023-12-02 15:21:37,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:37,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:37,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:21:37,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:21:37,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:21:37,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 15:21:37,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:21:37,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 15:21:37,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:21:37,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:21:37,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 15:21:37,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:21:37,815 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:21:37,817 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:21:37,987 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:21:38,014 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:21:38,014 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:21:38,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:38 BoogieIcfgContainer [2023-12-02 15:21:38,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:21:38,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:21:38,019 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:21:38,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:21:38,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:21:37" (1/3) ... [2023-12-02 15:21:38,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504c88d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:38, skipping insertion in model container [2023-12-02 15:21:38,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:37" (2/3) ... [2023-12-02 15:21:38,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504c88d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:38, skipping insertion in model container [2023-12-02 15:21:38,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:38" (3/3) ... [2023-12-02 15:21:38,025 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2023-12-02 15:21:38,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:21:38,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:21:38,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:21:38,085 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@141c6452, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:21:38,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:21:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:21:38,094 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:38,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:38,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:38,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2023-12-02 15:21:38,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:38,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862922556] [2023-12-02 15:21:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:38,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:38,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 15:21:38,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862922556] [2023-12-02 15:21:38,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862922556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:38,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:38,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 15:21:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762000349] [2023-12-02 15:21:38,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:38,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:21:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 15:21:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:21:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:38,438 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:38,523 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2023-12-02 15:21:38,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:21:38,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:21:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:38,533 INFO L225 Difference]: With dead ends: 32 [2023-12-02 15:21:38,533 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 15:21:38,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:21:38,539 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:38,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 87 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 15:21:38,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 15:21:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 15:21:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-02 15:21:38,571 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2023-12-02 15:21:38,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:38,571 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-02 15:21:38,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-02 15:21:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:21:38,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:38,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:38,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 15:21:38,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:38,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:38,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2023-12-02 15:21:38,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 15:21:38,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081180890] [2023-12-02 15:21:38,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 15:21:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:21:38,602 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 15:21:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 15:21:38,637 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 15:21:38,638 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 15:21:38,639 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 15:21:38,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 15:21:38,644 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-02 15:21:38,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 15:21:38,665 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-12-02 15:21:38,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-12-02 15:21:38,666 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-12-02 15:21:38,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:21:38 BoogieIcfgContainer [2023-12-02 15:21:38,677 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 15:21:38,678 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 15:21:38,678 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 15:21:38,678 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 15:21:38,678 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:38" (3/4) ... [2023-12-02 15:21:38,680 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 15:21:38,681 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 15:21:38,682 INFO L158 Benchmark]: Toolchain (without parser) took 1302.63ms. Allocated memory is still 190.8MB. Free memory was 147.1MB in the beginning and 140.5MB in the end (delta: 6.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2023-12-02 15:21:38,682 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:21:38,683 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.65ms. Allocated memory is still 190.8MB. Free memory was 146.5MB in the beginning and 134.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 15:21:38,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.53ms. Allocated memory is still 190.8MB. Free memory was 134.8MB in the beginning and 133.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:21:38,684 INFO L158 Benchmark]: Boogie Preprocessor took 30.90ms. Allocated memory is still 190.8MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 15:21:38,685 INFO L158 Benchmark]: RCFGBuilder took 328.11ms. Allocated memory is still 190.8MB. Free memory was 131.2MB in the beginning and 116.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 15:21:38,685 INFO L158 Benchmark]: TraceAbstraction took 658.23ms. Allocated memory is still 190.8MB. Free memory was 115.9MB in the beginning and 140.5MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:21:38,686 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 190.8MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:21:38,688 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.14ms. Allocated memory is still 102.8MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.65ms. Allocated memory is still 190.8MB. Free memory was 146.5MB in the beginning and 134.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.53ms. Allocated memory is still 190.8MB. Free memory was 134.8MB in the beginning and 133.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.90ms. Allocated memory is still 190.8MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.11ms. Allocated memory is still 190.8MB. Free memory was 131.2MB in the beginning and 116.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 658.23ms. Allocated memory is still 190.8MB. Free memory was 115.9MB in the beginning and 140.5MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 190.8MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 53]: 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 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_136; [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_136=0, __return_main=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_136=0, __return_main=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L32] COND TRUE main__i < 5UL [L34] EXPR main__max[main__i] VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L34] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_136=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_136=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_136=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] [L53] reach_error() VAL [__VERIFIER_assert__cond=0, __return_136=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}, main__org={6:0}, main__slope={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 [2023-12-02 15:21:38,707 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh --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 b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:21:40,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:21:40,655 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 15:21:40,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:21:40,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:21:40,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:21:40,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:21:40,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:21:40,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:21:40,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:21:40,693 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:21:40,694 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:21:40,694 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:21:40,695 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:21:40,695 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:21:40,696 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:21:40,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:21:40,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 15:21:40,698 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:21:40,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:21:40,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:21:40,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 15:21:40,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:21:40,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 15:21:40,700 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:21:40,701 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:21:40,701 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:21:40,702 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:21:40,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 15:21:40,702 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:21:40,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:21:40,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:21:40,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:21:40,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:21:40,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:40,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:21:40,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:21:40,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 15:21:40,705 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:21:40,705 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:21:40,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:21:40,706 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 15:21:40,706 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:21:40,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:21:40,707 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh 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 -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2023-12-02 15:21:40,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:21:41,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:21:41,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:21:41,018 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:21:41,018 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:21:41,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2023-12-02 15:21:43,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:21:43,965 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:21:43,965 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2023-12-02 15:21:43,973 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data/6d7f11f44/bb660b1172d644a18c25ddd72b7fdbe6/FLAGf95c74676 [2023-12-02 15:21:43,988 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/data/6d7f11f44/bb660b1172d644a18c25ddd72b7fdbe6 [2023-12-02 15:21:43,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:21:43,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:21:43,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:43,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:21:43,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:21:43,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:43" (1/1) ... [2023-12-02 15:21:44,000 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321fccb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:43, skipping insertion in model container [2023-12-02 15:21:44,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:21:43" (1/1) ... [2023-12-02 15:21:44,024 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:21:44,199 WARN L240 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_12c91b6f-39bb-452b-8b35-86ac9bd9897f/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2023-12-02 15:21:44,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:44,224 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:21:44,251 WARN L240 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_12c91b6f-39bb-452b-8b35-86ac9bd9897f/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2023-12-02 15:21:44,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:21:44,275 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:21:44,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44 WrapperNode [2023-12-02 15:21:44,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:21:44,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:44,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:21:44,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:21:44,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,323 INFO L138 Inliner]: procedures = 19, calls = 78, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 202 [2023-12-02 15:21:44,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:21:44,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:21:44,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:21:44,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:21:44,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,339 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,340 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,351 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:21:44,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:21:44,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:21:44,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:21:44,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (1/1) ... [2023-12-02 15:21:44,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:21:44,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:21:44,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:21:44,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:21:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:21:44,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-12-02 15:21:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:21:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:21:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-12-02 15:21:44,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:21:44,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:21:44,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:21:44,515 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:21:44,518 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:21:47,288 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:21:47,328 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:21:47,328 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 15:21:47,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:47 BoogieIcfgContainer [2023-12-02 15:21:47,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:21:47,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:21:47,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:21:47,334 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:21:47,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:21:43" (1/3) ... [2023-12-02 15:21:47,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae0d9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:47, skipping insertion in model container [2023-12-02 15:21:47,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:21:44" (2/3) ... [2023-12-02 15:21:47,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae0d9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:21:47, skipping insertion in model container [2023-12-02 15:21:47,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:21:47" (3/3) ... [2023-12-02 15:21:47,337 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2023-12-02 15:21:47,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:21:47,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 15:21:47,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:21:47,396 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@63b47cf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:21:47,396 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 15:21:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:21:47,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:47,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:47,406 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:47,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:47,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1054039300, now seen corresponding path program 1 times [2023-12-02 15:21:47,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:47,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305548218] [2023-12-02 15:21:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:47,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:21:47,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:47,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:21:47,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-02 15:21:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:47,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:21:47,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:21:47,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:21:47,917 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:21:47,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305548218] [2023-12-02 15:21:47,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305548218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:21:47,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:21:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:21:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886323588] [2023-12-02 15:21:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:21:47,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:21:47,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:21:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:21:47,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:21:47,949 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:50,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:21:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:21:50,422 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2023-12-02 15:21:50,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:21:50,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:21:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:21:50,431 INFO L225 Difference]: With dead ends: 30 [2023-12-02 15:21:50,432 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 15:21:50,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:21:50,437 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:21:50,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2023-12-02 15:21:50,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 15:21:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 15:21:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-02 15:21:50,466 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2023-12-02 15:21:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:21:50,467 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-02 15:21:50,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:21:50,467 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-02 15:21:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:21:50,468 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:21:50,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:21:50,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-02 15:21:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:21:50,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:21:50,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:21:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1037028639, now seen corresponding path program 1 times [2023-12-02 15:21:50,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:21:50,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51213290] [2023-12-02 15:21:50,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:21:50,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:21:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:21:50,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:21:50,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-02 15:21:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:21:51,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 15:21:51,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:21:58,675 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-02 15:21:58,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2023-12-02 15:22:20,156 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse2) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1)))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 15:22:53,382 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from false [2023-12-02 15:22:55,411 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse0) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse3 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)))))) is different from true [2023-12-02 15:24:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:24:27,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:24:27,644 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:24:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51213290] [2023-12-02 15:24:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51213290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:24:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:24:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 15:24:27,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041650763] [2023-12-02 15:24:27,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:24:27,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 15:24:27,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:24:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 15:24:27,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=39, Unknown=3, NotChecked=26, Total=90 [2023-12-02 15:24:27,648 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:24:30,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:32,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:34,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:36,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:38,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse16 (select .cse6 (_ bv0 32)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse1 (let ((.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse12 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse2) (= .cse4 (let ((.cse5 (select .cse6 (_ bv16 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= .cse4 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse11 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= .cse7 .cse8) (= .cse0 .cse9) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse9) (= .cse3 .cse10) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse11 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse9)) (fp.sub c_currentRoundingMode .cse10 .cse9)))) (= .cse11 .cse12) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse10)))) (= (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) .cse12) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse7 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-02 15:24:41,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:43,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:45,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:47,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:49,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:51,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:24:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:24:51,774 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-12-02 15:24:51,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 15:24:51,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:24:51,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:24:51,776 INFO L225 Difference]: With dead ends: 34 [2023-12-02 15:24:51,776 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 15:24:51,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=24, Invalid=40, Unknown=4, NotChecked=42, Total=110 [2023-12-02 15:24:51,778 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:24:51,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 66 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 10 Unknown, 100 Unchecked, 21.9s Time] [2023-12-02 15:24:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 15:24:51,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2023-12-02 15:24:51,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:24:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-02 15:24:51,782 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2023-12-02 15:24:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:24:51,783 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-02 15:24:51,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:24:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-02 15:24:51,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 15:24:51,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:24:51,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:24:51,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-02 15:24:51,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:24:51,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:24:51,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:24:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1695003617, now seen corresponding path program 1 times [2023-12-02 15:24:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:24:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183709055] [2023-12-02 15:24:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:24:51,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:24:51,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:24:51,987 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:24:51,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-02 15:24:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:24:53,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 15:24:53,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:25:00,440 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-02 15:25:00,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2023-12-02 15:25:22,660 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse3) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 15:25:50,159 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse1) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse3) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 15:26:27,116 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from false [2023-12-02 15:26:29,146 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (and (fp.geq .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse2) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse4))))) is different from true [2023-12-02 15:28:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:28:17,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:28:17,304 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:28:17,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183709055] [2023-12-02 15:28:17,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183709055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:28:17,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:28:17,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 15:28:17,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411739212] [2023-12-02 15:28:17,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:28:17,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 15:28:17,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:28:17,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 15:28:17,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=40, Unknown=4, NotChecked=42, Total=110 [2023-12-02 15:28:17,307 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:28:19,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:21,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:23,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:25,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:28,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse16 (select .cse6 (_ bv0 32)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse1 (let ((.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (.cse12 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (and (= .cse0 .cse1) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse2) (= .cse4 (let ((.cse5 (select .cse6 (_ bv16 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse1) (exists ((v_arrayElimCell_8 (_ BitVec 32))) (= .cse4 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8)))) (exists ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse9 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse11 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (and (= .cse7 .cse8) (= (fp.add c_currentRoundingMode .cse9 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse10)) (fp.sub c_currentRoundingMode .cse11 .cse10))) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse11) (= .cse12 .cse9) (= .cse3 .cse11) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse10) (= .cse10 .cse0)))) (= (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) .cse7) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= .cse12 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-02 15:28:30,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:32,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:34,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:36,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:38,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:40,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:28:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:28:41,332 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-02 15:28:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:28:41,333 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-02 15:28:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:28:41,334 INFO L225 Difference]: With dead ends: 29 [2023-12-02 15:28:41,334 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 15:28:41,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=26, Invalid=41, Unknown=5, NotChecked=60, Total=132 [2023-12-02 15:28:41,335 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 21.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:28:41,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 25 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 125 Unchecked, 21.8s Time] [2023-12-02 15:28:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 15:28:41,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 15:28:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:28:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-02 15:28:41,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-12-02 15:28:41,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:28:41,340 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-02 15:28:41,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:28:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-02 15:28:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 15:28:41,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:28:41,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:28:41,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:28:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:28:41,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:28:41,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:28:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2047020067, now seen corresponding path program 1 times [2023-12-02 15:28:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:28:41,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055548704] [2023-12-02 15:28:41,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:28:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:28:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:28:41,544 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:28:41,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:28:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:28:42,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 15:28:42,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:28:54,374 WARN L293 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 37 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 15:28:54,375 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-02 15:28:54,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 313 treesize of output 169 [2023-12-02 15:29:25,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse3 .cse4) (= (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0))) |c_ULTIMATE.start_main_~main__z~0#1|) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse5) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= .cse1 .cse6) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6))))) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) .cse3)) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-02 15:30:02,685 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse1 .cse5) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5))))) is different from false [2023-12-02 15:30:04,709 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub roundNearestTiesToEven .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse4) (= .cse1 .cse5) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse3) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5))))) is different from true [2023-12-02 15:31:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:31:50,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:31:50,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:31:50,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055548704] [2023-12-02 15:31:50,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2055548704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:31:50,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:31:50,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 15:31:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256792224] [2023-12-02 15:31:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:31:50,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:31:50,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:31:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:31:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=66, Unknown=3, NotChecked=34, Total=132 [2023-12-02 15:31:50,444 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:31:53,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:31:55,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:31:57,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:31:59,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:01,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:03,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:05,577 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse15 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse14 (let ((.cse20 (select .cse17 (_ bv0 32)))) (fp ((_ extract 31 31) .cse20) ((_ extract 30 23) .cse20) ((_ extract 22 0) .cse20)))) (.cse11 (let ((.cse19 (select .cse17 (_ bv4 32)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19)))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (and (= .cse0 (let ((.cse1 (select .cse2 (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_16 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_17 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_17) ((_ extract 30 23) v_arrayElimCell_17) ((_ extract 22 0) v_arrayElimCell_17))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse7 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse10 (fp ((_ extract 31 31) v_arrayElimCell_16) ((_ extract 30 23) v_arrayElimCell_16) ((_ extract 22 0) v_arrayElimCell_16)))) (and (= .cse3 .cse4) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= .cse0 .cse6) (= (fp.add c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse5 .cse3))) |c_ULTIMATE.start_main_~main__z~0#1|) (= .cse8 .cse7) (= .cse5 .cse9) (= .cse4 .cse10) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse10))))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse11) (= .cse0 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (_ bv4 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (= .cse8 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (_ bv4 32)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (exists ((v_arrayElimCell_13 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)) .cse0)) (= .cse4 .cse14) (= .cse15 (let ((.cse16 (select .cse17 (_ bv16 32)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= .cse15 (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)))) (= (let ((.cse18 (select .cse2 (_ bv4 32)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18))) .cse4) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse14)) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse11 .cse9)))) is different from false [2023-12-02 15:32:08,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:10,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:12,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:14,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:16,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:18,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:20,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:32:23,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:32:23,365 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2023-12-02 15:32:23,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:32:23,367 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-02 15:32:23,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:32:23,368 INFO L225 Difference]: With dead ends: 34 [2023-12-02 15:32:23,368 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 15:32:23,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=31, Invalid=67, Unknown=4, NotChecked=54, Total=156 [2023-12-02 15:32:23,370 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:32:23,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 78 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 14 Unknown, 108 Unchecked, 30.7s Time] [2023-12-02 15:32:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 15:32:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2023-12-02 15:32:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-02 15:32:23,375 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2023-12-02 15:32:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:32:23,376 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-02 15:32:23,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:32:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-02 15:32:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 15:32:23,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:32:23,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:32:23,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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 [2023-12-02 15:32:23,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:23,578 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:32:23,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:32:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash 450040421, now seen corresponding path program 1 times [2023-12-02 15:32:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:32:23,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327778794] [2023-12-02 15:32:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:32:23,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:32:23,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:32:23,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:32:23,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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)] Waiting until timeout for monitored process [2023-12-02 15:32:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:32:24,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 15:32:24,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:32:33,224 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-02 15:32:33,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 313 treesize of output 169 [2023-12-02 15:33:02,434 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20)) .cse0)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22)))) (exists ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))) (and (= .cse1 .cse2) (= .cse3 .cse0) (= .cse1 .cse4) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse6) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse5 .cse2)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-02 15:33:37,333 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20)) .cse0)) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22)))) (exists ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse6 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))) (and (= .cse1 .cse2) (= .cse3 .cse0) (= .cse1 .cse4) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse6) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse6 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse5 .cse2)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-12-02 15:33:59,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 15:33:59,759 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:33:59,759 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:33:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327778794] [2023-12-02 15:33:59,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327778794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:33:59,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:33:59,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-02 15:33:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231723515] [2023-12-02 15:33:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:33:59,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 15:33:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:33:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 15:33:59,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=67, Unknown=2, NotChecked=34, Total=132 [2023-12-02 15:33:59,761 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:02,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:34:04,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:34:07,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (.cse8 (let ((.cse20 (select .cse11 (_ bv0 32)))) (fp ((_ extract 31 31) .cse20) ((_ extract 30 23) .cse20) ((_ extract 22 0) .cse20)))) (.cse3 (let ((.cse19 (select .cse11 (_ bv4 32)))) (fp ((_ extract 31 31) .cse19) ((_ extract 30 23) .cse19) ((_ extract 22 0) .cse19)))) (.cse16 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32)))) (and (= .cse0 (let ((.cse1 (select .cse2 (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (exists ((v_arrayElimCell_20 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20)) .cse0)) (= .cse0 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (_ bv4 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= .cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (_ bv4 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= .cse7 .cse8) (= .cse9 (let ((.cse10 (select .cse11 (_ bv16 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (exists ((v_arrayElimCell_22 (_ BitVec 32))) (= .cse9 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22)))) (exists ((v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_18 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse13 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse17 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse15 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse12 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse14 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23)))) (and (= .cse7 .cse12) (= .cse13 .cse0) (= .cse7 .cse14) (= .cse15 .cse16) (= .cse5 .cse17) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse15) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse13 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse17 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse12)) (fp.sub c_currentRoundingMode .cse15 .cse12)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse14))))) (= (let ((.cse18 (select .cse2 (_ bv4 32)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18))) .cse7) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse8)) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse3 .cse16)))) is different from false [2023-12-02 15:34:09,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:34:11,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:34:13,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 15:34:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:34:14,613 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-12-02 15:34:14,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 15:34:14,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 15:34:14,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:34:14,615 INFO L225 Difference]: With dead ends: 29 [2023-12-02 15:34:14,615 INFO L226 Difference]: Without dead ends: 21 [2023-12-02 15:34:14,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=31, Invalid=68, Unknown=3, NotChecked=54, Total=156 [2023-12-02 15:34:14,617 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:34:14,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 33 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 5 Unknown, 61 Unchecked, 12.7s Time] [2023-12-02 15:34:14,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-02 15:34:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-02 15:34:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:14,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-02 15:34:14,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2023-12-02 15:34:14,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:34:14,620 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-02 15:34:14,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:34:14,621 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-02 15:34:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 15:34:14,621 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:34:14,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:34:14,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:34:14,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:34:14,822 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 15:34:14,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:34:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 498249154, now seen corresponding path program 1 times [2023-12-02 15:34:14,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:34:14,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877333548] [2023-12-02 15:34:14,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:34:14,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:34:14,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:34:14,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-02 15:34:14,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_12c91b6f-39bb-452b-8b35-86ac9bd9897f/bin/utaipan-verify-nQ1chXbOIh/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 (7)] Waiting until timeout for monitored process [2023-12-02 15:34:15,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:34:15,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-02 15:34:15,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:34:32,272 WARN L293 SmtUtils]: Spent 9.08s on a formula simplification. DAG size of input: 37 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 15:34:32,273 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-02 15:34:32,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 336 treesize of output 180 [2023-12-02 15:35:06,390 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_28 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_28) ((_ extract 30 23) v_arrayElimCell_28) ((_ extract 22 0) v_arrayElimCell_28)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv30 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv40 32)) .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967286 32)) .cse5) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_31) ((_ extract 30 23) v_arrayElimCell_31) ((_ extract 22 0) v_arrayElimCell_31)))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 15:35:08,419 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_28 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_28) ((_ extract 30 23) v_arrayElimCell_28) ((_ extract 22 0) v_arrayElimCell_28)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv30 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv40 32)) .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967286 32)) .cse5) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse3 .cse0)))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3)))) (exists ((v_arrayElimCell_31 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (fp ((_ extract 31 31) v_arrayElimCell_31) ((_ extract 30 23) v_arrayElimCell_31) ((_ extract 22 0) v_arrayElimCell_31)))) (exists ((v_arrayElimCell_26 (_ BitVec 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) (fp ((_ extract 31 31) v_arrayElimCell_26) ((_ extract 30 23) v_arrayElimCell_26) ((_ extract 22 0) v_arrayElimCell_26)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-12-02 15:35:46,070 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967286 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse4) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse4 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv40 32)) .cse5) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4)))) is different from false [2023-12-02 15:35:48,104 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_27 (_ BitVec 32)) (v_arrayElimCell_32 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_29) ((_ extract 30 23) v_arrayElimCell_29) ((_ extract 22 0) v_arrayElimCell_29))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_30) ((_ extract 30 23) v_arrayElimCell_30) ((_ extract 22 0) v_arrayElimCell_30))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_27) ((_ extract 30 23) v_arrayElimCell_27) ((_ extract 22 0) v_arrayElimCell_27))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25)))) (and (= .cse0 .cse1) (= .cse2 .cse1) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967286 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv30 32)) .cse4) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse4 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv40 32)) .cse5) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4)))) is different from true