./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 02:33:59,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 02:33:59,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 02:33:59,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 02:33:59,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 02:33:59,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 02:33:59,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 02:33:59,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 02:33:59,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 02:33:59,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 02:33:59,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 02:33:59,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 02:33:59,398 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 02:33:59,399 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 02:33:59,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 02:33:59,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 02:33:59,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 02:33:59,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 02:33:59,409 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 02:33:59,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 02:33:59,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 02:33:59,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 02:33:59,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 02:33:59,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 02:33:59,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 02:33:59,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 02:33:59,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 02:33:59,428 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 02:33:59,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 02:33:59,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 02:33:59,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 02:33:59,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 02:33:59,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 02:33:59,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 02:33:59,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 02:33:59,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 02:33:59,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 02:33:59,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 02:33:59,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 02:33:59,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 02:33:59,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 02:33:59,455 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-13 02:33:59,513 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 02:33:59,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 02:33:59,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 02:33:59,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 02:33:59,516 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 02:33:59,517 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 02:33:59,517 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 02:33:59,517 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-13 02:33:59,525 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 02:33:59,526 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 02:33:59,527 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-13 02:33:59,528 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-13 02:33:59,528 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 02:33:59,528 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-13 02:33:59,528 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-13 02:33:59,529 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-13 02:33:59,529 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 02:33:59,530 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 02:33:59,530 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 02:33:59,530 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 02:33:59,530 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 02:33:59,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 02:33:59,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 02:33:59,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 02:33:59,531 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 02:33:59,532 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 02:33:59,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 02:33:59,532 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 02:33:59,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 02:33:59,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 02:33:59,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 02:33:59,533 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:33:59,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 02:33:59,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 02:33:59,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 02:33:59,534 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-13 02:33:59,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 02:33:59,535 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 02:33:59,535 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 02:33:59,535 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 02:33:59,536 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/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_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF 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 -> Taipan 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-11-13 02:33:59,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 02:33:59,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 02:33:59,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 02:33:59,870 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 02:33:59,871 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 02:33:59,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-13 02:33:59,975 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/3db1b8047/8aa4b5b293094d05a9747d0cba33688f/FLAGe55ea27c8 [2021-11-13 02:34:00,450 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 02:34:00,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-13 02:34:00,459 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/3db1b8047/8aa4b5b293094d05a9747d0cba33688f/FLAGe55ea27c8 [2021-11-13 02:34:00,812 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/3db1b8047/8aa4b5b293094d05a9747d0cba33688f [2021-11-13 02:34:00,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 02:34:00,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 02:34:00,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 02:34:00,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 02:34:00,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 02:34:00,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:34:00" (1/1) ... [2021-11-13 02:34:00,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87b7fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:00, skipping insertion in model container [2021-11-13 02:34:00,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:34:00" (1/1) ... [2021-11-13 02:34:00,832 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 02:34:00,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 02:34:01,016 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-13 02:34:01,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:34:01,038 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 02:34:01,050 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-13 02:34:01,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:34:01,067 INFO L208 MainTranslator]: Completed translation [2021-11-13 02:34:01,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01 WrapperNode [2021-11-13 02:34:01,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 02:34:01,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 02:34:01,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 02:34:01,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 02:34:01,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 02:34:01,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 02:34:01,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 02:34:01,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 02:34:01,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 02:34:01,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 02:34:01,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 02:34:01,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 02:34:01,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (1/1) ... [2021-11-13 02:34:01,172 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:34:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:34:01,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 02:34:01,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 02:34:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 02:34:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 02:34:01,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 02:34:01,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 02:34:01,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 02:34:01,601 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 02:34:01,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:34:01 BoogieIcfgContainer [2021-11-13 02:34:01,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 02:34:01,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 02:34:01,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 02:34:01,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 02:34:01,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:34:00" (1/3) ... [2021-11-13 02:34:01,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d73263d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:34:01, skipping insertion in model container [2021-11-13 02:34:01,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:01" (2/3) ... [2021-11-13 02:34:01,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d73263d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:34:01, skipping insertion in model container [2021-11-13 02:34:01,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:34:01" (3/3) ... [2021-11-13 02:34:01,641 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-11-13 02:34:01,660 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 02:34:01,660 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 02:34:01,719 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 02:34:01,728 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=FINITE_AUTOMATA, 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-13 02:34:01,728 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 02:34:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 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-13 02:34:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-13 02:34:01,751 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:34:01,752 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-13 02:34:01,753 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:34:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:34:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash 67880, now seen corresponding path program 1 times [2021-11-13 02:34:01,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 02:34:01,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515494954] [2021-11-13 02:34:01,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:34:01,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 02:34:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 02:34:01,921 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 02:34:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 02:34:01,980 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-13 02:34:01,982 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-13 02:34:01,984 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 02:34:01,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 02:34:01,993 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-13 02:34:01,997 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 02:34:02,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:34:02 BoogieIcfgContainer [2021-11-13 02:34:02,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 02:34:02,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 02:34:02,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 02:34:02,023 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 02:34:02,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:34:01" (3/4) ... [2021-11-13 02:34:02,028 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-13 02:34:02,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 02:34:02,030 INFO L158 Benchmark]: Toolchain (without parser) took 1212.89ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 62.0MB in the end (delta: 16.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2021-11-13 02:34:02,031 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 56.0MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:34:02,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.98ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 88.6MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-13 02:34:02,033 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.77ms. Allocated memory is still 113.2MB. Free memory was 88.6MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:34:02,034 INFO L158 Benchmark]: Boogie Preprocessor took 47.06ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 86.2MB in the end (delta: 963.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:34:02,035 INFO L158 Benchmark]: RCFGBuilder took 449.43ms. Allocated memory is still 113.2MB. Free memory was 86.2MB in the beginning and 76.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-13 02:34:02,035 INFO L158 Benchmark]: TraceAbstraction took 408.31ms. Allocated memory is still 113.2MB. Free memory was 75.3MB in the beginning and 62.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-13 02:34:02,036 INFO L158 Benchmark]: Witness Printer took 5.52ms. Allocated memory is still 113.2MB. Free memory is still 62.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:34:02,040 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.26ms. Allocated memory is still 83.9MB. Free memory was 56.0MB in the beginning and 56.0MB in the end (delta: 28.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.98ms. Allocated memory is still 113.2MB. Free memory was 78.0MB in the beginning and 88.6MB in the end (delta: -10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.77ms. Allocated memory is still 113.2MB. Free memory was 88.6MB in the beginning and 87.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.06ms. Allocated memory is still 113.2MB. Free memory was 87.2MB in the beginning and 86.2MB in the end (delta: 963.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.43ms. Allocated memory is still 113.2MB. Free memory was 86.2MB in the beginning and 76.1MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 408.31ms. Allocated memory is still 113.2MB. Free memory was 75.3MB in the beginning and 62.3MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 5.52ms. Allocated memory is still 113.2MB. Free memory is still 62.0MB. 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: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L25] CALL assume_abort_if_not(I >= 1. && I <= 3.) [L14] COND FALSE !(!cond) [L25] RET assume_abort_if_not(I >= 1. && I <= 3.) [L27] COND FALSE !(I >= 2.) [L28] S = 1.+(I-1.) * (.5+(I-1.) * (-.125+(I-1.)*.0625)) [L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L16] reach_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, 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=6occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 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-13 02:34:02,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/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_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 02:34:05,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 02:34:05,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 02:34:05,224 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 02:34:05,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 02:34:05,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 02:34:05,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 02:34:05,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 02:34:05,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 02:34:05,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 02:34:05,254 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 02:34:05,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 02:34:05,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 02:34:05,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 02:34:05,264 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 02:34:05,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 02:34:05,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 02:34:05,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 02:34:05,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 02:34:05,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 02:34:05,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 02:34:05,298 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 02:34:05,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 02:34:05,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 02:34:05,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 02:34:05,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 02:34:05,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 02:34:05,319 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 02:34:05,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 02:34:05,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 02:34:05,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 02:34:05,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 02:34:05,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 02:34:05,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 02:34:05,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 02:34:05,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 02:34:05,343 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 02:34:05,343 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 02:34:05,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 02:34:05,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 02:34:05,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 02:34:05,354 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-13 02:34:05,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 02:34:05,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 02:34:05,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 02:34:05,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 02:34:05,419 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 02:34:05,419 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 02:34:05,419 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 02:34:05,420 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 02:34:05,421 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 02:34:05,421 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 02:34:05,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 02:34:05,424 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 02:34:05,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 02:34:05,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 02:34:05,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 02:34:05,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 02:34:05,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 02:34:05,426 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 02:34:05,427 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-13 02:34:05,427 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-13 02:34:05,427 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 02:34:05,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 02:34:05,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 02:34:05,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 02:34:05,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 02:34:05,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 02:34:05,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 02:34:05,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:34:05,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 02:34:05,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 02:34:05,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 02:34:05,431 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-13 02:34:05,431 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-13 02:34:05,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 02:34:05,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 02:34:05,432 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 02:34:05,432 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_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/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_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF 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 -> Taipan 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-11-13 02:34:05,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 02:34:05,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 02:34:05,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 02:34:05,935 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 02:34:05,936 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 02:34:05,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-13 02:34:06,021 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/86273fea6/dfb7941c6d3d4d2d926b2adad7b0da7a/FLAG47da73950 [2021-11-13 02:34:06,698 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 02:34:06,699 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-11-13 02:34:06,708 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/86273fea6/dfb7941c6d3d4d2d926b2adad7b0da7a/FLAG47da73950 [2021-11-13 02:34:07,056 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/data/86273fea6/dfb7941c6d3d4d2d926b2adad7b0da7a [2021-11-13 02:34:07,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 02:34:07,061 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 02:34:07,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 02:34:07,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 02:34:07,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 02:34:07,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f9350bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07, skipping insertion in model container [2021-11-13 02:34:07,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 02:34:07,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 02:34:07,281 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-13 02:34:07,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:34:07,313 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 02:34:07,327 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-11-13 02:34:07,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:34:07,379 INFO L208 MainTranslator]: Completed translation [2021-11-13 02:34:07,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07 WrapperNode [2021-11-13 02:34:07,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 02:34:07,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 02:34:07,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 02:34:07,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 02:34:07,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 02:34:07,477 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 02:34:07,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 02:34:07,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 02:34:07,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,518 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 02:34:07,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 02:34:07,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 02:34:07,527 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 02:34:07,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (1/1) ... [2021-11-13 02:34:07,551 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:34:07,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:34:07,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 02:34:07,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 02:34:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-13 02:34:07,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 02:34:07,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 02:34:07,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 02:34:12,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 02:34:12,196 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-11-13 02:34:12,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:34:12 BoogieIcfgContainer [2021-11-13 02:34:12,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 02:34:12,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 02:34:12,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 02:34:12,216 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 02:34:12,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:34:07" (1/3) ... [2021-11-13 02:34:12,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a72220b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:34:12, skipping insertion in model container [2021-11-13 02:34:12,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:34:07" (2/3) ... [2021-11-13 02:34:12,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a72220b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:34:12, skipping insertion in model container [2021-11-13 02:34:12,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:34:12" (3/3) ... [2021-11-13 02:34:12,220 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-11-13 02:34:12,227 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 02:34:12,227 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 02:34:12,287 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 02:34:12,297 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=FINITE_AUTOMATA, 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-13 02:34:12,298 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 02:34:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 02:34:12,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-13 02:34:12,322 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:34:12,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:34:12,323 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:34:12,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:34:12,330 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2021-11-13 02:34:12,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:34:12,346 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069459487] [2021-11-13 02:34:12,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:34:12,347 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:34:12,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:34:12,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:34:12,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-13 02:34:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:34:13,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-13 02:34:13,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:34:13,328 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-13 02:34:13,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:34:13,401 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-13 02:34:13,402 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:34:13,403 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069459487] [2021-11-13 02:34:13,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069459487] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:34:13,404 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:34:13,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-13 02:34:13,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617953665] [2021-11-13 02:34:13,407 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:34:13,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 02:34:13,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:34:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 02:34:13,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 02:34:13,454 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-13 02:34:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:34:13,468 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-11-13 02:34:13,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 02:34:13,471 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 8 [2021-11-13 02:34:13,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:34:13,479 INFO L225 Difference]: With dead ends: 23 [2021-11-13 02:34:13,480 INFO L226 Difference]: Without dead ends: 9 [2021-11-13 02:34:13,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 02:34:13,489 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.40ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-13 02:34:13,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.40ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-13 02:34:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-13 02:34:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-13 02:34:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-13 02:34:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-11-13 02:34:13,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2021-11-13 02:34:13,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:34:13,533 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-11-13 02:34:13,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-13 02:34:13,534 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-11-13 02:34:13,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-13 02:34:13,534 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:34:13,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:34:13,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-13 02:34:13,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:34:13,758 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:34:13,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:34:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2021-11-13 02:34:13,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:34:13,761 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100496253] [2021-11-13 02:34:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:34:13,761 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:34:13,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:34:13,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:34:13,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-13 02:34:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:34:16,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-11-13 02:34:16,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:34:32,789 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:36:20,436 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))))))) is different from false [2021-11-13 02:36:22,525 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))))))) is different from true [2021-11-13 02:37:14,851 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))))))) is different from false [2021-11-13 02:37:16,929 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))))))) is different from true [2021-11-13 02:37:16,930 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-13 02:37:16,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:37:32,867 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from false [2021-11-13 02:37:35,065 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from true [2021-11-13 02:38:08,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from false [2021-11-13 02:38:11,106 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1)))) is different from true [2021-11-13 02:39:05,671 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) is different from false [2021-11-13 02:39:07,833 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) is different from true [2021-11-13 02:39:07,834 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-13 02:39:07,834 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:39:07,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100496253] [2021-11-13 02:39:07,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100496253] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:39:07,834 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:39:07,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-13 02:39:07,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028305660] [2021-11-13 02:39:07,835 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:39:07,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 02:39:07,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:39:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 02:39:07,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-11-13 02:39:07,838 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-13 02:39:09,968 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:39:12,131 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_6| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.leq |v_ULTIMATE.start_main_~I~0#1_6| ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_6| .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_6| .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-13 02:39:14,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-13 02:39:16,422 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse3)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-13 02:39:18,552 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2021-11-13 02:39:20,722 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2021-11-13 02:39:22,844 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse1))))))) |c_ULTIMATE.start_main_~S~0#1|) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:39:24,991 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse2 (fp.leq .cse3 .cse0)) (.cse1 (fp.geq .cse3 .cse4))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1))))))))))) is different from false [2021-11-13 02:39:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:39:25,015 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2021-11-13 02:39:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 02:39:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-13 02:39:25,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:39:25,017 INFO L225 Difference]: With dead ends: 13 [2021-11-13 02:39:25,017 INFO L226 Difference]: Without dead ends: 9 [2021-11-13 02:39:25,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-11-13 02:39:25,020 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.57ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 56.38ms IncrementalHoareTripleChecker+Time [2021-11-13 02:39:25,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.57ms Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 21 Unchecked, 56.38ms Time] [2021-11-13 02:39:25,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-11-13 02:39:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-11-13 02:39:25,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 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-13 02:39:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2021-11-13 02:39:25,025 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 8 [2021-11-13 02:39:25,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:39:25,025 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2021-11-13 02:39:25,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-13 02:39:25,026 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2021-11-13 02:39:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-13 02:39:25,026 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:39:25,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:39:25,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-13 02:39:25,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:39:25,227 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:39:25,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:39:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 176701705, now seen corresponding path program 1 times [2021-11-13 02:39:25,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:39:25,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713671965] [2021-11-13 02:39:25,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:39:25,230 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:39:25,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:39:25,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:39:25,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-13 02:39:32,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:39:32,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-13 02:39:32,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:39:48,723 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) |c_ULTIMATE.start_main_~S~0#1|)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:41:37,500 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4))))) is different from false [2021-11-13 02:41:39,589 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4))))) is different from true [2021-11-13 02:42:32,608 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse0)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) is different from false [2021-11-13 02:42:34,698 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse1 .cse0)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))) is different from true [2021-11-13 02:42:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 02:42:34,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:42:50,577 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from false [2021-11-13 02:42:52,726 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from true [2021-11-13 02:43:26,195 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from false [2021-11-13 02:43:28,344 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) is different from true [2021-11-13 02:44:22,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from false [2021-11-13 02:44:24,788 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) is different from true [2021-11-13 02:44:24,788 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-13 02:44:24,789 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:44:24,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713671965] [2021-11-13 02:44:24,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713671965] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:44:24,789 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:44:24,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-11-13 02:44:24,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130883987] [2021-11-13 02:44:24,790 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:44:24,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 02:44:24,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:44:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 02:44:24,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-11-13 02:44:24,792 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-13 02:44:26,919 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:44:29,058 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~I~0#1_7| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse0) (not (fp.geq |v_ULTIMATE.start_main_~I~0#1_7| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode |v_ULTIMATE.start_main_~I~0#1_7| .cse1))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse1) (fp.leq .cse2 .cse0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-13 02:44:31,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-13 02:44:33,338 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2))) .cse4 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse1))) (let ((.cse5 (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2)) (.cse6 (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and .cse5 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-13 02:44:35,482 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2021-11-13 02:44:37,610 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (fp.geq |c_ULTIMATE.start_main_~I~0#1| .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2021-11-13 02:44:39,751 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) |c_ULTIMATE.start_main_~S~0#1|)))) (fp.geq |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:44:41,884 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (let ((.cse3 (fp.add roundNearestTiesToEven .cse0 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse4)) (.cse2 (fp.geq .cse3 .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse1) (not .cse2))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2)))) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4)))))) is different from false [2021-11-13 02:44:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:44:41,894 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2021-11-13 02:44:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 02:44:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-13 02:44:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:44:41,895 INFO L225 Difference]: With dead ends: 9 [2021-11-13 02:44:41,895 INFO L226 Difference]: Without dead ends: 0 [2021-11-13 02:44:41,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.1s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-11-13 02:44:41,897 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.16ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 42.87ms IncrementalHoareTripleChecker+Time [2021-11-13 02:44:41,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 13 Unknown, 0 Unchecked, 0.16ms Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 10 Unchecked, 42.87ms Time] [2021-11-13 02:44:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-13 02:44:41,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-13 02:44:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-13 02:44:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-13 02:44:41,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2021-11-13 02:44:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:44:41,900 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-13 02:44:41,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 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-13 02:44:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-13 02:44:41,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-13 02:44:41,903 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 02:44:41,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-13 02:44:42,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:44:42,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-13 02:44:42,112 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-13 02:44:42,112 INFO L861 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-11-13 02:44:42,112 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 28) no Hoare annotation was computed. [2021-11-13 02:44:42,112 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 28) no Hoare annotation was computed. [2021-11-13 02:44:42,112 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-11-13 02:44:42,113 INFO L861 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-11-13 02:44:42,116 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-13 02:44:42,118 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 02:44:42,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:44:42 BoogieIcfgContainer [2021-11-13 02:44:42,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 02:44:42,133 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 02:44:42,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 02:44:42,133 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 02:44:42,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:34:12" (3/4) ... [2021-11-13 02:44:42,138 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-13 02:44:42,152 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2021-11-13 02:44:42,155 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-13 02:44:42,156 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-13 02:44:42,156 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-13 02:44:42,196 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/witness.graphml [2021-11-13 02:44:42,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 02:44:42,197 INFO L158 Benchmark]: Toolchain (without parser) took 635135.92ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.1MB in the beginning and 37.0MB in the end (delta: -7.8MB). Peak memory consumption was 1.5MB. Max. memory is 16.1GB. [2021-11-13 02:44:42,197 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 52.4MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:44:42,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.16ms. Allocated memory is still 52.4MB. Free memory was 28.9MB in the beginning and 35.7MB in the end (delta: -6.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2021-11-13 02:44:42,201 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.14ms. Allocated memory is still 52.4MB. Free memory was 35.7MB in the beginning and 34.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:44:42,209 INFO L158 Benchmark]: Boogie Preprocessor took 49.72ms. Allocated memory is still 52.4MB. Free memory was 34.0MB in the beginning and 32.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:44:42,210 INFO L158 Benchmark]: RCFGBuilder took 4671.21ms. Allocated memory is still 52.4MB. Free memory was 32.8MB in the beginning and 23.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-13 02:44:42,210 INFO L158 Benchmark]: TraceAbstraction took 629919.72ms. Allocated memory is still 62.9MB. Free memory was 45.1MB in the beginning and 39.6MB in the end (delta: 5.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2021-11-13 02:44:42,210 INFO L158 Benchmark]: Witness Printer took 63.56ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 37.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:44:42,213 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.35ms. Allocated memory is still 52.4MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.16ms. Allocated memory is still 52.4MB. Free memory was 28.9MB in the beginning and 35.7MB in the end (delta: -6.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.14ms. Allocated memory is still 52.4MB. Free memory was 35.7MB in the beginning and 34.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.72ms. Allocated memory is still 52.4MB. Free memory was 34.0MB in the beginning and 32.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4671.21ms. Allocated memory is still 52.4MB. Free memory was 32.8MB in the beginning and 23.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 629919.72ms. Allocated memory is still 62.9MB. Free memory was 45.1MB in the beginning and 39.6MB in the end (delta: 5.5MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 63.56ms. Allocated memory is still 62.9MB. Free memory was 39.6MB in the beginning and 37.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 629.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 99.25ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 95.55ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 7 mSolverCounterSat, 1.14ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 10.0s SatisfiabilityAnalysisTime, 584.5s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 8 QuantifiedInterpolants, 1799 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-11-13 02:44:42,453 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-13 02:44:42,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24e26940-772a-4f7f-87a8-14ae14bf04eb/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE