./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY --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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:41:41,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:41:41,416 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:41:41,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:41:41,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:41:41,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:41:41,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:41:41,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:41:41,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:41:41,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:41:41,490 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:41:41,491 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:41:41,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:41:41,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:41:41,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:41:41,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:41:41,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:41:41,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:41:41,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:41:41,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:41:41,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:41:41,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:41:41,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:41:41,511 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:41:41,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:41:41,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:41:41,516 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:41:41,517 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:41:41,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:41:41,519 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:41:41,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:41:41,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:41:41,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:41:41,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:41:41,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:41:41,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:41:41,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:41:41,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:41:41,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:41:41,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:41:41,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:41:41,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-07 07:41:41,555 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:41:41,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:41:41,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:41:41,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:41:41,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:41:41,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:41:41,558 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:41:41,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:41:41,558 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:41:41,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 07:41:41,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:41:41,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:41:41,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 07:41:41,559 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 07:41:41,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 07:41:41,560 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:41:41,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:41:41,560 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:41:41,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 07:41:41,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:41:41,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:41:41,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 07:41:41,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:41:41,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:41:41,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 07:41:41,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 07:41:41,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-07 07:41:41,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 07:41:41,563 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 07:41:41,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 07:41:41,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 07:41:41,564 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:41:41,564 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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2021-11-07 07:41:41,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:41:41,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:41:41,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:41:41,908 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:41:41,909 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:41:41,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-11-07 07:41:42,009 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/7f79f4270/329b0a708dd54e8db072864fb1e428f1/FLAG0db08a26f [2021-11-07 07:41:42,481 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:41:42,481 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-11-07 07:41:42,493 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/7f79f4270/329b0a708dd54e8db072864fb1e428f1/FLAG0db08a26f [2021-11-07 07:41:42,871 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/7f79f4270/329b0a708dd54e8db072864fb1e428f1 [2021-11-07 07:41:42,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:41:42,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:41:42,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:41:42,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:41:42,893 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:41:42,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:41:42" (1/1) ... [2021-11-07 07:41:42,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1927b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:42, skipping insertion in model container [2021-11-07 07:41:42,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:41:42" (1/1) ... [2021-11-07 07:41:42,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:41:42,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:41:43,081 WARN L228 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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2021-11-07 07:41:43,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:41:43,125 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:41:43,138 WARN L228 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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2021-11-07 07:41:43,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:41:43,158 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:41:43,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43 WrapperNode [2021-11-07 07:41:43,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:41:43,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:41:43,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:41:43,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:41:43,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:41:43,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:41:43,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:41:43,199 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:41:43,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:41:43,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:41:43,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:41:43,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:41:43,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (1/1) ... [2021-11-07 07:41:43,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:41:43,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:41:43,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 07:41:43,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 07:41:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 07:41:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:41:43,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:41:43,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:41:43,515 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:41:43,516 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-07 07:41:43,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:43 BoogieIcfgContainer [2021-11-07 07:41:43,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:41:43,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 07:41:43,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 07:41:43,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 07:41:43,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:41:42" (1/3) ... [2021-11-07 07:41:43,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c8ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:41:43, skipping insertion in model container [2021-11-07 07:41:43,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:43" (2/3) ... [2021-11-07 07:41:43,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c8ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:41:43, skipping insertion in model container [2021-11-07 07:41:43,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:43" (3/3) ... [2021-11-07 07:41:43,528 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2021-11-07 07:41:43,534 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 07:41:43,535 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 07:41:43,589 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 07:41:43,596 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-07 07:41:43,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 07:41:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 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-07 07:41:43,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 07:41:43,618 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:41:43,619 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:41:43,619 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:41:43,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:41:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-11-07 07:41:43,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:41:43,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12392474] [2021-11-07 07:41:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:41:43,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:41:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:41:43,820 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-07 07:41:43,821 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-07 07:41:43,821 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12392474] [2021-11-07 07:41:43,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12392474] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 07:41:43,823 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:41:43,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 07:41:43,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963278577] [2021-11-07 07:41:43,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 07:41:43,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-07 07:41:43,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 07:41:43,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 07:41:43,848 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 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) 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-07 07:41:43,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:41:43,864 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-11-07 07:41:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 07:41:43,866 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-07 07:41:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:41:43,875 INFO L225 Difference]: With dead ends: 31 [2021-11-07 07:41:43,875 INFO L226 Difference]: Without dead ends: 13 [2021-11-07 07:41:43,878 INFO L786 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-07 07:41:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-07 07:41:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-07 07:41:43,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:41:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-11-07 07:41:43,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2021-11-07 07:41:43,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:41:43,911 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-11-07 07:41:43,912 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-07 07:41:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-11-07 07:41:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 07:41:43,912 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:41:43,913 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:41:43,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 07:41:43,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:41:43,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:41:43,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-11-07 07:41:43,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-07 07:41:43,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053712268] [2021-11-07 07:41:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:41:43,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 07:41:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:41:43,945 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 07:41:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 07:41:43,998 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-07 07:41:43,999 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 07:41:44,001 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 07:41:44,003 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 07:41:44,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 07:41:44,007 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-07 07:41:44,011 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 07:41:44,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:41:44 BoogieIcfgContainer [2021-11-07 07:41:44,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 07:41:44,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 07:41:44,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 07:41:44,031 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 07:41:44,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:43" (3/4) ... [2021-11-07 07:41:44,035 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-07 07:41:44,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 07:41:44,037 INFO L168 Benchmark]: Toolchain (without parser) took 1161.66 ms. Allocated memory is still 98.6 MB. Free memory was 60.7 MB in the beginning and 40.0 MB in the end (delta: 20.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 16.1 GB. [2021-11-07 07:41:44,038 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 98.6 MB. Free memory is still 76.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:41:44,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.47 ms. Allocated memory is still 98.6 MB. Free memory was 60.5 MB in the beginning and 74.7 MB in the end (delta: -14.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 07:41:44,040 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.73 ms. Allocated memory is still 98.6 MB. Free memory was 74.7 MB in the beginning and 73.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 07:41:44,041 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 98.6 MB. Free memory was 73.4 MB in the beginning and 72.3 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:41:44,042 INFO L168 Benchmark]: RCFGBuilder took 293.90 ms. Allocated memory is still 98.6 MB. Free memory was 72.3 MB in the beginning and 62.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 07:41:44,043 INFO L168 Benchmark]: TraceAbstraction took 509.72 ms. Allocated memory is still 98.6 MB. Free memory was 62.2 MB in the beginning and 40.4 MB in the end (delta: 21.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-07 07:41:44,043 INFO L168 Benchmark]: Witness Printer took 4.95 ms. Allocated memory is still 98.6 MB. Free memory is still 40.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 07:41:44,047 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.29 ms. Allocated memory is still 98.6 MB. Free memory is still 76.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 274.47 ms. Allocated memory is still 98.6 MB. Free memory was 60.5 MB in the beginning and 74.7 MB in the end (delta: -14.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.73 ms. Allocated memory is still 98.6 MB. Free memory was 74.7 MB in the beginning and 73.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 98.6 MB. Free memory was 73.4 MB in the beginning and 72.3 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 293.90 ms. Allocated memory is still 98.6 MB. Free memory was 72.3 MB in the beginning and 62.6 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 509.72 ms. Allocated memory is still 98.6 MB. Free memory was 62.2 MB in the beginning and 40.4 MB in the end (delta: 21.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Witness Printer took 4.95 ms. Allocated memory is still 98.6 MB. Free memory is still 40.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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() [L14] COND FALSE !(!cond) [L29] x = a / 2.0 [L30] r = 0 [L32] COND TRUE 1 [L17] COND TRUE !(cond) [L19] reach_error() - 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, 17 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, 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=17occurred 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-07 07:41:44,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY --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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 07:41:46,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 07:41:46,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 07:41:46,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 07:41:46,689 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 07:41:46,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 07:41:46,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 07:41:46,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 07:41:46,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 07:41:46,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 07:41:46,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 07:41:46,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 07:41:46,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 07:41:46,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 07:41:46,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 07:41:46,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 07:41:46,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 07:41:46,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 07:41:46,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 07:41:46,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 07:41:46,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 07:41:46,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 07:41:46,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 07:41:46,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 07:41:46,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 07:41:46,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 07:41:46,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 07:41:46,763 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 07:41:46,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 07:41:46,765 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 07:41:46,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 07:41:46,766 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 07:41:46,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 07:41:46,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 07:41:46,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 07:41:46,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 07:41:46,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 07:41:46,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 07:41:46,786 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 07:41:46,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 07:41:46,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 07:41:46,795 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-07 07:41:46,844 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 07:41:46,845 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 07:41:46,846 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-07 07:41:46,846 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-07 07:41:46,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 07:41:46,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 07:41:46,848 INFO L138 SettingsManager]: * Use SBE=true [2021-11-07 07:41:46,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 07:41:46,849 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 07:41:46,849 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 07:41:46,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 07:41:46,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 07:41:46,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 07:41:46,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 07:41:46,852 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-07 07:41:46,852 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-07 07:41:46,852 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 07:41:46,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 07:41:46,853 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 07:41:46,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 07:41:46,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 07:41:46,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-07 07:41:46,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 07:41:46,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:41:46,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 07:41:46,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 07:41:46,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 07:41:46,855 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-07 07:41:46,855 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-07 07:41:46,856 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-07 07:41:46,856 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-07 07:41:46,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 07:41:46,857 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 07:41:46,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 07:41:46,857 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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 [2021-11-07 07:41:47,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 07:41:47,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 07:41:47,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 07:41:47,319 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 07:41:47,320 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 07:41:47,321 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-11-07 07:41:47,412 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/89e2f57c1/d1852c1973164243a5828c533f25aa47/FLAGb5d75a493 [2021-11-07 07:41:47,997 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 07:41:47,998 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2021-11-07 07:41:48,005 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/89e2f57c1/d1852c1973164243a5828c533f25aa47/FLAGb5d75a493 [2021-11-07 07:41:48,361 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/data/89e2f57c1/d1852c1973164243a5828c533f25aa47 [2021-11-07 07:41:48,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 07:41:48,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 07:41:48,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 07:41:48,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 07:41:48,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 07:41:48,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4858ccd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48, skipping insertion in model container [2021-11-07 07:41:48,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 07:41:48,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 07:41:48,586 WARN L228 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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2021-11-07 07:41:48,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:41:48,615 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 07:41:48,629 WARN L228 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_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2021-11-07 07:41:48,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 07:41:48,693 INFO L208 MainTranslator]: Completed translation [2021-11-07 07:41:48,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48 WrapperNode [2021-11-07 07:41:48,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 07:41:48,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 07:41:48,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 07:41:48,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 07:41:48,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 07:41:48,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 07:41:48,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 07:41:48,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 07:41:48,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 07:41:48,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 07:41:48,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 07:41:48,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 07:41:48,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (1/1) ... [2021-11-07 07:41:48,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 07:41:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/z3 [2021-11-07 07:41:48,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 07:41:48,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 07:41:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-07 07:41:48,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 07:41:48,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 07:41:48,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 07:41:54,506 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 07:41:54,507 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-07 07:41:54,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:54 BoogieIcfgContainer [2021-11-07 07:41:54,509 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 07:41:54,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 07:41:54,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 07:41:54,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 07:41:54,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:41:48" (1/3) ... [2021-11-07 07:41:54,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4ed918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:41:54, skipping insertion in model container [2021-11-07 07:41:54,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:41:48" (2/3) ... [2021-11-07 07:41:54,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4ed918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:41:54, skipping insertion in model container [2021-11-07 07:41:54,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:41:54" (3/3) ... [2021-11-07 07:41:54,518 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2021-11-07 07:41:54,525 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 07:41:54,525 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 07:41:54,578 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 07:41:54,585 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-07 07:41:54,586 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 07:41:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 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-07 07:41:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 07:41:54,608 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:41:54,609 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:41:54,609 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:41:54,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:41:54,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-11-07 07:41:54,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:41:54,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55841277] [2021-11-07 07:41:54,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:41:54,631 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:41:54,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:41:54,640 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:41:54,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-07 07:41:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:41:55,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-07 07:41:55,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:41:55,184 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-07 07:41:55,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:41:55,222 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-07 07:41:55,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:41:55,224 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55841277] [2021-11-07 07:41:55,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55841277] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 07:41:55,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:41:55,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-07 07:41:55,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695629769] [2021-11-07 07:41:55,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-07 07:41:55,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:41:55,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-07 07:41:55,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-07 07:41:55,250 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 16 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) 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-07 07:41:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:41:55,269 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-11-07 07:41:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-07 07:41:55,271 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-07 07:41:55,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:41:55,277 INFO L225 Difference]: With dead ends: 31 [2021-11-07 07:41:55,278 INFO L226 Difference]: Without dead ends: 13 [2021-11-07 07:41:55,280 INFO L786 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-07 07:41:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-07 07:41:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-07 07:41:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:41:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-11-07 07:41:55,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2021-11-07 07:41:55,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:41:55,312 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-11-07 07:41:55,313 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-07 07:41:55,313 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-11-07 07:41:55,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-07 07:41:55,314 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:41:55,314 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:41:55,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-07 07:41:55,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:41:55,529 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:41:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:41:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-11-07 07:41:55,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:41:55,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461238863] [2021-11-07 07:41:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:41:55,531 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:41:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:41:55,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:41:55,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-07 07:41:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:41:57,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-07 07:41:57,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:42:10,233 WARN L207 SmtUtils]: Spent 5.55 s on a formula simplification that was a NOOP. DAG size: 18 [2021-11-07 07:43:03,326 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.geq ULTIMATE.start_main_~a~0 .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~a~0) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse1) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse1)))))) is different from false [2021-11-07 07:43:05,361 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.geq ULTIMATE.start_main_~a~0 .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~a~0) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse1) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse1)))))) is different from true [2021-11-07 07:43:20,527 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~a~0) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.geq ULTIMATE.start_main_~a~0 .cse0)))) is different from false [2021-11-07 07:43:22,564 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~a~0) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.geq ULTIMATE.start_main_~a~0 .cse0)))) is different from true [2021-11-07 07:43:22,565 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-07 07:43:22,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:43:29,877 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from false [2021-11-07 07:43:31,937 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from true [2021-11-07 07:43:37,387 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) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) is different from false [2021-11-07 07:43:39,436 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) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) is different from true [2021-11-07 07:43:47,411 WARN L838 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ 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) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from false [2021-11-07 07:43:49,463 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ 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) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from true [2021-11-07 07:44:02,651 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.geq v_ULTIMATE.start_main_~a~0_9 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_9) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) is different from false [2021-11-07 07:44:04,698 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.geq v_ULTIMATE.start_main_~a~0_9 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_9) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) is different from true [2021-11-07 07:44:04,698 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-07 07:44:04,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:44:04,699 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461238863] [2021-11-07 07:44:04,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461238863] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 07:44:04,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:44:04,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-07 07:44:04,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788869748] [2021-11-07 07:44:04,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-07 07:44:04,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:44:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-07 07:44:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=27, Unknown=12, NotChecked=90, Total=156 [2021-11-07 07:44:04,703 INFO L87 Difference]: Start difference. First operand 13 states and 13 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-07 07:44:06,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~a~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_9 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (not (fp.geq v_ULTIMATE.start_main_~a~0_9 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_9) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 07:44:09,568 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse0 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1) (and (or (not .cse1) (not .cse0)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse2 (= (_ 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) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))))) is different from false [2021-11-07 07:44:11,621 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse1 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse0 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1) (and (or (not .cse1) (not .cse0)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse2 (= (_ 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) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))))) is different from true [2021-11-07 07:44:14,948 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 .cse0) (= 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) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from true [2021-11-07 07:44:16,997 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) (= c_ULTIMATE.start_main_~r~0 (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) is different from false [2021-11-07 07:44:19,057 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) (= c_ULTIMATE.start_main_~r~0 (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) is different from true [2021-11-07 07:44:21,113 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.geq ULTIMATE.start_main_~a~0 .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~a~0) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse1) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse1))))))) is different from false [2021-11-07 07:44:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:44:44,364 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-07 07:44:44,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-07 07:44:44,425 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-07 07:44:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:44:44,426 INFO L225 Difference]: With dead ends: 20 [2021-11-07 07:44:44,426 INFO L226 Difference]: Without dead ends: 18 [2021-11-07 07:44:44,428 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=37, Invalid=30, Unknown=19, NotChecked=220, Total=306 [2021-11-07 07:44:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-07 07:44:44,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2021-11-07 07:44:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 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-07 07:44:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-11-07 07:44:44,433 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2021-11-07 07:44:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:44:44,433 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-11-07 07:44:44,433 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-07 07:44:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-11-07 07:44:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 07:44:44,434 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:44:44,435 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:44:44,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-07 07:44:44,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:44:44,649 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:44:44,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:44:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1864186656, now seen corresponding path program 1 times [2021-11-07 07:44:44,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:44:44,651 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626119005] [2021-11-07 07:44:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:44:44,651 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:44:44,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:44:44,653 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:44:44,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-07 07:44:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:44:48,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-07 07:44:48,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:45:38,764 WARN L207 SmtUtils]: Spent 9.72 s on a formula simplification that was a NOOP. DAG size: 20 [2021-11-07 07:46:35,236 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~a~0) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) is different from false [2021-11-07 07:46:37,280 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~a~0) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) is different from true [2021-11-07 07:46:53,896 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.gt .cse0 .cse1) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~a~0) .cse2)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))))) is different from false [2021-11-07 07:46:55,943 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.gt .cse0 .cse1) (not (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~a~0) .cse2)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1))))))))) is different from true [2021-11-07 07:46:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-07 07:46:55,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:47:03,515 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from false [2021-11-07 07:47:05,572 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from true [2021-11-07 07:47:16,042 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse1)))) is different from false [2021-11-07 07:47:18,113 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse1)))) is different from true [2021-11-07 07:47:45,346 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~a~0) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)))) is different from false [2021-11-07 07:47:47,407 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~a~0) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)))) is different from true [2021-11-07 07:48:02,050 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~a~0) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-11-07 07:48:04,111 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~a~0) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-11-07 07:48:20,933 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_10 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_10 ((_ 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_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_10) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) is different from false [2021-11-07 07:48:22,992 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_10 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_10 ((_ 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_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_10) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) is different from true [2021-11-07 07:48:22,992 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-07 07:48:22,993 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:48:22,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626119005] [2021-11-07 07:48:22,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626119005] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 07:48:22,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:48:22,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2021-11-07 07:48:22,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008271642] [2021-11-07 07:48:22,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-07 07:48:22,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:48:22,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-07 07:48:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=37, Unknown=14, NotChecked=126, Total=210 [2021-11-07 07:48:22,995 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-07 07:48:25,059 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~a~0_10 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_10 ((_ 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_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_10) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-07 07:48:27,121 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~a~0_10 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_10 ((_ 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_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~a~0_10) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-07 07:48:29,181 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (let ((.cse1 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse0 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1) (and (or (not .cse1) (not .cse0)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~a~0) .cse4)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse5 .cse3)))) (_ bv0 32)) (not (fp.gt .cse5 .cse3)) .cse2)))) is different from false [2021-11-07 07:48:31,243 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse2 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (let ((.cse1 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse0 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1) (and (or (not .cse1) (not .cse0)) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~a~0) .cse4)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse5 .cse3)))) (_ bv0 32)) (not (fp.gt .cse5 .cse3)) .cse2)))) is different from true [2021-11-07 07:48:33,302 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq c_ULTIMATE.start_main_~a~0 .cse0) (let ((.cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~a~0) .cse1)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)) (not (fp.gt .cse2 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from false [2021-11-07 07:48:35,374 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 .cse0) (let ((.cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~a~0) .cse1)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)) (not (fp.gt .cse2 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from true [2021-11-07 07:48:37,443 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_ULTIMATE.start_main_~r~0 (_ bv0 32)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse1)))) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) is different from false [2021-11-07 07:48:39,512 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= c_ULTIMATE.start_main_~r~0 (_ bv0 32)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse1)))) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) is different from true [2021-11-07 07:48:41,579 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~r~0 (_ bv1 32)) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) (fp.gt .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from false [2021-11-07 07:48:43,663 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~r~0 (_ bv1 32)) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) (fp.gt .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from true [2021-11-07 07:48:45,727 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 ULTIMATE.start_main_~a~0) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse2 .cse3))))))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-11-07 07:49:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:49:11,989 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-11-07 07:49:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-07 07:49:12,044 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 10 [2021-11-07 07:49:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:49:12,044 INFO L225 Difference]: With dead ends: 23 [2021-11-07 07:49:12,045 INFO L226 Difference]: Without dead ends: 21 [2021-11-07 07:49:12,045 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=45, Invalid=38, Unknown=25, NotChecked=312, Total=420 [2021-11-07 07:49:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-07 07:49:12,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2021-11-07 07:49:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:49:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-11-07 07:49:12,049 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2021-11-07 07:49:12,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:49:12,049 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-11-07 07:49:12,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-07 07:49:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-11-07 07:49:12,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 07:49:12,050 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:49:12,050 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 07:49:12,068 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-07 07:49:12,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:49:12,251 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:49:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:49:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1864227371, now seen corresponding path program 1 times [2021-11-07 07:49:12,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:49:12,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470116771] [2021-11-07 07:49:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 07:49:12,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:49:12,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:49:12,254 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:49:12,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-07 07:49:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 07:49:12,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-07 07:49:12,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:49:31,347 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) is different from false [2021-11-07 07:49:33,405 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) is different from true [2021-11-07 07:49:39,585 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from false [2021-11-07 07:49:41,645 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from true [2021-11-07 07:49:54,034 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (ULTIMATE.start_main_~r~0 (_ BitVec 32))) (= ((_ 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 ULTIMATE.start_main_~r~0)) ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) currentRoundingMode ULTIMATE.start_main_~r~0)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) ULTIMATE.start_main_~x~0))) (_ bv0 32))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-07 07:49:54,045 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-07 07:49:54,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:50:12,692 WARN L838 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32))) is different from false [2021-11-07 07:50:14,752 WARN L860 $PredicateComparison]: unable to prove that (or (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32))) is different from true [2021-11-07 07:50:14,765 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-07 07:50:14,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:50:14,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470116771] [2021-11-07 07:50:14,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470116771] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 07:50:14,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-07 07:50:14,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-07 07:50:14,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863433072] [2021-11-07 07:50:14,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 07:50:14,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:50:14,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 07:50:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=4, Unknown=7, NotChecked=20, Total=42 [2021-11-07 07:50:14,768 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-07 07:50:19,016 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (.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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)))) (and (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and .cse1 (not .cse0))) (or .cse1 .cse0))) is different from false [2021-11-07 07:50:21,081 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (.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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)))) (and (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and .cse1 (not .cse0))) (or .cse1 .cse0))) is different from true [2021-11-07 07:50:23,145 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (ULTIMATE.start_main_~r~0 (_ BitVec 32))) (= ((_ 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 ULTIMATE.start_main_~r~0)) ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) currentRoundingMode ULTIMATE.start_main_~r~0)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) ULTIMATE.start_main_~x~0))) (_ bv0 32))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-07 07:50:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:50:23,151 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2021-11-07 07:50:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 07:50:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 10 [2021-11-07 07:50:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:50:23,152 INFO L225 Difference]: With dead ends: 18 [2021-11-07 07:50:23,152 INFO L226 Difference]: Without dead ends: 14 [2021-11-07 07:50:23,152 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=15, Invalid=5, Unknown=10, NotChecked=42, Total=72 [2021-11-07 07:50:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-07 07:50:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-07 07:50:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) 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-07 07:50:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-07 07:50:23,155 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2021-11-07 07:50:23,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:50:23,156 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-07 07:50:23,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-07 07:50:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-07 07:50:23,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-07 07:50:23,157 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:50:23,157 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-07 07:50:23,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-07 07:50:23,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:50:23,365 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:50:23,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:50:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2052598129, now seen corresponding path program 2 times [2021-11-07 07:50:23,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:50:23,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257700471] [2021-11-07 07:50:23,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-07 07:50:23,366 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:50:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:50:23,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:50:23,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-07 07:50:27,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-07 07:50:27,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-07 07:50:28,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-07 07:50:28,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 07:50:42,574 WARN L207 SmtUtils]: Spent 5.22 s on a formula simplification that was a NOOP. DAG size: 18 [2021-11-07 07:51:16,731 WARN L207 SmtUtils]: Spent 5.54 s on a formula simplification that was a NOOP. DAG size: 20 [2021-11-07 07:51:49,060 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~r~0)))) (and (fp.gt .cse0 .cse1) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .cse1)) (= (_ bv2 32) c_ULTIMATE.start_main_~r~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from false [2021-11-07 07:52:47,856 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) ULTIMATE.start_main_~a~0) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3))))) (_ bv0 32)))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) is different from false [2021-11-07 07:52:49,909 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) ULTIMATE.start_main_~a~0) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3))))) (_ bv0 32)))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) is different from true [2021-11-07 07:53:06,707 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) ULTIMATE.start_main_~a~0) .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse0 .cse1))))) (_ bv0 32)))))) is different from false [2021-11-07 07:53:08,757 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) ULTIMATE.start_main_~a~0) .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse0 .cse1))))) (_ bv0 32)))))) is different from true [2021-11-07 07:53:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-07 07:53:08,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 07:53:18,147 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from false [2021-11-07 07:53:20,203 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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) is different from true [2021-11-07 07:53:30,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse1)))) is different from false [2021-11-07 07:53:32,831 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse1)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse1)))) is different from true [2021-11-07 07:54:04,841 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (let ((.cse1 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32))))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv2 32) c_ULTIMATE.start_main_~r~0))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse3))))) is different from false [2021-11-07 07:54:06,954 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (let ((.cse1 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32))))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv2 32) c_ULTIMATE.start_main_~r~0))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse3))))) is different from true [2021-11-07 07:54:45,751 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ 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 (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse0 .cse1))))) (_ bv0 32)))) is different from false [2021-11-07 07:54:47,841 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ 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 (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse0 .cse1))))) (_ bv0 32)))) is different from true [2021-11-07 07:55:02,682 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ 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 (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse0 .cse1))))) (_ bv0 32)) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-11-07 07:55:04,769 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ 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 (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse0 .cse1))))) (_ bv0 32)) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-11-07 07:55:22,037 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) v_ULTIMATE.start_main_~a~0_11) .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 .cse2))))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) is different from false [2021-11-07 07:55:24,125 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) v_ULTIMATE.start_main_~a~0_11) .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 .cse2))))) (_ bv0 32)) (not (fp.gt .cse1 .cse2))))) is different from true [2021-11-07 07:55:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-11-07 07:55:24,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-07 07:55:24,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257700471] [2021-11-07 07:55:24,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257700471] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-07 07:55:24,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-07 07:55:24,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2021-11-07 07:55:24,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655899420] [2021-11-07 07:55:24,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 07:55:24,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-07 07:55:24,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 07:55:24,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=38, Unknown=17, NotChecked=180, Total=272 [2021-11-07 07:55:24,129 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:55:28,293 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~a~0_11 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) v_ULTIMATE.start_main_~a~0_11) .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 .cse2))))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)))))) is different from false [2021-11-07 07:55:30,377 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~a~0_11 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) v_ULTIMATE.start_main_~a~0_11) .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse1 .cse2))))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)))))) is different from true [2021-11-07 07:55:32,467 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse0 .cse1))))) (_ bv0 32)) .cse3)) (let ((.cse6 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse5 (fp.geq c_ULTIMATE.start_main_~a~0 .cse4))) (or (and .cse5 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse6) (and (or (not .cse6) (not .cse5)) .cse3))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-07 07:55:34,552 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse0 .cse1))))) (_ bv0 32)) .cse3)) (let ((.cse6 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) (.cse5 (fp.geq c_ULTIMATE.start_main_~a~0 .cse4))) (or (and .cse5 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse6) (and (or (not .cse6) (not .cse5)) .cse3))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-07 07:55:36,646 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq c_ULTIMATE.start_main_~a~0 .cse0) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) .cse0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse1 .cse2))))) (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from false [2021-11-07 07:55:38,735 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 .cse0) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) .cse0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (or (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv4 32)) c_ULTIMATE.start_main_~a~0) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse1 .cse2))))) (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from true [2021-11-07 07:55:40,838 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (let ((.cse1 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32))))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv2 32) c_ULTIMATE.start_main_~r~0))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse3))))) (= c_ULTIMATE.start_main_~r~0 (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) is different from false [2021-11-07 07:55:42,951 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (let ((.cse1 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32))))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 (bvadd (_ bv2 32) c_ULTIMATE.start_main_~r~0))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse0 .cse0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse3))))) (= c_ULTIMATE.start_main_~r~0 (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32)))) is different from true [2021-11-07 07:55:45,039 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~r~0 (_ bv1 32)) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.gt .cse0 .cse1) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse2 .cse2)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse3)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from false [2021-11-07 07:55:47,152 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~r~0 (_ bv1 32)) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .cse1)) (fp.gt .cse0 .cse1) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 (bvadd c_ULTIMATE.start_main_~r~0 (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse2 .cse2)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~x~0 .cse3)))) (_ bv0 32)) (not (fp.gt c_ULTIMATE.start_main_~x~0 .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from true [2021-11-07 07:55:49,236 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~r~0)))) (and (fp.gt .cse0 .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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .cse1)) (= (_ bv2 32) c_ULTIMATE.start_main_~r~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from false [2021-11-07 07:55:51,341 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) c_ULTIMATE.start_main_~r~0)))) (and (fp.gt .cse0 .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 c_ULTIMATE.start_main_~r~0)) c_ULTIMATE.start_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_ULTIMATE.start_main_~x~0))) (_ bv0 32)) (= c_ULTIMATE.start_main_~x~0 (fp.sub c_currentRoundingMode .cse0 .cse1)) (= (_ bv2 32) c_ULTIMATE.start_main_~r~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv50 32))))) is different from true [2021-11-07 07:55:53,434 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~a~0 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv4 32)) ULTIMATE.start_main_~a~0) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3))))) (_ bv0 32)))) (or (and .cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (not .cse0)))) (fp.gt .cse2 .cse3)))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-11-07 07:56:10,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 07:56:10,736 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-11-07 07:56:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-07 07:56:10,806 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-07 07:56:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 07:56:10,807 INFO L225 Difference]: With dead ends: 21 [2021-11-07 07:56:10,807 INFO L226 Difference]: Without dead ends: 19 [2021-11-07 07:56:10,808 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 89.9s TimeCoverageRelationStatistics Valid=51, Invalid=39, Unknown=30, NotChecked=432, Total=552 [2021-11-07 07:56:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-07 07:56:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-07 07:56:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:56:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-11-07 07:56:10,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2021-11-07 07:56:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 07:56:10,814 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-11-07 07:56:10,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 16 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 07:56:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-11-07 07:56:10,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 07:56:10,816 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 07:56:10,816 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-07 07:56:10,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-07 07:56:11,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 [2021-11-07 07:56:11,017 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 07:56:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 07:56:11,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1496534400, now seen corresponding path program 3 times [2021-11-07 07:56:11,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-07 07:56:11,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811117492] [2021-11-07 07:56:11,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-07 07:56:11,019 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-07 07:56:11,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat [2021-11-07 07:56:11,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-07 07:56:11,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2e4972e-dbcf-4b33-817c-c958f4b8b5ac/bin/uautomizer-AkOaLMaTGY/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process