./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 16:23:24,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 16:23:24,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 16:23:24,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 16:23:24,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 16:23:24,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 16:23:24,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 16:23:24,107 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 16:23:24,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 16:23:24,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 16:23:24,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 16:23:24,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 16:23:24,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 16:23:24,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 16:23:24,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 16:23:24,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 16:23:24,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 16:23:24,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 16:23:24,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 16:23:24,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 16:23:24,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 16:23:24,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 16:23:24,151 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 16:23:24,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 16:23:24,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 16:23:24,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 16:23:24,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 16:23:24,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 16:23:24,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 16:23:24,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 16:23:24,166 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 16:23:24,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 16:23:24,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 16:23:24,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 16:23:24,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 16:23:24,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 16:23:24,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 16:23:24,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 16:23:24,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 16:23:24,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 16:23:24,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 16:23:24,174 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-22 16:23:24,197 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 16:23:24,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 16:23:24,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 16:23:24,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 16:23:24,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 16:23:24,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 16:23:24,200 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 16:23:24,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 16:23:24,201 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 16:23:24,201 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-22 16:23:24,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 16:23:24,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 16:23:24,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 16:23:24,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 16:23:24,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 16:23:24,202 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 16:23:24,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 16:23:24,203 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 16:23:24,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 16:23:24,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 16:23:24,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 16:23:24,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 16:23:24,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:23:24,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 16:23:24,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 16:23:24,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 16:23:24,205 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-22 16:23:24,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-22 16:23:24,205 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 16:23:24,205 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 16:23:24,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 16:23:24,206 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 16:23:24,206 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_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2021-11-22 16:23:24,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 16:23:24,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 16:23:24,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 16:23:24,524 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 16:23:24,524 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 16:23:24,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/float-benchs/loop-1.c [2021-11-22 16:23:24,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/b31dc9bc6/fa19718f35274a30b39d9d588d406586/FLAG9b68eb96b [2021-11-22 16:23:25,119 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 16:23:25,120 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/sv-benchmarks/c/float-benchs/loop-1.c [2021-11-22 16:23:25,132 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/b31dc9bc6/fa19718f35274a30b39d9d588d406586/FLAG9b68eb96b [2021-11-22 16:23:25,514 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/b31dc9bc6/fa19718f35274a30b39d9d588d406586 [2021-11-22 16:23:25,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 16:23:25,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 16:23:25,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 16:23:25,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 16:23:25,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 16:23:25,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7ac9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25, skipping insertion in model container [2021-11-22 16:23:25,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 16:23:25,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 16:23:25,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-11-22 16:23:25,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:23:25,816 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 16:23:25,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-11-22 16:23:25,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:23:25,846 INFO L208 MainTranslator]: Completed translation [2021-11-22 16:23:25,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25 WrapperNode [2021-11-22 16:23:25,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 16:23:25,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 16:23:25,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 16:23:25,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 16:23:25,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,882 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2021-11-22 16:23:25,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 16:23:25,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 16:23:25,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 16:23:25,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 16:23:25,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,895 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 16:23:25,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 16:23:25,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 16:23:25,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 16:23:25,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (1/1) ... [2021-11-22 16:23:25,922 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:23:25,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:23:25,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 16:23:25,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 16:23:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 16:23:25,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 16:23:25,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 16:23:25,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-22 16:23:26,060 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 16:23:26,062 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 16:23:26,178 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 16:23:26,185 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 16:23:26,185 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 16:23:26,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:23:26 BoogieIcfgContainer [2021-11-22 16:23:26,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 16:23:26,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 16:23:26,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 16:23:26,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 16:23:26,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:23:25" (1/3) ... [2021-11-22 16:23:26,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189a5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:23:26, skipping insertion in model container [2021-11-22 16:23:26,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:25" (2/3) ... [2021-11-22 16:23:26,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189a5f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:23:26, skipping insertion in model container [2021-11-22 16:23:26,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:23:26" (3/3) ... [2021-11-22 16:23:26,199 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-1.c [2021-11-22 16:23:26,204 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 16:23:26,204 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-22 16:23:26,265 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 16:23:26,272 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 16:23:26,273 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-22 16:23:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:26,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-22 16:23:26,291 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:23:26,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-22 16:23:26,292 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:23:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:23:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-11-22 16:23:26,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-22 16:23:26,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343823115] [2021-11-22 16:23:26,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:23:26,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-22 16:23:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 16:23:26,391 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-22 16:23:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-22 16:23:26,421 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-22 16:23:26,423 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-22 16:23:26,424 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-22 16:23:26,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-22 16:23:26,430 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-22 16:23:26,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-22 16:23:26,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:23:26 BoogieIcfgContainer [2021-11-22 16:23:26,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-22 16:23:26,452 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-22 16:23:26,452 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-22 16:23:26,452 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-22 16:23:26,453 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:23:26" (3/4) ... [2021-11-22 16:23:26,456 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-22 16:23:26,456 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-22 16:23:26,457 INFO L158 Benchmark]: Toolchain (without parser) took 934.70ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.2MB in the beginning and 60.4MB in the end (delta: -5.2MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2021-11-22 16:23:26,458 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 90.2MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:23:26,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.09ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 84.2MB in the end (delta: -29.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2021-11-22 16:23:26,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.81ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 82.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:23:26,460 INFO L158 Benchmark]: Boogie Preprocessor took 28.44ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-22 16:23:26,461 INFO L158 Benchmark]: RCFGBuilder took 274.54ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 73.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-22 16:23:26,462 INFO L158 Benchmark]: TraceAbstraction took 259.86ms. Allocated memory is still 109.1MB. Free memory was 73.0MB in the beginning and 60.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-22 16:23:26,462 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 109.1MB. Free memory was 60.7MB in the beginning and 60.4MB in the end (delta: 327.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-22 16:23:26,466 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.22ms. Allocated memory is still 90.2MB. Free memory was 61.6MB in the beginning and 61.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.09ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 84.2MB in the end (delta: -29.2MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.81ms. Allocated memory is still 109.1MB. Free memory was 84.2MB in the beginning and 82.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.44ms. Allocated memory is still 109.1MB. Free memory was 82.8MB in the beginning and 81.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 274.54ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 73.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 259.86ms. Allocated memory is still 109.1MB. Free memory was 73.0MB in the beginning and 60.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 109.1MB. Free memory was 60.7MB in the beginning and 60.4MB in the end (delta: 327.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 4]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-22 16:23:26,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.2.1-dev-aef121e [2021-11-22 16:23:28,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-22 16:23:28,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-22 16:23:28,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-22 16:23:28,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-22 16:23:28,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-22 16:23:28,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-22 16:23:28,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-22 16:23:28,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-22 16:23:28,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-22 16:23:28,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-22 16:23:28,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-22 16:23:28,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-22 16:23:28,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-22 16:23:28,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-22 16:23:28,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-22 16:23:28,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-22 16:23:29,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-22 16:23:29,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-22 16:23:29,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-22 16:23:29,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-22 16:23:29,015 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-22 16:23:29,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-22 16:23:29,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-22 16:23:29,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-22 16:23:29,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-22 16:23:29,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-22 16:23:29,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-22 16:23:29,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-22 16:23:29,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-22 16:23:29,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-22 16:23:29,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-22 16:23:29,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-22 16:23:29,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-22 16:23:29,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-22 16:23:29,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-22 16:23:29,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-22 16:23:29,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-22 16:23:29,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-22 16:23:29,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-22 16:23:29,041 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-22 16:23:29,046 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-22 16:23:29,093 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-22 16:23:29,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-22 16:23:29,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-22 16:23:29,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-22 16:23:29,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-22 16:23:29,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-22 16:23:29,097 INFO L138 SettingsManager]: * Use SBE=true [2021-11-22 16:23:29,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-22 16:23:29,097 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-22 16:23:29,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-22 16:23:29,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-22 16:23:29,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-22 16:23:29,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-22 16:23:29,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-22 16:23:29,099 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-22 16:23:29,099 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-22 16:23:29,099 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-22 16:23:29,100 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-22 16:23:29,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-22 16:23:29,100 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-22 16:23:29,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-22 16:23:29,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-22 16:23:29,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-22 16:23:29,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-22 16:23:29,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:23:29,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-22 16:23:29,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-22 16:23:29,102 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-22 16:23:29,102 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-22 16:23:29,102 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-22 16:23:29,102 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-22 16:23:29,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-22 16:23:29,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-22 16:23:29,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-22 16:23:29,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-22 16:23:29,103 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_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2021-11-22 16:23:29,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-22 16:23:29,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-22 16:23:29,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-22 16:23:29,476 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-22 16:23:29,476 INFO L275 PluginConnector]: CDTParser initialized [2021-11-22 16:23:29,478 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/../../sv-benchmarks/c/float-benchs/loop-1.c [2021-11-22 16:23:29,544 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/edf303fd5/391d4cc629254165a83816163c6bfd11/FLAGd7160c509 [2021-11-22 16:23:30,099 INFO L306 CDTParser]: Found 1 translation units. [2021-11-22 16:23:30,100 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/sv-benchmarks/c/float-benchs/loop-1.c [2021-11-22 16:23:30,108 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/edf303fd5/391d4cc629254165a83816163c6bfd11/FLAGd7160c509 [2021-11-22 16:23:30,452 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/data/edf303fd5/391d4cc629254165a83816163c6bfd11 [2021-11-22 16:23:30,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-22 16:23:30,456 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-22 16:23:30,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-22 16:23:30,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-22 16:23:30,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-22 16:23:30,461 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@400a7a0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30, skipping insertion in model container [2021-11-22 16:23:30,464 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-22 16:23:30,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-22 16:23:30,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-11-22 16:23:30,620 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:23:30,632 INFO L203 MainTranslator]: Completed pre-run [2021-11-22 16:23:30,645 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-11-22 16:23:30,648 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-22 16:23:30,662 INFO L208 MainTranslator]: Completed translation [2021-11-22 16:23:30,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30 WrapperNode [2021-11-22 16:23:30,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-22 16:23:30,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-22 16:23:30,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-22 16:23:30,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-22 16:23:30,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,695 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-11-22 16:23:30,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-22 16:23:30,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-22 16:23:30,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-22 16:23:30,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-22 16:23:30,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-22 16:23:30,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-22 16:23:30,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-22 16:23:30,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-22 16:23:30,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (1/1) ... [2021-11-22 16:23:30,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-22 16:23:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 [2021-11-22 16:23:30,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-22 16:23:30,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-22 16:23:30,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-22 16:23:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-22 16:23:30,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-22 16:23:30,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-22 16:23:30,863 INFO L236 CfgBuilder]: Building ICFG [2021-11-22 16:23:30,865 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-22 16:23:31,556 INFO L277 CfgBuilder]: Performing block encoding [2021-11-22 16:23:31,562 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-22 16:23:31,562 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-22 16:23:31,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:23:31 BoogieIcfgContainer [2021-11-22 16:23:31,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-22 16:23:31,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-22 16:23:31,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-22 16:23:31,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-22 16:23:31,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:23:30" (1/3) ... [2021-11-22 16:23:31,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fad52a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:23:31, skipping insertion in model container [2021-11-22 16:23:31,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:23:30" (2/3) ... [2021-11-22 16:23:31,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fad52a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:23:31, skipping insertion in model container [2021-11-22 16:23:31,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:23:31" (3/3) ... [2021-11-22 16:23:31,572 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-1.c [2021-11-22 16:23:31,577 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-22 16:23:31,577 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-22 16:23:31,623 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-22 16:23:31,631 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-22 16:23:31,631 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-22 16:23:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-22 16:23:31,649 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:23:31,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-22 16:23:31,650 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:23:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:23:31,656 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-11-22 16:23:31,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:23:31,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [68319009] [2021-11-22 16:23:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:23:31,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:23:31,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:23:31,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:23:31,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-22 16:23:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:23:31,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-22 16:23:31,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:23:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:23:31,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:23:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:23:32,014 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:23:32,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [68319009] [2021-11-22 16:23:32,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [68319009] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-22 16:23:32,017 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-22 16:23:32,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-22 16:23:32,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056378151] [2021-11-22 16:23:32,019 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-22 16:23:32,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-22 16:23:32,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:23:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-22 16:23:32,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:23:32,065 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:23:32,087 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-11-22 16:23:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-22 16:23:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 6 [2021-11-22 16:23:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:23:32,098 INFO L225 Difference]: With dead ends: 20 [2021-11-22 16:23:32,098 INFO L226 Difference]: Without dead ends: 8 [2021-11-22 16:23:32,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-22 16:23:32,109 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:23:32,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2021-11-22 16:23:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-11-22 16:23:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-11-22 16:23:32,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-11-22 16:23:32,144 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-11-22 16:23:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:23:32,144 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-11-22 16:23:32,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:32,145 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-11-22 16:23:32,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-22 16:23:32,145 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:23:32,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-22 16:23:32,166 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-22 16:23:32,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:23:32,365 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:23:32,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:23:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-11-22 16:23:32,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:23:32,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660341452] [2021-11-22 16:23:32,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-22 16:23:32,368 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:23:32,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:23:32,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:23:32,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-22 16:23:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-22 16:23:32,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-22 16:23:32,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:23:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:23:32,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:23:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:23:36,107 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:23:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660341452] [2021-11-22 16:23:36,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660341452] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:23:36,108 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 16:23:36,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-11-22 16:23:36,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840206358] [2021-11-22 16:23:36,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 16:23:36,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-22 16:23:36,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:23:36,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-22 16:23:36,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2021-11-22 16:23:36,112 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:23:42,052 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-11-22 16:23:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-22 16:23:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-22 16:23:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:23:42,058 INFO L225 Difference]: With dead ends: 15 [2021-11-22 16:23:42,058 INFO L226 Difference]: Without dead ends: 11 [2021-11-22 16:23:42,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2021-11-22 16:23:42,060 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-22 16:23:42,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 9 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-11-22 16:23:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-11-22 16:23:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-11-22 16:23:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-11-22 16:23:42,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-11-22 16:23:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:23:42,065 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-11-22 16:23:42,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:23:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-11-22 16:23:42,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-22 16:23:42,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:23:42,066 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-11-22 16:23:42,092 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-22 16:23:42,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:23:42,280 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:23:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:23:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-11-22 16:23:42,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:23:42,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770257857] [2021-11-22 16:23:42,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-22 16:23:42,282 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:23:42,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:23:42,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:23:42,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-22 16:23:42,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-22 16:23:42,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:23:42,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-22 16:23:42,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:23:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:23:43,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:24:42,096 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2021-11-22 16:24:44,121 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2021-11-22 16:24:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-22 16:24:44,134 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:24:44,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770257857] [2021-11-22 16:24:44,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770257857] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:24:44,135 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 16:24:44,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-11-22 16:24:44,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019720257] [2021-11-22 16:24:44,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 16:24:44,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-22 16:24:44,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:24:44,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-22 16:24:44,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=75, Unknown=14, NotChecked=20, Total=156 [2021-11-22 16:24:44,138 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-22 16:24:46,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 16:24:49,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:24:51,491 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) |c_ULTIMATE.start_main_~y~0#1|) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (= .cse0 |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:25:25,886 WARN L227 SmtUtils]: Spent 17.83s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:25:27,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:25:51,819 WARN L227 SmtUtils]: Spent 10.87s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:25:53,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:05,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:07,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:09,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:16,717 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:18,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:20,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:22,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:26:22,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:26:22,610 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-11-22 16:26:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-22 16:26:22,616 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) Word has length 10 [2021-11-22 16:26:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:26:22,617 INFO L225 Difference]: With dead ends: 20 [2021-11-22 16:26:22,617 INFO L226 Difference]: Without dead ends: 16 [2021-11-22 16:26:22,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 124.5s TimeCoverageRelationStatistics Valid=105, Invalid=154, Unknown=21, NotChecked=62, Total=342 [2021-11-22 16:26:22,620 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 16 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2021-11-22 16:26:22,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 15 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 42 Invalid, 7 Unknown, 13 Unchecked, 27.0s Time] [2021-11-22 16:26:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-22 16:26:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-22 16:26:22,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:26:22,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-11-22 16:26:22,627 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2021-11-22 16:26:22,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:26:22,628 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-11-22 16:26:22,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-22 16:26:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-11-22 16:26:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-22 16:26:22,629 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:26:22,629 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2021-11-22 16:26:22,652 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-22 16:26:22,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:26:22,850 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:26:22,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:26:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1299398672, now seen corresponding path program 3 times [2021-11-22 16:26:22,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:26:22,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1094897908] [2021-11-22 16:26:22,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-22 16:26:22,852 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:26:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:26:22,853 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:26:22,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-22 16:26:23,707 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-22 16:26:23,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:26:23,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2021-11-22 16:26:23,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:26:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:26:52,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:27:26,689 WARN L227 SmtUtils]: Spent 11.11s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:27:46,489 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2)) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2))) (let ((.cse0 (fp.add c_currentRoundingMode .cse3 .cse2)) (.cse1 (fp.sub c_currentRoundingMode .cse4 .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (fp.lt .cse3 .cse4)))))) is different from true [2021-11-22 16:28:09,072 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (fp.lt .cse5 .cse6))))))) is different from false [2021-11-22 16:28:11,106 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (fp.lt .cse5 .cse6))))))) is different from true [2021-11-22 16:28:33,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2021-11-22 16:28:35,868 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2021-11-22 16:28:58,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3))) (let ((.cse5 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse3))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse7 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse2 .cse4)))))))) is different from false [2021-11-22 16:29:00,761 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3))) (let ((.cse5 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse3))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse7 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse2 .cse4)))))))) is different from true [2021-11-22 16:29:23,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse6 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse8)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse8) (fp.sub c_currentRoundingMode .cse5 .cse8)))))))) is different from false [2021-11-22 16:29:25,748 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse6 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse8)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse8) (fp.sub c_currentRoundingMode .cse5 .cse8)))))))) is different from true [2021-11-22 16:29:48,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8) .cse8)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8) .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse2 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)))))))) is different from false [2021-11-22 16:29:50,881 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8) .cse8)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8) .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse2 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)))))))) is different from true [2021-11-22 16:30:14,021 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse2 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2021-11-22 16:30:16,088 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse2 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2021-11-22 16:30:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 42 not checked. [2021-11-22 16:30:16,128 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:30:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1094897908] [2021-11-22 16:30:16,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1094897908] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:30:16,129 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 16:30:16,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2021-11-22 16:30:16,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168615239] [2021-11-22 16:30:16,129 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 16:30:16,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-11-22 16:30:16,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:30:16,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-11-22 16:30:16,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=166, Unknown=20, NotChecked=238, Total=506 [2021-11-22 16:30:16,131 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:30:18,061 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 16:30:20,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:30:24,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:30:25,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:30:27,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:30:29,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:30:32,172 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse2 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= .cse4 |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:30:34,263 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode .cse0 .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse4 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0))) (let ((.cse7 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse8 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse7 .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse1 .cse0) (fp.sub c_currentRoundingMode .cse2 .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:30:36,327 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:30:38,389 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse3 .cse4))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:30:40,442 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:30:42,485 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0))) (let ((.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse1 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (fp.lt .cse5 .cse6)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:30:54,193 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:31:34,466 WARN L227 SmtUtils]: Spent 23.42s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:31:36,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:31:49,374 WARN L227 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 14 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:31:51,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:31:52,901 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:31:58,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:32:38,507 WARN L227 SmtUtils]: Spent 27.47s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:32:40,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:32:42,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:32:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-22 16:32:42,432 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-11-22 16:32:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-22 16:32:42,464 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 15 [2021-11-22 16:32:42,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-22 16:32:42,465 INFO L225 Difference]: With dead ends: 24 [2021-11-22 16:32:42,465 INFO L226 Difference]: Without dead ends: 20 [2021-11-22 16:32:42,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 198.7s TimeCoverageRelationStatistics Valid=165, Invalid=280, Unknown=27, NotChecked=650, Total=1122 [2021-11-22 16:32:42,468 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2021-11-22 16:32:42,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 24 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 77 Invalid, 8 Unknown, 82 Unchecked, 29.9s Time] [2021-11-22 16:32:42,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-22 16:32:42,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-11-22 16:32:42,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 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-22 16:32:42,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-11-22 16:32:42,476 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2021-11-22 16:32:42,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-22 16:32:42,476 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-11-22 16:32:42,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:32:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-11-22 16:32:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-22 16:32:42,477 INFO L506 BasicCegarLoop]: Found error trace [2021-11-22 16:32:42,478 INFO L514 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2021-11-22 16:32:42,514 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-22 16:32:42,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 [2021-11-22 16:32:42,694 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-22 16:32:42,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-22 16:32:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash -764299568, now seen corresponding path program 4 times [2021-11-22 16:32:42,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-22 16:32:42,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319034471] [2021-11-22 16:32:42,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-22 16:32:42,695 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-22 16:32:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat [2021-11-22 16:32:42,696 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-22 16:32:42,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a85315ca-aa91-40cb-b637-5c65229662d2/bin/uautomizer-w2VwFs6gM0/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-22 16:32:46,452 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-22 16:32:46,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-22 16:32:46,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2021-11-22 16:32:46,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-22 16:33:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-22 16:33:51,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-22 16:35:18,700 WARN L227 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-22 16:35:27,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-22 16:35:29,968 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-22 16:35:38,628 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-11-22 16:35:40,659 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-11-22 16:35:50,626 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-11-22 16:35:52,660 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-11-22 16:36:02,943 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-22 16:36:04,982 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-22 16:36:14,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-11-22 16:36:16,244 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-11-22 16:36:26,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-22 16:36:28,598 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-22 16:36:38,923 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-11-22 16:36:40,975 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-11-22 16:36:51,300 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-11-22 16:36:53,355 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-11-22 16:37:03,739 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-22 16:37:05,796 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-22 16:37:16,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-22 16:37:18,286 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-22 16:37:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 85 not checked. [2021-11-22 16:37:18,307 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-22 16:37:18,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319034471] [2021-11-22 16:37:18,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319034471] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-22 16:37:18,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-22 16:37:18,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2021-11-22 16:37:18,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714658808] [2021-11-22 16:37:18,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-22 16:37:18,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-11-22 16:37:18,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-22 16:37:18,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-11-22 16:37:18,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=369, Unknown=43, NotChecked=510, Total=1056 [2021-11-22 16:37:18,311 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-22 16:37:20,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:23,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:25,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:27,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:29,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:31,257 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:33,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:35,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:38,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:40,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-22 16:37:43,066 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 42.0) |c_ULTIMATE.start_main_~z~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-22 16:37:45,131 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-22 16:37:47,191 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-22 16:37:49,248 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-22 16:37:51,306 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-22 16:37:53,353 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-22 16:37:55,405 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-22 16:37:57,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse1) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse1 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-22 16:37:59,503 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-11-22 16:38:03,158 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= |c_ULTIMATE.start_main_~z~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 (_ +zero 8 24))))) is different from false