./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0 --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 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 16:06:53,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 16:06:53,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 16:06:53,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 16:06:53,737 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 16:06:53,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 16:06:53,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 16:06:53,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 16:06:53,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 16:06:53,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 16:06:53,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 16:06:53,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 16:06:53,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 16:06:53,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 16:06:53,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 16:06:53,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 16:06:53,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 16:06:53,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 16:06:53,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 16:06:53,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 16:06:53,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 16:06:53,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 16:06:53,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 16:06:53,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 16:06:53,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 16:06:53,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 16:06:53,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 16:06:53,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 16:06:53,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 16:06:53,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 16:06:53,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 16:06:53,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 16:06:53,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 16:06:53,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 16:06:53,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 16:06:53,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 16:06:53,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 16:06:53,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 16:06:53,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 16:06:53,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 16:06:53,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 16:06:53,818 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-22 16:06:53,846 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 16:06:53,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 16:06:53,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 16:06:53,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 16:06:53,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 16:06:53,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 16:06:53,849 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 16:06:53,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 16:06:53,853 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 16:06:53,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 16:06:53,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 16:06:53,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 16:06:53,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 16:06:53,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 16:06:53,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 16:06:53,856 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 16:06:53,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 16:06:53,857 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 16:06:53,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 16:06:53,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 16:06:53,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 16:06:53,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 16:06:53,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:06:53,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 16:06:53,859 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 16:06:53,859 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 16:06:53,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 16:06:53,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 16:06:53,860 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 16:06:53,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 16:06:53,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 16:06:53,862 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 16:06:53,863 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_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/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_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0 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 -> 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f [2021-11-22 16:06:54,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 16:06:54,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 16:06:54,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 16:06:54,251 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 16:06:54,252 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 16:06:54,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-11-22 16:06:54,345 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/8c7509664/dc8f9deedd734183be34560e0b8db990/FLAG387df1861 [2021-11-22 16:06:54,828 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 16:06:54,829 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-11-22 16:06:54,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/8c7509664/dc8f9deedd734183be34560e0b8db990/FLAG387df1861 [2021-11-22 16:06:55,208 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/8c7509664/dc8f9deedd734183be34560e0b8db990 [2021-11-22 16:06:55,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 16:06:55,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 16:06:55,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 16:06:55,214 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 16:06:55,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 16:06:55,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ffaf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55, skipping insertion in model container [2021-11-22 16:06:55,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 16:06:55,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 16:06:55,464 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_92de3b06-d266-42c4-b98e-81fb7cd4959b/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-11-22 16:06:55,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:06:55,498 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 16:06:55,512 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_92de3b06-d266-42c4-b98e-81fb7cd4959b/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-11-22 16:06:55,523 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:06:55,539 INFO L208 MainTranslator]: Completed translation [2021-11-22 16:06:55,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55 WrapperNode [2021-11-22 16:06:55,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 16:06:55,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 16:06:55,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 16:06:55,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 16:06:55,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,580 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 43 [2021-11-22 16:06:55,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 16:06:55,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 16:06:55,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 16:06:55,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 16:06:55,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,601 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 16:06:55,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 16:06:55,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 16:06:55,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 16:06:55,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (1/1) ... [2021-11-22 16:06:55,640 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:06:55,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:06:55,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 16:06:55,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 16:06:55,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 16:06:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 16:06:55,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 16:06:55,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 16:06:55,783 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 16:06:55,785 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 16:06:55,886 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 16:06:55,893 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 16:06:55,893 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 16:06:55,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:06:55 BoogieIcfgContainer [2021-11-22 16:06:55,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 16:06:55,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 16:06:55,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 16:06:55,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 16:06:55,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:06:55" (1/3) ... [2021-11-22 16:06:55,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa168a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:06:55, skipping insertion in model container [2021-11-22 16:06:55,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:06:55" (2/3) ... [2021-11-22 16:06:55,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa168a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:06:55, skipping insertion in model container [2021-11-22 16:06:55,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:06:55" (3/3) ... [2021-11-22 16:06:55,905 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound1.c [2021-11-22 16:06:55,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 16:06:55,912 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-22 16:06:55,965 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 16:06:55,973 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-22 16:06:55,973 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-22 16:06:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 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-22 16:06:55,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 16:06:56,012 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:06:56,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:06:56,014 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:06:56,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:06:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-11-22 16:06:56,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:06:56,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836900941] [2021-11-22 16:06:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:06:56,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:06:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:06:56,140 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-22 16:06:56,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-22 16:06:56,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836900941] [2021-11-22 16:06:56,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836900941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-22 16:06:56,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:06:56,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-22 16:06:56,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83066377] [2021-11-22 16:06:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-22 16:06:56,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 16:06:56,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-22 16:06:56,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 16:06:56,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 16:06:56,179 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-22 16:06:56,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:06:56,194 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-11-22 16:06:56,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 16:06:56,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-11-22 16:06:56,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:06:56,204 INFO L225 Difference]: With dead ends: 33 [2021-11-22 16:06:56,204 INFO L226 Difference]: Without dead ends: 14 [2021-11-22 16:06:56,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 16:06:56,211 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:06:56,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:06:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-22 16:06:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-22 16:06:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 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-22 16:06:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-22 16:06:56,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2021-11-22 16:06:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:06:56,246 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-22 16:06:56,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-22 16:06:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-22 16:06:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 16:06:56,247 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:06:56,247 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:06:56,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 16:06:56,248 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:06:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:06:56,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-11-22 16:06:56,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:06:56,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292381110] [2021-11-22 16:06:56,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:06:56,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:06:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 16:06:56,271 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 16:06:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 16:06:56,303 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 16:06:56,303 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 16:06:56,305 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-22 16:06:56,307 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-22 16:06:56,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-22 16:06:56,311 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-22 16:06:56,327 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 16:06:56,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:06:56 BoogieIcfgContainer [2021-11-22 16:06:56,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 16:06:56,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 16:06:56,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 16:06:56,364 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 16:06:56,364 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:06:55" (3/4) ... [2021-11-22 16:06:56,380 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 16:06:56,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 16:06:56,382 INFO L158 Benchmark]: Toolchain (without parser) took 1169.09ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 50.1MB in the beginning and 43.4MB in the end (delta: 6.7MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2021-11-22 16:06:56,382 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 83.9MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:06:56,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.69ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 49.8MB in the beginning and 78.5MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 16:06:56,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.90ms. Allocated memory is still 102.8MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:06:56,385 INFO L158 Benchmark]: Boogie Preprocessor took 45.48ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 76.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:06:56,386 INFO L158 Benchmark]: RCFGBuilder took 267.66ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 66.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 16:06:56,387 INFO L158 Benchmark]: TraceAbstraction took 465.05ms. Allocated memory is still 102.8MB. Free memory was 66.4MB in the beginning and 43.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-22 16:06:56,388 INFO L158 Benchmark]: Witness Printer took 17.14ms. Allocated memory is still 102.8MB. Free memory was 43.6MB in the beginning and 43.4MB in the end (delta: 238.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:06:56,393 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.32ms. Allocated memory is still 83.9MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 29.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.69ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 49.8MB in the beginning and 78.5MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.90ms. Allocated memory is still 102.8MB. Free memory was 78.5MB in the beginning and 77.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.48ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 76.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 267.66ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 66.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 465.05ms. Allocated memory is still 102.8MB. Free memory was 66.4MB in the beginning and 43.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 17.14ms. Allocated memory is still 102.8MB. Free memory was 43.6MB in the beginning and 43.4MB in the end (delta: 238.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=1) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=1) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 18 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-22 16:06:56,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/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_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0 --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 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 16:06:59,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 16:06:59,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 16:06:59,053 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 16:06:59,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 16:06:59,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 16:06:59,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 16:06:59,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 16:06:59,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 16:06:59,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 16:06:59,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 16:06:59,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 16:06:59,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 16:06:59,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 16:06:59,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 16:06:59,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 16:06:59,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 16:06:59,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 16:06:59,094 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 16:06:59,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 16:06:59,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 16:06:59,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 16:06:59,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 16:06:59,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 16:06:59,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 16:06:59,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 16:06:59,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 16:06:59,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 16:06:59,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 16:06:59,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 16:06:59,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 16:06:59,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 16:06:59,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 16:06:59,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 16:06:59,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 16:06:59,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 16:06:59,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 16:06:59,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 16:06:59,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 16:06:59,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 16:06:59,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 16:06:59,140 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-22 16:06:59,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 16:06:59,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 16:06:59,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 16:06:59,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 16:06:59,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 16:06:59,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 16:06:59,196 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 16:06:59,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 16:06:59,197 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 16:06:59,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 16:06:59,199 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 16:06:59,199 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 16:06:59,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 16:06:59,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 16:06:59,200 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 16:06:59,200 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 16:06:59,200 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 16:06:59,200 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 16:06:59,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 16:06:59,201 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 16:06:59,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 16:06:59,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 16:06:59,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 16:06:59,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 16:06:59,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:06:59,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 16:06:59,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 16:06:59,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 16:06:59,203 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 16:06:59,203 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 16:06:59,204 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 16:06:59,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 16:06:59,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 16:06:59,205 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 16:06:59,205 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 16:06:59,205 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_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/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_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0 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 -> 322f54fed62e27ecdc37b8dbd1ba5a40efbeb3c981a1a7430a57877b391f432f [2021-11-22 16:06:59,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 16:06:59,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 16:06:59,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 16:06:59,695 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 16:06:59,696 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 16:06:59,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-11-22 16:06:59,785 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/51f0da3c7/e4150109e5ac4f7193ef56801f9d92d3/FLAG9ea176073 [2021-11-22 16:07:00,408 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 16:07:00,409 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c [2021-11-22 16:07:00,418 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/51f0da3c7/e4150109e5ac4f7193ef56801f9d92d3/FLAG9ea176073 [2021-11-22 16:07:00,435 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/data/51f0da3c7/e4150109e5ac4f7193ef56801f9d92d3 [2021-11-22 16:07:00,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 16:07:00,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 16:07:00,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 16:07:00,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 16:07:00,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 16:07:00,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f0d8dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00, skipping insertion in model container [2021-11-22 16:07:00,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 16:07:00,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 16:07:00,671 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_92de3b06-d266-42c4-b98e-81fb7cd4959b/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-11-22 16:07:00,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:07:00,760 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 16:07:00,805 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_92de3b06-d266-42c4-b98e-81fb7cd4959b/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound1.c[712,725] [2021-11-22 16:07:00,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:07:00,834 INFO L208 MainTranslator]: Completed translation [2021-11-22 16:07:00,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00 WrapperNode [2021-11-22 16:07:00,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 16:07:00,838 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 16:07:00,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 16:07:00,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 16:07:00,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,898 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 44 [2021-11-22 16:07:00,898 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 16:07:00,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 16:07:00,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 16:07:00,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 16:07:00,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 16:07:00,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 16:07:00,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 16:07:00,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 16:07:00,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (1/1) ... [2021-11-22 16:07:00,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:07:00,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:07:00,991 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 16:07:01,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 16:07:01,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 16:07:01,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 16:07:01,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 16:07:01,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 16:07:01,119 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 16:07:01,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 16:07:06,168 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 16:07:06,173 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 16:07:06,174 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 16:07:06,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:07:06 BoogieIcfgContainer [2021-11-22 16:07:06,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 16:07:06,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 16:07:06,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 16:07:06,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 16:07:06,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:07:00" (1/3) ... [2021-11-22 16:07:06,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd7f73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:07:06, skipping insertion in model container [2021-11-22 16:07:06,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:07:00" (2/3) ... [2021-11-22 16:07:06,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd7f73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:07:06, skipping insertion in model container [2021-11-22 16:07:06,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:07:06" (3/3) ... [2021-11-22 16:07:06,184 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound1.c [2021-11-22 16:07:06,190 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 16:07:06,191 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-22 16:07:06,243 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 16:07:06,249 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-22 16:07:06,249 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-22 16:07:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 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-22 16:07:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 16:07:06,267 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:07:06,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:07:06,268 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:07:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:07:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-11-22 16:07:06,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:07:06,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45545099] [2021-11-22 16:07:06,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:07:06,305 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:07:06,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:07:06,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:07:06,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 16:07:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:07:06,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-22 16:07:06,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:07:06,771 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-22 16:07:06,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:07:06,803 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-22 16:07:06,804 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:07:06,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45545099] [2021-11-22 16:07:06,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45545099] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 16:07:06,805 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:07:06,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-22 16:07:06,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143767638] [2021-11-22 16:07:06,808 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 16:07:06,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-22 16:07:06,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:07:06,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-22 16:07:06,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 16:07:06,839 INFO L87 Difference]: Start difference. First operand has 18 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-22 16:07:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:07:06,852 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2021-11-22 16:07:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-22 16:07:06,855 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-11-22 16:07:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:07:06,862 INFO L225 Difference]: With dead ends: 33 [2021-11-22 16:07:06,862 INFO L226 Difference]: Without dead ends: 14 [2021-11-22 16:07:06,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-22 16:07:06,869 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:07:06,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-22 16:07:06,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-22 16:07:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-22 16:07:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 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-22 16:07:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-22 16:07:06,903 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2021-11-22 16:07:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:07:06,904 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-22 16:07:06,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-22 16:07:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-22 16:07:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 16:07:06,905 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:07:06,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:07:06,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 16:07:07,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:07:07,122 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:07:07,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:07:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-11-22 16:07:07,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:07:07,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615241086] [2021-11-22 16:07:07,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:07:07,124 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:07:07,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:07:07,128 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:07:07,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 16:07:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:07:09,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-22 16:07:09,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:07:23,892 WARN L227 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:08:17,809 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~a~0#1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1))))))) is different from true [2021-11-22 16:08:34,368 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~a~0#1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))))) is different from false [2021-11-22 16:08:36,406 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.geq |ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~a~0#1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))))) is different from true [2021-11-22 16:08:36,407 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-22 16:08:36,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:08:43,382 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-22 16:08:45,442 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-22 16:08:51,594 WARN L838 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) is different from false [2021-11-22 16:08:53,645 WARN L860 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) is different from true [2021-11-22 16:09:03,995 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from false [2021-11-22 16:09:06,048 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from true [2021-11-22 16:09:20,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_7| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_7|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) is different from false [2021-11-22 16:09:22,691 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_7| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_7|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) is different from true [2021-11-22 16:09:22,691 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-22 16:09:22,692 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:09:22,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615241086] [2021-11-22 16:09:22,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615241086] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 16:09:22,692 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:09:22,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-22 16:09:22,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921964913] [2021-11-22 16:09:22,693 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 16:09:22,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 16:09:22,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:09:22,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 16:09:22,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=28, Unknown=11, NotChecked=90, Total=156 [2021-11-22 16:09:22,696 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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-22 16:09:24,872 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_7| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_7|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-22 16:09:26,922 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_7| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_7|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_7| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-22 16:09:28,975 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse2 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse3)) (.cse1 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-22 16:09:31,028 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse2 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse3)) (.cse1 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:09:33,567 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))))) is different from true [2021-11-22 16:09:36,638 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-22 16:09:45,944 WARN L227 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:09:47,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:09:50,025 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:09:52,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:09:54,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:09:56,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:09:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:09:56,122 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2021-11-22 16:09:56,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:09:56,123 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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 7 [2021-11-22 16:09:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:09:56,124 INFO L225 Difference]: With dead ends: 18 [2021-11-22 16:09:56,124 INFO L226 Difference]: Without dead ends: 16 [2021-11-22 16:09:56,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 55.8s TimeCoverageRelationStatistics Valid=38, Invalid=41, Unknown=17, NotChecked=210, Total=306 [2021-11-22 16:09:56,127 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2021-11-22 16:09:56,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 4 Unknown, 58 Unchecked, 10.3s Time] [2021-11-22 16:09:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-22 16:09:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-22 16:09:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 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-22 16:09:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-11-22 16:09:56,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2021-11-22 16:09:56,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:09:56,135 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-11-22 16:09:56,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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-22 16:09:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-11-22 16:09:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 16:09:56,137 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:09:56,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:09:56,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-22 16:09:56,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:09:56,345 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:09:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:09:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1958471560, now seen corresponding path program 1 times [2021-11-22 16:09:56,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:09:56,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373967822] [2021-11-22 16:09:56,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:09:56,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:09:56,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:09:56,348 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:09:56,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 16:09:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:09:56,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 16:09:56,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:10:15,560 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2021-11-22 16:10:17,625 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from true [2021-11-22 16:10:23,833 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-22 16:10:25,899 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-22 16:10:42,471 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~r~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) currentRoundingMode |ULTIMATE.start_main_~r~0#1|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)))) is different from false [2021-11-22 16:10:42,481 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-22 16:10:42,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:11:05,358 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32))) is different from false [2021-11-22 16:11:07,428 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32))) is different from true [2021-11-22 16:11:07,448 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-22 16:11:07,449 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:11:07,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373967822] [2021-11-22 16:11:07,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373967822] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 16:11:07,449 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:11:07,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-22 16:11:07,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445563193] [2021-11-22 16:11:07,450 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 16:11:07,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 16:11:07,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:11:07,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 16:11:07,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=4, Unknown=7, NotChecked=20, Total=42 [2021-11-22 16:11:07,452 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:11:09,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:11:11,747 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)))) (and (or (and .cse0 (not .cse1)) (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))) (or .cse0 .cse1))) is different from false [2021-11-22 16:11:13,818 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)))) (and (or (and .cse0 (not .cse1)) (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))) (or .cse0 .cse1))) is different from true [2021-11-22 16:11:15,894 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~r~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) currentRoundingMode |ULTIMATE.start_main_~r~0#1|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)))) is different from false [2021-11-22 16:11:15,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:11:15,902 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2021-11-22 16:11:15,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-22 16:11:15,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-22 16:11:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:11:15,903 INFO L225 Difference]: With dead ends: 16 [2021-11-22 16:11:15,903 INFO L226 Difference]: Without dead ends: 12 [2021-11-22 16:11:15,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=15, Invalid=5, Unknown=10, NotChecked=42, Total=72 [2021-11-22 16:11:15,905 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-22 16:11:15,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 23 Unchecked, 2.2s Time] [2021-11-22 16:11:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-22 16:11:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-22 16:11:15,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 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-22 16:11:15,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-11-22 16:11:15,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2021-11-22 16:11:15,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:11:15,911 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-11-22 16:11:15,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:11:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-11-22 16:11:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-22 16:11:15,912 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:11:15,912 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:11:15,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 16:11:16,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:11:16,125 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:11:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:11:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1958431838, now seen corresponding path program 1 times [2021-11-22 16:11:16,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:11:16,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735562043] [2021-11-22 16:11:16,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:11:16,126 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:11:16,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:11:16,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:11:16,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 16:11:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:11:19,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-22 16:11:19,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:11:34,598 WARN L227 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:12:32,818 WARN L227 SmtUtils]: Spent 14.19s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:13:28,773 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse2) (let ((.cse3 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~a~0#1|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse3)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse3)))))) is different from false [2021-11-22 16:13:30,830 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse2) (let ((.cse3 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~a~0#1|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse3)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse3)))))) is different from true [2021-11-22 16:13:46,282 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~a~0#1|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse2)))) is different from false [2021-11-22 16:13:48,338 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~a~0#1|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse2)))) is different from true [2021-11-22 16:13:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-22 16:13:48,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:13:55,819 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-22 16:13:57,883 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-22 16:14:08,491 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from false [2021-11-22 16:14:10,575 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from true [2021-11-22 16:14:46,687 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-11-22 16:14:48,765 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-11-22 16:15:03,612 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-11-22 16:15:05,686 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-11-22 16:15:22,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_8| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_8|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) is different from false [2021-11-22 16:15:24,894 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_8| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_8|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) is different from true [2021-11-22 16:15:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-22 16:15:24,895 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:15:24,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735562043] [2021-11-22 16:15:24,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735562043] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:15:24,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 16:15:24,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2021-11-22 16:15:24,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547887631] [2021-11-22 16:15:24,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 16:15:24,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-22 16:15:24,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:15:24,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-22 16:15:24,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=35, Unknown=16, NotChecked=126, Total=210 [2021-11-22 16:15:24,898 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-22 16:15:26,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 16:15:28,486 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 16:15:30,663 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_8| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_8|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-22 16:15:32,736 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_8| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_8| .cse0)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_8|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2))))) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-22 16:15:34,811 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse0 (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2)) (.cse4 (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse3))) (or (and .cse0 (or (not .cse4) (not .cse5))) (and .cse5 .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-22 16:15:36,886 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse0 (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2)) (.cse4 (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse3))) (or (and .cse0 (or (not .cse4) (not .cse5))) (and .cse5 .cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:15:38,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.gt .cse2 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)))))) is different from false [2021-11-22 16:15:41,037 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.gt .cse2 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)))))) is different from true [2021-11-22 16:15:43,111 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-22 16:15:45,205 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-22 16:15:47,308 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-22 16:15:49,412 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:15:51,486 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse2) (let ((.cse3 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~a~0#1|) .cse2) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse3)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse3))))))) is different from false [2021-11-22 16:15:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:15:51,502 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2021-11-22 16:15:51,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-22 16:15:51,503 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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) Word has length 11 [2021-11-22 16:15:51,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:15:51,504 INFO L225 Difference]: With dead ends: 18 [2021-11-22 16:15:51,504 INFO L226 Difference]: Without dead ends: 16 [2021-11-22 16:15:51,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 90.7s TimeCoverageRelationStatistics Valid=45, Invalid=36, Unknown=27, NotChecked=312, Total=420 [2021-11-22 16:15:51,506 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-11-22 16:15:51,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 29 Unchecked, 3.7s Time] [2021-11-22 16:15:51,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-22 16:15:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-22 16:15:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 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-22 16:15:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-11-22 16:15:51,512 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2021-11-22 16:15:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:15:51,513 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-11-22 16:15:51,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 14 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-22 16:15:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-11-22 16:15:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 16:15:51,514 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:15:51,514 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-22 16:15:51,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 16:15:51,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:15:51,717 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:15:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:15:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash 898274709, now seen corresponding path program 2 times [2021-11-22 16:15:51,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:15:51,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583545717] [2021-11-22 16:15:51,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 16:15:51,720 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:15:51,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:15:51,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:15:51,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_92de3b06-d266-42c4-b98e-81fb7cd4959b/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 16:15:53,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 16:15:53,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:15:53,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-22 16:15:53,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:16:10,476 WARN L227 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:16:48,478 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:17:37,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-22 16:18:58,954 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (or (and (exists ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~r~0#1|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~r~0#1|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32)))))) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse0) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse0)))) is different from false [2021-11-22 16:19:01,026 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (or (and (exists ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~r~0#1|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~r~0#1|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32)))))) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse0) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) .cse0)))) is different from true [2021-11-22 16:19:22,287 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~r~0#1|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse1) (fp.gt .cse0 .cse1)))) is different from false [2021-11-22 16:19:24,359 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32)) (|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~r~0#1|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |ULTIMATE.start_main_~a~0#1| .cse1) (fp.gt .cse0 .cse1)))) is different from true [2021-11-22 16:19:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-22 16:19:24,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:19:30,986 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32))) is different from false [2021-11-22 16:19:33,050 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32))) is different from true [2021-11-22 16:19:40,193 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))))) (_ bv0 32)))) is different from true [2021-11-22 16:20:07,029 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32))))) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32))))))) (_ bv0 32))))) is different from false [2021-11-22 16:20:09,134 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32))))) (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32))))))) (_ bv0 32))))) is different from true [2021-11-22 16:20:52,252 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))) (_ bv0 32))) (not (fp.gt (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) is different from true [2021-11-22 16:21:06,108 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))))) (_ bv0 32))) (not (fp.gt (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32))))) is different from true [2021-11-22 16:21:27,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |v_ULTIMATE.start_main_~a~0#1_9|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| .cse1)) (not (fp.gt .cse0 .cse1))))) is different from false [2021-11-22 16:21:29,896 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |v_ULTIMATE.start_main_~a~0#1_9|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| .cse1)) (not (fp.gt .cse0 .cse1))))) is different from true [2021-11-22 16:21:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-11-22 16:21:29,897 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:21:29,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583545717] [2021-11-22 16:21:29,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583545717] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:21:29,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 16:21:29,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2021-11-22 16:21:29,898 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432367866] [2021-11-22 16:21:29,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 16:21:29,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-22 16:21:29,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:21:29,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-22 16:21:29,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=32, Unknown=15, NotChecked=190, Total=272 [2021-11-22 16:21:29,900 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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-22 16:21:32,010 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |v_ULTIMATE.start_main_~a~0#1_9|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| .cse1)) (not (fp.gt .cse0 .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false