./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:17:34,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:17:34,184 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 08:17:34,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:17:34,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:17:34,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:17:34,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:17:34,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:17:34,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:17:34,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:17:34,220 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:17:34,220 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:17:34,221 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:17:34,221 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 08:17:34,222 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:17:34,222 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:17:34,223 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 08:17:34,223 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 08:17:34,224 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:17:34,225 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 08:17:34,225 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 08:17:34,228 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 08:17:34,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:17:34,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:17:34,230 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:17:34,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 08:17:34,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:17:34,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:17:34,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:17:34,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:17:34,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:17:34,232 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:17:34,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:17:34,233 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:17:34,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:17:34,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:17:34,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:17:34,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:17:34,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:17:34,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:17:34,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:17:34,235 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 08:17:34,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 08:17:34,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:17:34,235 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:17:34,236 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:17:34,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:17:34,236 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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2023-12-02 08:17:34,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:17:34,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:17:34,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:17:34,473 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:17:34,474 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:17:34,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2023-12-02 08:17:37,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:17:37,540 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:17:37,541 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2023-12-02 08:17:37,549 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data/1f5e73880/7bb21335f4c140a69b9e97d003a2bbbc/FLAGaf66f281e [2023-12-02 08:17:37,563 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data/1f5e73880/7bb21335f4c140a69b9e97d003a2bbbc [2023-12-02 08:17:37,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:17:37,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:17:37,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:17:37,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:17:37,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:17:37,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354d4f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37, skipping insertion in model container [2023-12-02 08:17:37,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,602 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:17:37,777 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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2023-12-02 08:17:37,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:17:37,798 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:17:37,825 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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2023-12-02 08:17:37,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:17:37,847 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:17:37,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37 WrapperNode [2023-12-02 08:17:37,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:17:37,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:17:37,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:17:37,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:17:37,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,897 INFO L138 Inliner]: procedures = 18, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 150 [2023-12-02 08:17:37,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:17:37,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:17:37,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:17:37,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:17:37,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:17:37,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:17:37,927 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:17:37,927 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:17:37,928 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (1/1) ... [2023-12-02 08:17:37,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:17:37,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:17:37,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:17:37,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:17:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:17:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 08:17:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:17:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-12-02 08:17:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:17:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:17:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-12-02 08:17:37,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:17:38,072 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:17:38,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:17:38,243 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:17:38,274 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:17:38,274 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 08:17:38,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:38 BoogieIcfgContainer [2023-12-02 08:17:38,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:17:38,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:17:38,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:17:38,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:17:38,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:17:37" (1/3) ... [2023-12-02 08:17:38,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667422cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:17:38, skipping insertion in model container [2023-12-02 08:17:38,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:37" (2/3) ... [2023-12-02 08:17:38,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@667422cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:17:38, skipping insertion in model container [2023-12-02 08:17:38,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:38" (3/3) ... [2023-12-02 08:17:38,287 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2023-12-02 08:17:38,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:17:38,305 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:17:38,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:17:38,356 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;@3443e6d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:17:38,356 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:17:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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 08:17:38,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:17:38,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:17:38,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:17:38,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:17:38,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:17:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1392335393, now seen corresponding path program 1 times [2023-12-02 08:17:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:17:38,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640426846] [2023-12-02 08:17:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:17:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:17:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:17:38,672 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 08:17:38,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:17:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640426846] [2023-12-02 08:17:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640426846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:17:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:17:38,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 08:17:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943414111] [2023-12-02 08:17:38,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:17:38,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 08:17:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:17:38,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 08:17:38,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 08:17:38,714 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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.2) internal successors, (11), 5 states have internal predecessors, (11), 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 08:17:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:17:38,807 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2023-12-02 08:17:38,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 08:17:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2023-12-02 08:17:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:17:38,817 INFO L225 Difference]: With dead ends: 24 [2023-12-02 08:17:38,817 INFO L226 Difference]: Without dead ends: 14 [2023-12-02 08:17:38,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:17:38,824 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:17:38,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:17:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-02 08:17:38,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-02 08:17:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 08:17:38,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-02 08:17:38,853 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2023-12-02 08:17:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:17:38,854 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-02 08:17:38,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 08:17:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-02 08:17:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:17:38,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:17:38,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:17:38,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 08:17:38,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:17:38,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:17:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1409346054, now seen corresponding path program 1 times [2023-12-02 08:17:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:17:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157783892] [2023-12-02 08:17:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:17:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:17:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:17:38,958 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 08:17:38,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 08:17:38,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157783892] [2023-12-02 08:17:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157783892] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:17:38,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:17:38,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:17:38,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376428050] [2023-12-02 08:17:38,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:17:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:17:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 08:17:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:17:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:17:38,963 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:17:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:17:38,984 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-12-02 08:17:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:17:38,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-12-02 08:17:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:17:38,986 INFO L225 Difference]: With dead ends: 32 [2023-12-02 08:17:38,986 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 08:17:38,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:17:38,989 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 08:17:38,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 08:17:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 08:17:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2023-12-02 08:17:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 08:17:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-02 08:17:38,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2023-12-02 08:17:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:17:38,996 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-02 08:17:38,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:17:38,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-02 08:17:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 08:17:38,997 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:17:38,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:17:38,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 08:17:38,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:17:38,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:17:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1916271840, now seen corresponding path program 1 times [2023-12-02 08:17:38,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 08:17:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917397239] [2023-12-02 08:17:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:17:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 08:17:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:17:39,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 08:17:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 08:17:39,070 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 08:17:39,070 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 08:17:39,071 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 08:17:39,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 08:17:39,076 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-02 08:17:39,080 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 08:17:39,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem5 could not be translated [2023-12-02 08:17:39,101 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem6 could not be translated [2023-12-02 08:17:39,102 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem7 could not be translated [2023-12-02 08:17:39,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 08:17:39 BoogieIcfgContainer [2023-12-02 08:17:39,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 08:17:39,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 08:17:39,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 08:17:39,118 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 08:17:39,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:38" (3/4) ... [2023-12-02 08:17:39,146 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-12-02 08:17:39,147 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 08:17:39,148 INFO L158 Benchmark]: Toolchain (without parser) took 1580.61ms. Allocated memory is still 218.1MB. Free memory was 170.0MB in the beginning and 185.4MB in the end (delta: -15.4MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2023-12-02 08:17:39,149 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:17:39,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.83ms. Allocated memory is still 218.1MB. Free memory was 169.4MB in the beginning and 158.2MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 08:17:39,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.31ms. Allocated memory is still 218.1MB. Free memory was 158.2MB in the beginning and 156.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 08:17:39,151 INFO L158 Benchmark]: Boogie Preprocessor took 28.18ms. Allocated memory is still 218.1MB. Free memory was 156.1MB in the beginning and 154.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 08:17:39,151 INFO L158 Benchmark]: RCFGBuilder took 349.30ms. Allocated memory is still 218.1MB. Free memory was 154.7MB in the beginning and 140.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-12-02 08:17:39,152 INFO L158 Benchmark]: TraceAbstraction took 836.94ms. Allocated memory is still 218.1MB. Free memory was 140.1MB in the beginning and 96.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2023-12-02 08:17:39,153 INFO L158 Benchmark]: Witness Printer took 30.49ms. Allocated memory is still 218.1MB. Free memory was 96.0MB in the beginning and 185.4MB in the end (delta: -89.4MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2023-12-02 08:17:39,156 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.22ms. Allocated memory is still 146.8MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.83ms. Allocated memory is still 218.1MB. Free memory was 169.4MB in the beginning and 158.2MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.31ms. Allocated memory is still 218.1MB. Free memory was 158.2MB in the beginning and 156.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.18ms. Allocated memory is still 218.1MB. Free memory was 156.1MB in the beginning and 154.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.30ms. Allocated memory is still 218.1MB. Free memory was 154.7MB in the beginning and 140.6MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 836.94ms. Allocated memory is still 218.1MB. Free memory was 140.1MB in the beginning and 96.0MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * Witness Printer took 30.49ms. Allocated memory is still 218.1MB. Free memory was 96.0MB in the beginning and 185.4MB in the end (delta: -89.4MB). Peak memory consumption was 7.9MB. 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 35, 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_129; [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_129=0, __return_main=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_129=0, __return_main=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L33] COND TRUE main__i < 5UL [L35] EXPR main__max[main__i] VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L35] 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_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_129=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4: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_129=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__VERIFIER_assert__cond=0, __return_129=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] [L53] reach_error() VAL [__VERIFIER_assert__cond=0, __return_129=0, __return_main=0, __tmp_1=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={5:0}, main__slope={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 29 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 30 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 08:17:39,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 08:17:41,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 08:17:41,376 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2023-12-02 08:17:41,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 08:17:41,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 08:17:41,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 08:17:41,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 08:17:41,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 08:17:41,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 08:17:41,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 08:17:41,416 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 08:17:41,417 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 08:17:41,417 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 08:17:41,418 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 08:17:41,419 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 08:17:41,419 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 08:17:41,420 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 08:17:41,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 08:17:41,421 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 08:17:41,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 08:17:41,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 08:17:41,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 08:17:41,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 08:17:41,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 08:17:41,424 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 08:17:41,424 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 08:17:41,425 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 08:17:41,425 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 08:17:41,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 08:17:41,426 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 08:17:41,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 08:17:41,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 08:17:41,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 08:17:41,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 08:17:41,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:17:41,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 08:17:41,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 08:17:41,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 08:17:41,429 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 08:17:41,429 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 08:17:41,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 08:17:41,429 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 08:17:41,430 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 08:17:41,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 08:17:41,430 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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 -> a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e [2023-12-02 08:17:41,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 08:17:41,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 08:17:41,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 08:17:41,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 08:17:41,770 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 08:17:41,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2023-12-02 08:17:44,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 08:17:44,889 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 08:17:44,890 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2023-12-02 08:17:44,899 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data/b9dd0b951/4cb4421f4e954aefbb254585a791b89d/FLAG93cf4ae57 [2023-12-02 08:17:45,220 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/data/b9dd0b951/4cb4421f4e954aefbb254585a791b89d [2023-12-02 08:17:45,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 08:17:45,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 08:17:45,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 08:17:45,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 08:17:45,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 08:17:45,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725d2e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45, skipping insertion in model container [2023-12-02 08:17:45,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,257 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 08:17:45,425 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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2023-12-02 08:17:45,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:17:45,450 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 08:17:45,482 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_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2023-12-02 08:17:45,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 08:17:45,504 INFO L206 MainTranslator]: Completed translation [2023-12-02 08:17:45,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45 WrapperNode [2023-12-02 08:17:45,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 08:17:45,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 08:17:45,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 08:17:45,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 08:17:45,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,557 INFO L138 Inliner]: procedures = 19, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 151 [2023-12-02 08:17:45,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 08:17:45,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 08:17:45,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 08:17:45,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 08:17:45,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,576 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 08:17:45,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 08:17:45,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 08:17:45,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 08:17:45,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (1/1) ... [2023-12-02 08:17:45,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 08:17:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:17:45,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 08:17:45,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 08:17:45,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 08:17:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-12-02 08:17:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 08:17:45,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 08:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-12-02 08:17:45,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 08:17:45,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 08:17:45,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 08:17:45,772 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 08:17:45,774 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 08:17:48,595 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 08:17:48,646 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 08:17:48,646 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-02 08:17:48,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:48 BoogieIcfgContainer [2023-12-02 08:17:48,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 08:17:48,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 08:17:48,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 08:17:48,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 08:17:48,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:17:45" (1/3) ... [2023-12-02 08:17:48,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ddfc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:17:48, skipping insertion in model container [2023-12-02 08:17:48,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:17:45" (2/3) ... [2023-12-02 08:17:48,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ddfc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:17:48, skipping insertion in model container [2023-12-02 08:17:48,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:17:48" (3/3) ... [2023-12-02 08:17:48,656 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2023-12-02 08:17:48,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 08:17:48,672 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 08:17:48,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 08:17:48,724 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;@7fae20ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 08:17:48,724 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 08:17:48,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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 08:17:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-02 08:17:48,735 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:17:48,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:17:48,736 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:17:48,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:17:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1392335393, now seen corresponding path program 1 times [2023-12-02 08:17:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:17:48,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38836627] [2023-12-02 08:17:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:17:48,757 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 08:17:48,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:17:48,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:48,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:17:49,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 08:17:49,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:17:49,267 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 08:17:49,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:17:49,268 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:17:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38836627] [2023-12-02 08:17:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38836627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:17:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:17:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 08:17:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634952897] [2023-12-02 08:17:49,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:17:49,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 08:17:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:17:49,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 08:17:49,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:17:49,317 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:17:51,742 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 08:17:54,113 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 08:17:54,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:17:54,207 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2023-12-02 08:17:54,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 08:17:54,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2023-12-02 08:17:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:17:54,217 INFO L225 Difference]: With dead ends: 37 [2023-12-02 08:17:54,217 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 08:17:54,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 08:17:54,224 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:17:54,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 08:17:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 08:17:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2023-12-02 08:17:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 08:17:54,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-02 08:17:54,255 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 11 [2023-12-02 08:17:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:17:54,256 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-02 08:17:54,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 08:17:54,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-02 08:17:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 08:17:54,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:17:54,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:17:54,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:54,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:54,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:17:54,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:17:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1899261179, now seen corresponding path program 1 times [2023-12-02 08:17:54,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:17:54,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011656156] [2023-12-02 08:17:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:17:54,460 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 08:17:54,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:17:54,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:54,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:17:54,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 08:17:54,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:17:54,972 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 08:17:54,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:17:54,973 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:17:54,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011656156] [2023-12-02 08:17:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011656156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:17:54,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:17:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 08:17:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12680314] [2023-12-02 08:17:54,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:17:54,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 08:17:54,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:17:54,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 08:17:54,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 08:17:54,977 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. 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 08:17:57,347 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 08:17:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:17:57,487 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-12-02 08:17:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 08:17:57,488 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 08:17:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:17:57,489 INFO L225 Difference]: With dead ends: 19 [2023-12-02 08:17:57,489 INFO L226 Difference]: Without dead ends: 15 [2023-12-02 08:17:57,489 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 08:17:57,491 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:17:57,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 41 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 08:17:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-02 08:17:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-02 08:17:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 08:17:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2023-12-02 08:17:57,495 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2023-12-02 08:17:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:17:57,495 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2023-12-02 08:17:57,495 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 08:17:57,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2023-12-02 08:17:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 08:17:57,496 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:17:57,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:17:57,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:57,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:57,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:17:57,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:17:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1916271840, now seen corresponding path program 1 times [2023-12-02 08:17:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:17:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778504299] [2023-12-02 08:17:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:17:57,699 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 08:17:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:17:57,700 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:57,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:17:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:17:58,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-02 08:17:58,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:18:03,577 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-02 08:18:03,578 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 08:18:28,523 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 08:19:02,101 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 08:19:04,129 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 08:20:37,176 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 08:20:37,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:20:37,177 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:20:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778504299] [2023-12-02 08:20:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778504299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:20:37,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:20:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 08:20:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429476962] [2023-12-02 08:20:37,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:20:37,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 08:20:37,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:20:37,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 08:20:37,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=39, Unknown=3, NotChecked=26, Total=90 [2023-12-02 08:20:37,180 INFO L87 Difference]: Start difference. First operand 15 states and 17 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 08:20:39,729 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 08:20:41,735 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 08:20:43,750 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 08:20:45,755 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 08:20:47,910 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 08:20:50,194 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 08:20:52,206 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 08:20:54,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:20:56,508 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 08:20:58,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:21:01,055 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 08:21:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:21:02,253 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-12-02 08:21:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 08:21:02,259 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 08:21:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:21:02,260 INFO L225 Difference]: With dead ends: 29 [2023-12-02 08:21:02,260 INFO L226 Difference]: Without dead ends: 24 [2023-12-02 08:21:02,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=24, Invalid=40, Unknown=4, NotChecked=42, Total=110 [2023-12-02 08:21:02,261 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:21:02,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 47 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 10 Unknown, 86 Unchecked, 22.9s Time] [2023-12-02 08:21:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-02 08:21:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-12-02 08:21:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 08:21:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-02 08:21:02,266 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2023-12-02 08:21:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:21:02,267 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-02 08:21:02,267 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 08:21:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-02 08:21:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 08:21:02,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:21:02,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:21:02,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:21:02,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:21:02,469 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:21:02,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:21:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1241962045, now seen corresponding path program 1 times [2023-12-02 08:21:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:21:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544810138] [2023-12-02 08:21:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:21:02,470 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 08:21:02,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:21:02,471 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:21:02,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:21:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:21:03,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 08:21:03,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:21:16,356 WARN L293 SmtUtils]: Spent 7.82s on a formula simplification. DAG size of input: 33 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 08:21:16,356 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-02 08:21:16,357 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 08:21:42,567 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 08:22:12,565 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 08:22:50,403 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 08:22:52,437 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 08:24:38,921 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 08:24:38,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 08:24:38,921 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:24:38,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544810138] [2023-12-02 08:24:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544810138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 08:24:38,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 08:24:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-02 08:24:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403576071] [2023-12-02 08:24:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 08:24:38,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-02 08:24:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:24:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-02 08:24:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=40, Unknown=4, NotChecked=42, Total=110 [2023-12-02 08:24:38,923 INFO L87 Difference]: Start difference. First operand 18 states and 21 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 08:24:41,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:24:43,644 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 08:24:46,426 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 08:24:48,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:24:50,788 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 08:24:52,800 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 08:24:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:24:53,629 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2023-12-02 08:24:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 08:24:53,635 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 08:24:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:24:53,636 INFO L225 Difference]: With dead ends: 24 [2023-12-02 08:24:53,636 INFO L226 Difference]: Without dead ends: 16 [2023-12-02 08:24:53,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=26, Invalid=41, Unknown=5, NotChecked=60, Total=132 [2023-12-02 08:24:53,638 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-12-02 08:24:53,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 26 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 5 Unknown, 104 Unchecked, 12.5s Time] [2023-12-02 08:24:53,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-02 08:24:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-02 08:24:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 08:24:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2023-12-02 08:24:53,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2023-12-02 08:24:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:24:53,643 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2023-12-02 08:24:53,643 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 08:24:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2023-12-02 08:24:53,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 08:24:53,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:24:53,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:24:53,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:24:53,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:24:53,845 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:24:53,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:24:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 9185546, now seen corresponding path program 1 times [2023-12-02 08:24:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:24:53,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391553523] [2023-12-02 08:24:53,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:53,846 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 08:24:53,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:24:53,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:24:53,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:24:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:54,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:24:54,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:54,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:54,658 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:24:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391553523] [2023-12-02 08:24:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391553523] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:24:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [529961951] [2023-12-02 08:24:54,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:24:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:24:54,661 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:24:54,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-02 08:24:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:55,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 08:24:55,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:55,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [529961951] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:24:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472542378] [2023-12-02 08:24:55,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:24:55,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:24:55,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 08:24:55,503 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 08:24:55,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 08:24:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:24:56,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 08:24:56,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:24:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:56,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:24:56,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:24:56,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472542378] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:24:56,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 08:24:56,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 7 [2023-12-02 08:24:56,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020322180] [2023-12-02 08:24:56,303 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 08:24:56,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 08:24:56,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 08:24:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 08:24:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-02 08:24:56,305 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 08:24:58,931 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 08:25:00,938 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 08:25:03,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:25:05,343 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 08:25:07,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:25:09,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-02 08:25:11,822 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 08:25:13,824 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 08:25:15,834 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 08:25:17,844 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 08:25:20,264 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 08:25:22,269 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 08:25:24,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 08:25:26,276 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 08:25:28,278 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 08:25:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 08:25:28,281 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2023-12-02 08:25:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 08:25:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 08:25:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 08:25:28,381 INFO L225 Difference]: With dead ends: 53 [2023-12-02 08:25:28,381 INFO L226 Difference]: Without dead ends: 45 [2023-12-02 08:25:28,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-02 08:25:28,383 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 84 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2023-12-02 08:25:28,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 54 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 31.9s Time] [2023-12-02 08:25:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-02 08:25:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 21. [2023-12-02 08:25:28,388 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 08:25:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-12-02 08:25:28,389 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2023-12-02 08:25:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 08:25:28,389 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-12-02 08:25:28,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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 08:25:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-12-02 08:25:28,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 08:25:28,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 08:25:28,391 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 08:25:28,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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)] Ended with exit code 0 [2023-12-02 08:25:28,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2023-12-02 08:25:28,823 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-02 08:25:28,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 08:25:28,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 08:25:28,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 08:25:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1460969052, now seen corresponding path program 1 times [2023-12-02 08:25:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 08:25:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276154026] [2023-12-02 08:25:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:25:28,993 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 08:25:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 08:25:28,994 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 08:25:28,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/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 (9)] Waiting until timeout for monitored process [2023-12-02 08:25:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:25:30,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 08:25:30,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:25:44,188 WARN L293 SmtUtils]: Spent 5.49s 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 08:25:44,188 INFO L349 Elim1Store]: treesize reduction 32, result has 43.9 percent of original size [2023-12-02 08:25:44,189 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 08:26:18,310 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 08:26:56,130 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 08:26:58,155 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 08:28:44,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 08:28:44,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 08:28:53,302 WARN L854 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from false [2023-12-02 08:28:55,425 WARN L876 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from true [2023-12-02 08:29:06,337 WARN L854 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from false [2023-12-02 08:29:08,459 WARN L876 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from true [2023-12-02 08:29:19,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4))))) is different from false [2023-12-02 08:29:21,445 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4))))) is different from true [2023-12-02 08:29:36,820 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2023-12-02 08:29:38,932 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2023-12-02 08:29:54,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse3 (let ((.cse8 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse3 .cse6))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2023-12-02 08:29:56,399 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))) (let ((.cse3 (let ((.cse8 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32) .cse2)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse3 .cse6))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2023-12-02 08:30:11,726 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from false [2023-12-02 08:30:13,833 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from true [2023-12-02 08:30:33,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from false [2023-12-02 08:30:35,828 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse0 (let ((.cse7 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem6#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) is different from true [2023-12-02 08:31:00,134 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse8 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv4 32))))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse2 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse7 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))))) is different from true [2023-12-02 08:31:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-02 08:31:00,135 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 08:31:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276154026] [2023-12-02 08:31:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276154026] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 08:31:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1851705207] [2023-12-02 08:31:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 08:31:00,135 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 08:31:00,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 08:31:00,137 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 08:31:00,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78d3acc4-3e38-46b1-8ec9-18a2b97682b9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-02 08:31:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 08:31:01,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 08:31:01,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 08:31:16,428 WARN L293 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 33 DAG size of output: 17 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-02 08:31:16,428 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-02 08:31:16,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 289 treesize of output 157 [2023-12-02 08:31:48,068 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_20 (_ 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 ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv12 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967281 32)) .cse2) (= .cse3 .cse4) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse5 .cse3)))) (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)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-02 08:32:25,020 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_20 (_ 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 ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= .cse4 .cse0) (= .cse5 .cse4) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse1) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))))) is different from false [2023-12-02 08:32:27,046 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_20 (_ 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 ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_23) ((_ extract 30 23) v_arrayElimCell_23) ((_ extract 22 0) v_arrayElimCell_23))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_20) ((_ extract 30 23) v_arrayElimCell_20) ((_ extract 22 0) v_arrayElimCell_20))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_19) ((_ extract 30 23) v_arrayElimCell_19) ((_ extract 22 0) v_arrayElimCell_19))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_18) ((_ extract 30 23) v_arrayElimCell_18) ((_ extract 22 0) v_arrayElimCell_18)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= .cse4 .cse0) (= .cse5 .cse4) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv12 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967281 32)) .cse1) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)))))) is different from true