./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU --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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:05:31,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:05:31,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:05:31,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:05:31,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:05:31,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:05:31,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:05:31,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:05:31,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:05:31,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:05:31,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:05:31,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:05:31,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:05:31,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:05:31,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:05:31,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:05:31,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:05:31,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:05:31,819 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:05:31,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:05:31,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:05:31,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:05:31,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:05:31,828 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:05:31,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:05:31,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:05:31,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:05:31,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:05:31,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:05:31,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:05:31,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:05:31,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:05:31,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:05:31,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:05:31,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:05:31,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:05:31,841 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:05:31,841 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:05:31,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:05:31,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:05:31,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:05:31,845 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 22:05:31,869 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:05:31,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:05:31,870 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:05:31,870 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:05:31,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:05:31,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:05:31,872 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:05:31,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:05:31,872 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:05:31,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:05:31,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:05:31,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:05:31,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:05:31,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:05:31,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:05:31,873 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:05:31,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:05:31,874 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:05:31,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:05:31,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:05:31,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:05:31,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:05:31,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:05:31,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:05:31,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:05:31,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:05:31,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:05:31,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:05:31,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:05:31,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:05:31,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:05:31,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:05:31,876 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_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/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_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2021-11-02 22:05:32,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:05:32,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:05:32,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:05:32,156 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:05:32,157 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:05:32,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-02 22:05:32,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/17b035e48/5d62328df9ef4ecfa174933e8048537f/FLAG134c43233 [2021-11-02 22:05:32,686 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:05:32,687 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-02 22:05:32,695 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/17b035e48/5d62328df9ef4ecfa174933e8048537f/FLAG134c43233 [2021-11-02 22:05:33,077 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/17b035e48/5d62328df9ef4ecfa174933e8048537f [2021-11-02 22:05:33,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:05:33,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:05:33,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:05:33,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:05:33,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:05:33,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c571d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33, skipping insertion in model container [2021-11-02 22:05:33,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:05:33,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:05:33,270 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_88ad5909-9690-47c9-a2d4-5272816915d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-02 22:05:33,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:05:33,304 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:05:33,315 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_88ad5909-9690-47c9-a2d4-5272816915d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-02 22:05:33,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:05:33,331 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:05:33,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33 WrapperNode [2021-11-02 22:05:33,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:05:33,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:05:33,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:05:33,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:05:33,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:05:33,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:05:33,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:05:33,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:05:33,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:05:33,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:05:33,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:05:33,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:05:33,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (1/1) ... [2021-11-02 22:05:33,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:05:33,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:05:33,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:05:33,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:05:33,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:05:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:05:33,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:05:33,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:05:33,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:05:33,628 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-02 22:05:33,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:33 BoogieIcfgContainer [2021-11-02 22:05:33,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:05:33,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:05:33,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:05:33,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:05:33,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:05:33" (1/3) ... [2021-11-02 22:05:33,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f235d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:05:33, skipping insertion in model container [2021-11-02 22:05:33,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:33" (2/3) ... [2021-11-02 22:05:33,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f235d1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:05:33, skipping insertion in model container [2021-11-02 22:05:33,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:33" (3/3) ... [2021-11-02 22:05:33,656 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2021-11-02 22:05:33,661 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:05:33,662 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-02 22:05:33,715 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:05:33,723 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-02 22:05:33,723 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-02 22:05:33,749 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-02 22:05:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:05:33,754 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:33,755 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:33,757 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:05:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-11-02 22:05:33,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:33,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992549285] [2021-11-02 22:05:33,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:33,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:33,920 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-02 22:05:33,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:05:33,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992549285] [2021-11-02 22:05:33,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992549285] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:33,923 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:33,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-02 22:05:33,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467266786] [2021-11-02 22:05:33,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 22:05:33,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:05:33,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 22:05:33,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 22:05:33,964 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-02 22:05:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:33,984 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-11-02 22:05:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 22:05:33,986 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-02 22:05:33,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:33,998 INFO L225 Difference]: With dead ends: 31 [2021-11-02 22:05:33,998 INFO L226 Difference]: Without dead ends: 13 [2021-11-02 22:05:34,003 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-02 22:05:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-02 22:05:34,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-02 22:05:34,033 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-02 22:05:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-11-02 22:05:34,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2021-11-02 22:05:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:34,038 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-11-02 22:05:34,039 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-02 22:05:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-11-02 22:05:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:05:34,040 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:34,040 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:34,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:05:34,042 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:05:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:34,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-11-02 22:05:34,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:05:34,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248228162] [2021-11-02 22:05:34,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:34,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:05:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:05:34,106 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:05:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:05:34,181 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:05:34,181 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:05:34,183 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 22:05:34,185 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 22:05:34,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:05:34,190 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-02 22:05:34,193 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:05:34,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:05:34 BoogieIcfgContainer [2021-11-02 22:05:34,225 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:05:34,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:05:34,226 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:05:34,227 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:05:34,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:33" (3/4) ... [2021-11-02 22:05:34,231 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 22:05:34,231 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:05:34,234 INFO L168 Benchmark]: Toolchain (without parser) took 1151.49 ms. Allocated memory is still 153.1 MB. Free memory was 117.8 MB in the beginning and 94.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 22.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:34,235 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 153.1 MB. Free memory is still 134.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:05:34,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.32 ms. Allocated memory is still 153.1 MB. Free memory was 117.6 MB in the beginning and 129.5 MB in the end (delta: -11.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:34,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.16 ms. Allocated memory is still 153.1 MB. Free memory was 129.5 MB in the beginning and 127.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:34,243 INFO L168 Benchmark]: Boogie Preprocessor took 23.75 ms. Allocated memory is still 153.1 MB. Free memory was 127.9 MB in the beginning and 126.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:05:34,249 INFO L168 Benchmark]: RCFGBuilder took 240.22 ms. Allocated memory is still 153.1 MB. Free memory was 126.9 MB in the beginning and 117.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:34,251 INFO L168 Benchmark]: TraceAbstraction took 592.82 ms. Allocated memory is still 153.1 MB. Free memory was 116.8 MB in the beginning and 94.8 MB in the end (delta: 21.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:05:34,251 INFO L168 Benchmark]: Witness Printer took 5.27 ms. Allocated memory is still 153.1 MB. Free memory was 94.6 MB in the beginning and 94.3 MB in the end (delta: 276.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:05:34,257 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.27 ms. Allocated memory is still 153.1 MB. Free memory is still 134.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 249.32 ms. Allocated memory is still 153.1 MB. Free memory was 117.6 MB in the beginning and 129.5 MB in the end (delta: -11.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 32.16 ms. Allocated memory is still 153.1 MB. Free memory was 129.5 MB in the beginning and 127.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 23.75 ms. Allocated memory is still 153.1 MB. Free memory was 127.9 MB in the beginning and 126.9 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 240.22 ms. Allocated memory is still 153.1 MB. Free memory was 126.9 MB in the beginning and 117.1 MB in the end (delta: 9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 592.82 ms. Allocated memory is still 153.1 MB. Free memory was 116.8 MB in the beginning and 94.8 MB in the end (delta: 21.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.27 ms. Allocated memory is still 153.1 MB. Free memory was 94.6 MB in the beginning and 94.3 MB in the end (delta: 276.2 kB). 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-02 22:05:34,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/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_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU --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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:05:36,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:05:36,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:05:36,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:05:36,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:05:36,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:05:36,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:05:36,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:05:36,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:05:36,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:05:36,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:05:36,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:05:36,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:05:36,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:05:36,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:05:36,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:05:36,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:05:36,953 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:05:36,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:05:36,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:05:36,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:05:36,967 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:05:36,970 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:05:36,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:05:36,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:05:36,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:05:36,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:05:36,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:05:36,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:05:36,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:05:36,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:05:36,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:05:36,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:05:36,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:05:36,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:05:36,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:05:37,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:05:37,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:05:37,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:05:37,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:05:37,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:05:37,009 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-02 22:05:37,055 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:05:37,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:05:37,056 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:05:37,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:05:37,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:05:37,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:05:37,059 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:05:37,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:05:37,060 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:05:37,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:05:37,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:05:37,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:05:37,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:05:37,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:05:37,062 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 22:05:37,063 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 22:05:37,063 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:05:37,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:05:37,063 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:05:37,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:05:37,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:05:37,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:05:37,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:05:37,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:05:37,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:05:37,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:05:37,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:05:37,066 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 22:05:37,066 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 22:05:37,067 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:05:37,067 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:05:37,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:05:37,067 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:05:37,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 22:05:37,068 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_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/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_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2021-11-02 22:05:37,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:05:37,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:05:37,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:05:37,541 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:05:37,542 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:05:37,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-02 22:05:37,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/4482b8758/34db65ce38fa4ff987c066373e81d4b6/FLAGce485ffc3 [2021-11-02 22:05:38,179 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:05:38,180 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-02 22:05:38,188 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/4482b8758/34db65ce38fa4ff987c066373e81d4b6/FLAGce485ffc3 [2021-11-02 22:05:38,551 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/data/4482b8758/34db65ce38fa4ff987c066373e81d4b6 [2021-11-02 22:05:38,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:05:38,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:05:38,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:05:38,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:05:38,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:05:38,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d22fdb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38, skipping insertion in model container [2021-11-02 22:05:38,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:05:38,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:05:38,804 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_88ad5909-9690-47c9-a2d4-5272816915d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-02 22:05:38,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:05:38,840 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:05:38,859 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_88ad5909-9690-47c9-a2d4-5272816915d1/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-02 22:05:38,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:05:38,907 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:05:38,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38 WrapperNode [2021-11-02 22:05:38,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:05:38,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:05:38,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:05:38,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:05:38,920 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:05:38,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:05:38,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:05:38,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:05:38,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:38,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:39,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:39,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:39,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:05:39,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:05:39,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:05:39,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:05:39,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (1/1) ... [2021-11-02 22:05:39,016 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:05:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:05:39,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:05:39,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:05:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 22:05:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:05:39,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:05:39,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:05:44,454 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:05:44,454 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-11-02 22:05:44,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:44 BoogieIcfgContainer [2021-11-02 22:05:44,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:05:44,458 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:05:44,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:05:44,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:05:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:05:38" (1/3) ... [2021-11-02 22:05:44,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661090c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:05:44, skipping insertion in model container [2021-11-02 22:05:44,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:05:38" (2/3) ... [2021-11-02 22:05:44,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661090c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:05:44, skipping insertion in model container [2021-11-02 22:05:44,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:05:44" (3/3) ... [2021-11-02 22:05:44,465 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2021-11-02 22:05:44,470 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:05:44,471 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-02 22:05:44,523 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:05:44,530 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-02 22:05:44,530 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-02 22:05:44,543 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-02 22:05:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:05:44,547 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:44,548 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:44,549 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:05:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:44,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1804972333, now seen corresponding path program 1 times [2021-11-02 22:05:44,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:05:44,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46336650] [2021-11-02 22:05:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:44,572 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:05:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:05:44,576 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:05:44,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 22:05:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:45,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-02 22:05:45,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:05:45,068 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-02 22:05:45,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:05:45,110 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-02 22:05:45,111 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:05:45,111 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46336650] [2021-11-02 22:05:45,111 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46336650] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:05:45,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:05:45,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-02 22:05:45,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027708428] [2021-11-02 22:05:45,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-02 22:05:45,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:05:45,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-02 22:05:45,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-02 22:05:45,133 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-02 22:05:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:05:45,147 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2021-11-02 22:05:45,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-02 22:05:45,149 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-02 22:05:45,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:05:45,156 INFO L225 Difference]: With dead ends: 31 [2021-11-02 22:05:45,157 INFO L226 Difference]: Without dead ends: 13 [2021-11-02 22:05:45,159 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-02 22:05:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-02 22:05:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-02 22:05:45,187 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-02 22:05:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-11-02 22:05:45,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2021-11-02 22:05:45,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:05:45,189 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-11-02 22:05:45,190 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-02 22:05:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-11-02 22:05:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-02 22:05:45,191 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:05:45,192 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:05:45,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-02 22:05:45,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:05:45,414 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:05:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:05:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1806819375, now seen corresponding path program 1 times [2021-11-02 22:05:45,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:05:45,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265947837] [2021-11-02 22:05:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:05:45,416 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:05:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:05:45,422 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:05:45,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 22:05:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:05:47,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-02 22:05:47,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:06:40,716 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.geq ULTIMATE.start_main_~a~0 .cse0) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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-02 22:06:42,750 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.geq ULTIMATE.start_main_~a~0 .cse0) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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-02 22:06:59,257 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.geq ULTIMATE.start_main_~a~0 .cse0) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from false [2021-11-02 22:07:01,291 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.geq ULTIMATE.start_main_~a~0 .cse0) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from true [2021-11-02 22:07:01,291 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-02 22:07:01,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:07:08,290 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-02 22:07:10,343 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-02 22:07:16,816 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-02 22:07:25,380 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-02 22:07:27,425 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-02 22:07:41,922 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 (_ bv20 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-02 22:07:43,970 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 (_ bv20 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-02 22:07:43,971 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-02 22:07:43,971 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:07:43,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265947837] [2021-11-02 22:07:43,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265947837] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:07:43,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:07:43,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-02 22:07:43,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809382359] [2021-11-02 22:07:43,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-02 22:07:43,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:07:43,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-02 22:07:43,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=28, Unknown=11, NotChecked=90, Total=156 [2021-11-02 22:07:43,976 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-02 22:07:46,112 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 (_ bv20 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-02 22:07:48,152 WARN L860 $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 (_ bv20 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 true [2021-11-02 22:07:50,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse2 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (.cse1 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 .cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~a~0) .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-02 22:07:52,242 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse2 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (.cse1 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 .cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~a~0) .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-02 22:07:54,545 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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)))))))) is different from true [2021-11-02 22:07:57,849 WARN L860 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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)) is different from true [2021-11-02 22:07:59,896 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.geq ULTIMATE.start_main_~a~0 .cse0) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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-02 22:08:22,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:08:22,369 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-02 22:08:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-02 22:08:22,423 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-02 22:08:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:08:22,423 INFO L225 Difference]: With dead ends: 20 [2021-11-02 22:08:22,423 INFO L226 Difference]: Without dead ends: 18 [2021-11-02 22:08:22,425 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 45.8s TimeCoverageRelationStatistics Valid=37, Invalid=31, Unknown=18, NotChecked=220, Total=306 [2021-11-02 22:08:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-02 22:08:22,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2021-11-02 22:08:22,429 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-02 22:08:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-11-02 22:08:22,430 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2021-11-02 22:08:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:08:22,441 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-11-02 22:08:22,442 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-02 22:08:22,442 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-11-02 22:08:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 22:08:22,442 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:08:22,443 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:08:22,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:08:22,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:08:22,663 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:08:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:08:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1864186656, now seen corresponding path program 1 times [2021-11-02 22:08:22,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:08:22,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1496235135] [2021-11-02 22:08:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:08:22,665 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:08:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:08:22,667 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:08:22,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 22:08:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:08:26,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-02 22:08:26,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:10:09,801 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 (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.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse2 .cse3)))) is different from false [2021-11-02 22:10:11,853 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 (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.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse2 .cse3)))) is different from true [2021-11-02 22:10:28,603 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 (_ bv20 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-02 22:10:30,656 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 (_ bv20 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-02 22:10:30,657 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-02 22:10:30,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:10:38,204 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-02 22:10:40,270 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-02 22:10:50,801 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-02 22:10:52,883 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-02 22:11:20,312 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-02 22:11:22,389 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-02 22:11:37,094 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-02 22:11:39,168 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-02 22:11:56,053 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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2))))) is different from false [2021-11-02 22:11:58,120 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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2))))) is different from true [2021-11-02 22:11:58,125 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-02 22:11:58,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:11:58,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1496235135] [2021-11-02 22:11:58,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1496235135] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 22:11:58,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:11:58,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2021-11-02 22:11:58,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942730204] [2021-11-02 22:11:58,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-02 22:11:58,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:11:58,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-02 22:11:58,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=36, Unknown=15, NotChecked=126, Total=210 [2021-11-02 22:11:58,128 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-02 22:12:00,202 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2)))))) is different from false [2021-11-02 22:12:02,266 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2)))))) is different from true [2021-11-02 22:12:04,334 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (let ((.cse2 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (.cse1 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 .cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32))))) (= 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)) .cse0)))) is different from false [2021-11-02 22:12:06,406 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (let ((.cse2 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (.cse1 (fp.geq c_ULTIMATE.start_main_~a~0 .cse3))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 .cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32))))) (= 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)) .cse0)))) is different from true [2021-11-02 22:12:08,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from false [2021-11-02 22:12:10,544 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from true [2021-11-02 22:12:12,612 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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)) is different from false [2021-11-02 22:12:14,698 WARN L860 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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)) is different from true [2021-11-02 22:12:16,764 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 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (= 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))) is different from false [2021-11-02 22:12:18,850 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 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (= 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))) is different from true [2021-11-02 22:12:20,923 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 ((.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 (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.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse2 .cse3))))) is different from false [2021-11-02 22:12:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:12:47,646 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-11-02 22:12:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-02 22:12:47,705 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-02 22:12:47,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:12:47,705 INFO L225 Difference]: With dead ends: 23 [2021-11-02 22:12:47,705 INFO L226 Difference]: Without dead ends: 21 [2021-11-02 22:12:47,706 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 73.2s TimeCoverageRelationStatistics Valid=45, Invalid=37, Unknown=26, NotChecked=312, Total=420 [2021-11-02 22:12:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-11-02 22:12:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2021-11-02 22:12:47,709 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-02 22:12:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2021-11-02 22:12:47,710 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 10 [2021-11-02 22:12:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:12:47,711 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2021-11-02 22:12:47,711 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-02 22:12:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2021-11-02 22:12:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-02 22:12:47,712 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:12:47,712 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:12:47,735 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-02 22:12:47,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:12:47,913 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:12:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:12:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1864227371, now seen corresponding path program 1 times [2021-11-02 22:12:47,914 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:12:47,914 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964501064] [2021-11-02 22:12:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:12:47,915 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:12:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:12:47,917 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:12:47,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-02 22:12:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:12:48,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-02 22:12:48,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:13:07,043 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-02 22:13:09,107 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-02 22:13:15,293 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-02 22:13:17,357 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-02 22:13:29,761 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-02 22:13:29,774 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-02 22:13:29,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:13:48,439 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-02 22:13:50,497 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-02 22:13:50,510 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-02 22:13:50,510 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:13:50,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964501064] [2021-11-02 22:13:50,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964501064] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:13:50,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:13:50,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2021-11-02 22:13:50,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859405324] [2021-11-02 22:13:50,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-02 22:13:50,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:13:50,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-02 22:13:50,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=4, Unknown=7, NotChecked=20, Total=42 [2021-11-02 22:13:50,524 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-02 22:13:54,783 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-02 22:13:56,851 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-02 22:13:58,914 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-02 22:13:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:13:58,922 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2021-11-02 22:13:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:13:58,922 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-02 22:13:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:13:58,923 INFO L225 Difference]: With dead ends: 18 [2021-11-02 22:13:58,923 INFO L226 Difference]: Without dead ends: 14 [2021-11-02 22:13:58,923 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=15, Invalid=5, Unknown=10, NotChecked=42, Total=72 [2021-11-02 22:13:58,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-02 22:13:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-02 22:13:58,926 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-02 22:13:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-11-02 22:13:58,927 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2021-11-02 22:13:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:13:58,927 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-11-02 22:13:58,927 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-02 22:13:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-11-02 22:13:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 22:13:58,928 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:13:58,928 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-02 22:13:58,947 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-02 22:13:59,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:13:59,129 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:13:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:13:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2052598129, now seen corresponding path program 2 times [2021-11-02 22:13:59,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:13:59,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855255278] [2021-11-02 22:13:59,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-02 22:13:59,130 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:13:59,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:13:59,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:13:59,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-02 22:14:03,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-02 22:14:03,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:14:03,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-02 22:14:03,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:15:15,246 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.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from false [2021-11-02 22:16:12,435 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 (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.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse2 .cse3)))) is different from false [2021-11-02 22:16:14,493 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 (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.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse2 .cse3)))) is different from true [2021-11-02 22:16:31,444 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 (_ bv20 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-02 22:16:33,504 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 (_ bv20 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-02 22:16:33,505 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-02 22:16:33,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:16:42,270 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-02 22:16:44,341 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-02 22:16:54,919 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-02 22:16:57,007 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-02 22:17:29,186 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-02 22:17:31,299 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-02 22:18:10,353 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-02 22:18:12,443 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-02 22:18:25,945 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-02 22:18:44,466 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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2))))) is different from false [2021-11-02 22:18:46,555 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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2))))) is different from true [2021-11-02 22:18:46,556 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-02 22:18:46,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:18:46,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855255278] [2021-11-02 22:18:46,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855255278] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-02 22:18:46,557 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-02 22:18:46,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2021-11-02 22:18:46,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854562349] [2021-11-02 22:18:46,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-02 22:18:46,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:18:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-02 22:18:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=39, Unknown=16, NotChecked=180, Total=272 [2021-11-02 22:18:46,559 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-02 22:18:51,232 WARN L838 $PredicateComparison]: unable to prove that (and (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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-02 22:18:53,319 WARN L860 $PredicateComparison]: unable to prove that (and (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 (= ((_ 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.leq v_ULTIMATE.start_main_~a~0_11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (not (fp.gt .cse1 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-02 22:18:55,403 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 (_ bv20 32)))) (.cse5 (fp.geq c_ULTIMATE.start_main_~a~0 .cse4))) (or (and .cse3 (or (not .cse5) (not .cse6))) (and .cse6 .cse5 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-02 22:18:57,494 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 (_ bv20 32)))) (.cse5 (fp.geq c_ULTIMATE.start_main_~a~0 .cse4))) (or (and .cse3 (or (not .cse5) (not .cse6))) (and .cse6 .cse5 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-02 22:18:59,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from false [2021-11-02 22:19:01,667 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from true [2021-11-02 22:19:03,758 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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)) is different from false [2021-11-02 22:19:05,864 WARN L860 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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)) is different from true [2021-11-02 22:19:07,942 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 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (= 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))) is different from false [2021-11-02 22:19:10,047 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 (fp.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (= 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))) is different from true [2021-11-02 22:19:12,126 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.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from false [2021-11-02 22:19:14,240 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.leq c_ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))) (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))) is different from true [2021-11-02 22:19:16,323 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 ((.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 (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.leq ULTIMATE.start_main_~a~0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse2 .cse3))))) is different from false [2021-11-02 22:19:31,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:19:31,760 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-11-02 22:19:31,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-02 22:19:31,835 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-02 22:19:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:19:31,835 INFO L225 Difference]: With dead ends: 21 [2021-11-02 22:19:31,835 INFO L226 Difference]: Without dead ends: 19 [2021-11-02 22:19:31,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 83.6s TimeCoverageRelationStatistics Valid=51, Invalid=40, Unknown=29, NotChecked=432, Total=552 [2021-11-02 22:19:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-02 22:19:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-02 22:19:31,841 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-02 22:19:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-11-02 22:19:31,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2021-11-02 22:19:31,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:19:31,843 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-11-02 22:19:31,843 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-02 22:19:31,844 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-11-02 22:19:31,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-02 22:19:31,844 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:19:31,845 INFO L513 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-02 22:19:31,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-02 22:19:32,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:19:32,046 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:19:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:19:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1496534400, now seen corresponding path program 3 times [2021-11-02 22:19:32,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:19:32,047 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637334058] [2021-11-02 22:19:32,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-02 22:19:32,047 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:19:32,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:19:32,054 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:19:32,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88ad5909-9690-47c9-a2d4-5272816915d1/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-02 22:19:44,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-02 22:19:44,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-02 22:19:45,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-02 22:19:45,131 INFO L286 TraceCheckSpWp]: Computing forward predicates...