./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:59:52,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:59:52,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:59:52,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:59:52,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:59:52,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:59:52,584 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:59:52,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:59:52,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:59:52,603 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:59:52,605 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:59:52,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:59:52,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:59:52,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:59:52,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:59:52,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:59:52,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:59:52,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:59:52,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:59:52,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:59:52,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:59:52,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:59:52,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:59:52,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:59:52,639 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:59:52,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:59:52,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:59:52,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:59:52,642 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:59:52,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:59:52,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:59:52,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:59:52,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:59:52,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:59:52,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:59:52,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:59:52,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:59:52,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:59:52,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:59:52,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:59:52,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:59:52,665 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 06:59:52,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:59:52,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:59:52,724 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:59:52,724 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:59:52,725 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:59:52,725 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:59:52,736 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:59:52,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:59:52,737 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:59:52,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:59:52,738 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:59:52,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:59:52,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:59:52,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:59:52,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:59:52,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:59:52,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:59:52,740 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:59:52,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:59:52,741 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:59:52,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:59:52,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:59:52,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:59:52,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:59:52,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:59:52,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:59:52,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:59:52,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:59:52,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:59:52,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:59:52,746 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:59:52,746 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:59:52,747 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:59:52,747 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:59:52,747 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/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_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 [2021-11-20 06:59:53,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:59:53,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:59:53,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:59:53,128 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:59:53,129 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:59:53,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-20 06:59:53,202 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/a36fe4af3/02672a234a3d4b23bad97e6d22d45b8e/FLAG556ca5cde [2021-11-20 06:59:53,713 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:59:53,714 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-20 06:59:53,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/a36fe4af3/02672a234a3d4b23bad97e6d22d45b8e/FLAG556ca5cde [2021-11-20 06:59:54,053 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/a36fe4af3/02672a234a3d4b23bad97e6d22d45b8e [2021-11-20 06:59:54,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:59:54,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:59:54,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:59:54,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:59:54,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:59:54,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7281f822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54, skipping insertion in model container [2021-11-20 06:59:54,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:59:54,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:59:54,320 WARN L230 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_8b72d2ac-3ca0-47af-b885-2db176c394e1/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-20 06:59:54,330 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:59:54,341 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:59:54,396 WARN L230 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_8b72d2ac-3ca0-47af-b885-2db176c394e1/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-20 06:59:54,407 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:59:54,421 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:59:54,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54 WrapperNode [2021-11-20 06:59:54,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:59:54,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:59:54,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:59:54,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:59:54,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,457 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,495 INFO L137 Inliner]: procedures = 18, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2021-11-20 06:59:54,496 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:59:54,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:59:54,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:59:54,497 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:59:54,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,522 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,524 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:59:54,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:59:54,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:59:54,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:59:54,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (1/1) ... [2021-11-20 06:59:54,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:59:54,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:59:54,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:59:54,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:59:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:59:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:59:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 06:59:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-20 06:59:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:59:54,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:59:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-20 06:59:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 06:59:54,726 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:59:54,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:59:54,953 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:59:54,959 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:59:54,960 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 06:59:54,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:59:54 BoogieIcfgContainer [2021-11-20 06:59:54,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:59:54,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:59:54,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:59:54,968 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:59:54,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:59:54" (1/3) ... [2021-11-20 06:59:54,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6e79dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:59:54, skipping insertion in model container [2021-11-20 06:59:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:59:54" (2/3) ... [2021-11-20 06:59:54,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c6e79dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:59:54, skipping insertion in model container [2021-11-20 06:59:54,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:59:54" (3/3) ... [2021-11-20 06:59:54,972 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2021-11-20 06:59:54,977 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:59:54,977 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:59:55,028 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:59:55,037 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:59:55,037 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:59:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) [2021-11-20 06:59:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:59:55,058 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:59:55,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:59:55,059 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:59:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:59:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-11-20 06:59:55,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:59:55,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114122900] [2021-11-20 06:59:55,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:59:55,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:59:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:59:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:59:55,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:59:55,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114122900] [2021-11-20 06:59:55,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114122900] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:59:55,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:59:55,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-20 06:59:55,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542776346] [2021-11-20 06:59:55,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:59:55,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 06:59:55,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:59:55,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 06:59:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 06:59:55,410 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:59:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:59:55,520 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-11-20 06:59:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:59:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 06:59:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:59:55,543 INFO L225 Difference]: With dead ends: 31 [2021-11-20 06:59:55,543 INFO L226 Difference]: Without dead ends: 15 [2021-11-20 06:59:55,548 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:59:55,555 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:59:55,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:59:55,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-20 06:59:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-20 06:59:55,601 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) [2021-11-20 06:59:55,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-20 06:59:55,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2021-11-20 06:59:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:59:55,604 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-20 06:59:55,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 06:59:55,605 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-11-20 06:59:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:59:55,606 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:59:55,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:59:55,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:59:55,607 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:59:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:59:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2021-11-20 06:59:55,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:59:55,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057015597] [2021-11-20 06:59:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:59:55,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:59:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:59:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:59:55,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:59:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057015597] [2021-11-20 06:59:55,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057015597] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:59:55,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:59:55,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:59:55,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417141885] [2021-11-20 06:59:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:59:55,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:59:55,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:59:55,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:59:55,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:59:55,754 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2021-11-20 06:59:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:59:55,773 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-20 06:59:55,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:59:55,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 [2021-11-20 06:59:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:59:55,775 INFO L225 Difference]: With dead ends: 33 [2021-11-20 06:59:55,775 INFO L226 Difference]: Without dead ends: 25 [2021-11-20 06:59:55,776 INFO L932 BasicCegarLoop]: 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 [2021-11-20 06:59:55,778 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:59:55,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:59:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-11-20 06:59:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-11-20 06:59:55,786 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) [2021-11-20 06:59:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-11-20 06:59:55,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-11-20 06:59:55,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:59:55,787 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-11-20 06:59:55,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2021-11-20 06:59:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-11-20 06:59:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 06:59:55,789 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:59:55,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:59:55,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:59:55,790 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:59:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:59:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-11-20 06:59:55,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:59:55,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384641700] [2021-11-20 06:59:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:59:55,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:59:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:59:55,818 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:59:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:59:55,894 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:59:55,894 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 06:59:55,896 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 06:59:55,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:59:55,916 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-20 06:59:55,921 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 06:59:56,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:59:56 BoogieIcfgContainer [2021-11-20 06:59:56,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 06:59:56,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 06:59:56,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 06:59:56,006 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 06:59:56,007 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:59:54" (3/4) ... [2021-11-20 06:59:56,011 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 06:59:56,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 06:59:56,013 INFO L158 Benchmark]: Toolchain (without parser) took 1954.74ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 50.8MB in the beginning and 46.0MB in the end (delta: 4.9MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,014 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 58.9MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:59:56,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.04ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 50.6MB in the beginning and 95.6MB in the end (delta: -45.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.65ms. Allocated memory is still 121.6MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,017 INFO L158 Benchmark]: Boogie Preprocessor took 27.92ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,018 INFO L158 Benchmark]: RCFGBuilder took 436.77ms. Allocated memory is still 121.6MB. Free memory was 92.1MB in the beginning and 80.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,019 INFO L158 Benchmark]: TraceAbstraction took 1040.75ms. Allocated memory is still 121.6MB. Free memory was 79.5MB in the beginning and 46.7MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,020 INFO L158 Benchmark]: Witness Printer took 5.90ms. Allocated memory is still 121.6MB. Free memory was 46.7MB in the beginning and 46.0MB in the end (delta: 737.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:59:56,025 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 86.0MB. Free memory was 59.0MB in the beginning and 58.9MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.04ms. Allocated memory was 86.0MB in the beginning and 121.6MB in the end (delta: 35.7MB). Free memory was 50.6MB in the beginning and 95.6MB in the end (delta: -45.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.65ms. Allocated memory is still 121.6MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.92ms. Allocated memory is still 121.6MB. Free memory was 93.5MB in the beginning and 92.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.77ms. Allocated memory is still 121.6MB. Free memory was 92.1MB in the beginning and 80.3MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1040.75ms. Allocated memory is still 121.6MB. Free memory was 79.5MB in the beginning and 46.7MB in the end (delta: 32.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 5.90ms. Allocated memory is still 121.6MB. Free memory was 46.7MB in the beginning and 46.0MB in the end (delta: 737.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 53]: Unable to prove that call to reach_error is unreachable Unable to prove that 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; VAL [__return_129=0, __return_main=0] [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__min[0]=49, main__org={4:0}, main__slope={5: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__max[4UL]=51, main__min={7:0}, main__org={4:0}, main__slope={5: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={4:0}, main__slope={5: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={4:0}, main__slope={5: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__max[main__i]=50, main__min={7:0}, main__org={4:0}, main__slope={5: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={4:0}, main__slope={5: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={4:0}, main__slope={5: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={4:0}, main__slope={5:0}] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__return_129=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_129=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] [L53] reach_error() VAL [__return_129=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={6:0}, main__min={7:0}, main__org={4:0}, main__slope={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 37 mSDtfsCounter, 19 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=18occurred 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 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 [2021-11-20 06:59:56,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a4b21fc033f5ea5cebc3419535848f3ce92b08a7177da8a580c018ae56dea99e --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:59:58,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:59:58,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:59:58,956 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:59:58,957 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:59:58,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:59:58,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:59:58,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:59:58,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:59:58,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:59:58,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:59:58,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:59:58,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:59:58,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:59:58,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:59:58,990 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:59:58,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:59:58,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:59:59,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:59:59,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:59:59,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:59:59,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:59:59,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:59:59,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:59:59,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:59:59,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:59:59,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:59:59,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:59:59,025 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:59:59,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:59:59,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:59:59,028 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:59:59,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:59:59,029 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:59:59,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:59:59,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:59:59,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:59:59,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:59:59,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:59:59,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:59:59,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:59:59,044 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-20 06:59:59,089 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:59:59,089 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:59:59,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:59:59,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:59:59,092 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:59:59,092 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:59:59,093 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:59:59,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:59:59,094 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:59:59,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:59:59,095 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:59:59,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:59:59,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:59:59,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:59:59,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:59:59,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:59:59,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:59:59,097 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 06:59:59,097 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 06:59:59,097 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:59:59,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:59:59,097 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:59:59,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:59:59,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:59:59,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:59:59,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:59:59,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:59:59,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:59:59,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:59:59,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:59:59,099 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 06:59:59,100 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 06:59:59,100 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:59:59,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:59:59,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:59:59,101 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:59:59,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 06:59:59,101 INFO L138 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_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/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_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer 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 [2021-11-20 06:59:59,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:59:59,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:59:59,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:59:59,652 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:59:59,654 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:59:59,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-20 06:59:59,755 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/d62bf179d/13048db5708f4b1a8a0e06e568c3db31/FLAG993fe9f94 [2021-11-20 07:00:00,447 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:00:00,448 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c [2021-11-20 07:00:00,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/d62bf179d/13048db5708f4b1a8a0e06e568c3db31/FLAG993fe9f94 [2021-11-20 07:00:00,763 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/data/d62bf179d/13048db5708f4b1a8a0e06e568c3db31 [2021-11-20 07:00:00,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:00:00,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:00:00,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:00:00,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:00:00,777 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:00:00,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:00" (1/1) ... [2021-11-20 07:00:00,781 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:00, skipping insertion in model container [2021-11-20 07:00:00,781 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:00:00" (1/1) ... [2021-11-20 07:00:00,790 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:00:00,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:00:00,993 WARN L230 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_8b72d2ac-3ca0-47af-b885-2db176c394e1/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-20 07:00:00,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:00:01,010 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:00:01,094 WARN L230 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_8b72d2ac-3ca0-47af-b885-2db176c394e1/sv-benchmarks/c/float-benchs/interpolation2.c.v+cfa-reducer.c[1463,1476] [2021-11-20 07:00:01,098 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:00:01,122 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:00:01,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01 WrapperNode [2021-11-20 07:00:01,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:00:01,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:00:01,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:00:01,125 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:00:01,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,195 INFO L137 Inliner]: procedures = 19, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2021-11-20 07:00:01,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:00:01,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:00:01,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:00:01,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:00:01,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,233 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,237 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:00:01,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:00:01,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:00:01,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:00:01,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (1/1) ... [2021-11-20 07:00:01,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:00:01,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:00:01,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:00:01,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:00:01,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:00:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-20 07:00:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 07:00:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:00:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-20 07:00:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:00:01,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:00:01,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:00:01,433 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:00:01,434 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:00:04,422 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:00:04,430 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:00:04,431 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-20 07:00:04,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:04 BoogieIcfgContainer [2021-11-20 07:00:04,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:00:04,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:00:04,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:00:04,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:00:04,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:00:00" (1/3) ... [2021-11-20 07:00:04,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adcf15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:00:04, skipping insertion in model container [2021-11-20 07:00:04,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:00:01" (2/3) ... [2021-11-20 07:00:04,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adcf15a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:00:04, skipping insertion in model container [2021-11-20 07:00:04,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:00:04" (3/3) ... [2021-11-20 07:00:04,444 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+cfa-reducer.c [2021-11-20 07:00:04,451 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:00:04,451 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:00:04,508 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:00:04,518 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:00:04,518 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:00:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) [2021-11-20 07:00:04,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 07:00:04,542 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:00:04,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:00:04,544 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:00:04,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:00:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-11-20 07:00:04,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:00:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454400665] [2021-11-20 07:00:04,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:00:04,576 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:00:04,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:00:04,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:00:04,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 07:00:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:00:05,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:00:05,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:00:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:00:05,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:00:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:00:05,423 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:00:05,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454400665] [2021-11-20 07:00:05,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454400665] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:00:05,425 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:00:05,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 07:00:05,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005801489] [2021-11-20 07:00:05,428 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:00:05,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:00:05,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:00:05,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:00:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:00:05,512 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 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) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:00:07,822 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 07:00:07,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:00:07,927 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2021-11-20 07:00:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:00:07,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-20 07:00:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:00:07,940 INFO L225 Difference]: With dead ends: 34 [2021-11-20 07:00:07,940 INFO L226 Difference]: Without dead ends: 20 [2021-11-20 07:00:07,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:00:07,947 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:00:07,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-20 07:00:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-20 07:00:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-11-20 07:00:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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) [2021-11-20 07:00:07,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-11-20 07:00:07,982 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2021-11-20 07:00:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:00:07,982 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-11-20 07:00:07,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:00:07,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-11-20 07:00:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 07:00:07,983 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:00:07,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:00:08,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:00:08,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:00:08,207 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:00:08,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:00:08,208 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2021-11-20 07:00:08,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:00:08,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134387127] [2021-11-20 07:00:08,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:00:08,209 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:00:08,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:00:08,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:00:08,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 07:00:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:00:08,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-20 07:00:08,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:00:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:00:08,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:00:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:00:08,894 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:00:08,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134387127] [2021-11-20 07:00:08,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134387127] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:00:08,895 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:00:08,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-20 07:00:08,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847208416] [2021-11-20 07:00:08,896 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:00:08,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 07:00:08,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:00:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 07:00:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-20 07:00:08,898 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-11-20 07:00:11,129 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 07:00:13,146 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 07:00:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:00:13,307 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2021-11-20 07:00:13,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:00:13,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) Word has length 13 [2021-11-20 07:00:13,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:00:13,311 INFO L225 Difference]: With dead ends: 22 [2021-11-20 07:00:13,312 INFO L226 Difference]: Without dead ends: 18 [2021-11-20 07:00:13,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-20 07:00:13,314 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:00:13,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2021-11-20 07:00:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-20 07:00:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-20 07:00:13,329 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) [2021-11-20 07:00:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2021-11-20 07:00:13,331 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2021-11-20 07:00:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:00:13,332 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2021-11-20 07:00:13,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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) [2021-11-20 07:00:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2021-11-20 07:00:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 07:00:13,335 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:00:13,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:00:13,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 07:00:13,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:00:13,560 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:00:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:00:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-11-20 07:00:13,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:00:13,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810801718] [2021-11-20 07:00:13,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:00:13,562 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:00:13,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:00:13,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:00:13,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 07:00:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:00:14,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 07:00:14,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:00:22,070 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-20 07:00:22,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 07:01:20,988 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:02:45,205 WARN L838 $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 [2021-11-20 07:02:47,233 WARN L860 $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 [2021-11-20 07:06:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:06:57,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:07:05,189 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (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 .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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 .cse1 |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 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (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 [2021-11-20 07:07:07,306 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (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 .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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 .cse1 |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 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (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 [2021-11-20 07:07:18,029 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (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 .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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 .cse1 |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 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (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 [2021-11-20 07:07:20,139 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (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 .cse1 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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 .cse1 |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 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (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 [2021-11-20 07:07:30,884 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (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 .cse2 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (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 .cse2 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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 .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (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 [2021-11-20 07:07:32,999 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (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 .cse2 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (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 .cse2 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (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 .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (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 [2021-11-20 07:07:43,701 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (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|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |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 ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-20 07:07:45,800 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (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|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |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 ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 07:08:00,859 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (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 ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |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 ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-20 07:08:02,959 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (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 ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |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 ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 07:08:22,666 WARN L838 $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 ((.cse5 (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))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |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 ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) is different from false [2021-11-20 07:08:24,771 WARN L860 $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 ((.cse5 (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))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |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 ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse5)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) is different from true [2021-11-20 07:09:57,168 WARN L227 SmtUtils]: Spent 1.54m on a formula simplification. DAG size of input: 33 DAG size of output: 11 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-20 07:09:57,169 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-20 07:09:57,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 300 treesize of output 162 [2021-11-20 07:11:33,214 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_9 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse0 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) is different from false [2021-11-20 07:11:35,308 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_9 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse0 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) is different from true [2021-11-20 07:11:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 07:11:35,309 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:11:35,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810801718] [2021-11-20 07:11:35,310 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810801718] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:11:35,310 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:11:35,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-20 07:11:35,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521891647] [2021-11-20 07:11:35,311 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:11:35,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-20 07:11:35,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:11:35,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-20 07:11:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=63, Unknown=17, NotChecked=216, Total=342 [2021-11-20 07:11:35,316 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:11:37,524 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_9 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse0 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:11:39,618 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_9 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse0 (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_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse0)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:11:41,656 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse6 (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (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|) |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 ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |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 .cse6 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) (= (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse10 (select .cse11 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= |c_ULTIMATE.start_main_#t~mem5#1| .cse12) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-20 07:11:43,746 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14)))) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (forall ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse6 (let ((.cse8 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (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|) |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 ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |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 .cse6 .cse5))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse6)) (not (fp.geq |ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem5#1|)))))) (= (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse10 (select .cse11 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse12) (= |c_ULTIMATE.start_main_#t~mem5#1| .cse12) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-20 07:11:47,183 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse1 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse2 (let ((.cse8 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or (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 .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (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))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= |c_ULTIMATE.start_main_#t~mem6#1| .cse2) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 07:11:49,226 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (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))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from false [2021-11-20 07:11:51,325 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse2 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|) |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse0 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|) |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse2) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (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))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3)))) is different from true [2021-11-20 07:11:55,181 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (let ((.cse17 (select .cse14 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse5 (let ((.cse16 (select .cse12 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse5) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (let ((.cse8 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse6 (let ((.cse13 (select .cse14 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse6)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse7 (select .cse3 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse10 (let ((.cse11 (select .cse12 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse9 (select .cse1 (bvadd .cse8 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse10)) (fp.sub c_currentRoundingMode .cse6 .cse10))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse5)))) is different from true [2021-11-20 07:11:59,226 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse9 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (let ((.cse4 (let ((.cse17 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse12 (let ((.cse16 (select .cse7 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse5 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse4) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse5) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse8 (select .cse3 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse10 (select .cse1 (bvadd .cse9 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_#t~mem7#1| .cse12) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse5)))) is different from true [2021-11-20 07:12:01,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse10 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse0 (let ((.cse16 (select .cse6 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse7) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse4 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse2 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse12)) (fp.sub c_currentRoundingMode .cse0 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse7)))) is different from false [2021-11-20 07:12:03,393 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse10 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0#1.base|)) (.cse0 (let ((.cse16 (select .cse6 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (let ((.cse15 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (= |c_ULTIMATE.start_main_~#main__org~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse7) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (= (let ((.cse8 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#main__slope~0#1.offset| (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse4 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__org~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__min~0#1.offset|)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse2 (bvadd .cse10 |c_ULTIMATE.start_main_~#main__slope~0#1.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse12)) (fp.sub c_currentRoundingMode .cse0 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse7)))) is different from true [2021-11-20 07:12:05,471 WARN L838 $PredicateComparison]: unable to prove that (and (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))) (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 ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse3)) (fp.sub c_currentRoundingMode .cse0 .cse3)))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse3) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))) (exists ((v_arrayElimCell_3 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:12:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:12:06,075 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2021-11-20 07:12:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 07:12:06,081 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-20 07:12:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:12:06,082 INFO L225 Difference]: With dead ends: 25 [2021-11-20 07:12:06,082 INFO L226 Difference]: Without dead ends: 20 [2021-11-20 07:12:06,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=62, Invalid=67, Unknown=29, NotChecked=544, Total=702 [2021-11-20 07:12:06,085 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-11-20 07:12:06,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 75 Unchecked, 0.7s Time] [2021-11-20 07:12:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-20 07:12:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-20 07:12:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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) [2021-11-20 07:12:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2021-11-20 07:12:06,111 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2021-11-20 07:12:06,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:12:06,111 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2021-11-20 07:12:06,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:12:06,115 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2021-11-20 07:12:06,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 07:12:06,117 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:12:06,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:12:06,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-20 07:12:06,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:12:06,322 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:12:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:12:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2021-11-20 07:12:06,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:12:06,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794585030] [2021-11-20 07:12:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:12:06,325 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:12:06,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:12:06,327 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:12:06,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b72d2ac-3ca0-47af-b885-2db176c394e1/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 07:12:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:12:07,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-20 07:12:07,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:12:18,176 WARN L227 SmtUtils]: Spent 7.36s on a formula simplification. DAG size of input: 33 DAG size of output: 17 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-20 07:12:18,177 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-20 07:12:18,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-11-20 07:13:33,723 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse0 (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_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12)))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse2)) (fp.sub c_currentRoundingMode .cse0 .cse2)))) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven) (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)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) is different from false