./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 ......................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:00:30,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:00:30,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:00:30,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:00:30,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:00:30,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:00:30,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:00:30,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:00:30,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:00:30,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:00:30,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:00:30,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:00:30,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:00:30,945 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:00:30,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:00:30,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:00:30,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:00:30,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:00:30,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:00:30,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:00:30,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:00:30,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:00:30,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:00:30,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:00:30,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:00:30,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:00:30,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:00:30,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:00:30,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:00:30,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:00:30,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:00:30,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:00:30,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:00:31,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:00:31,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:00:31,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:00:31,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:00:31,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:00:31,003 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:00:31,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:00:31,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:00:31,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:00:31,040 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:00:31,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:00:31,053 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:00:31,053 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:00:31,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:00:31,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:00:31,058 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:00:31,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:00:31,059 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:00:31,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:00:31,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:00:31,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:00:31,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:00:31,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:00:31,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:00:31,062 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:00:31,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:00:31,063 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:00:31,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:00:31,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:00:31,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:00:31,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:00:31,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:00:31,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:00:31,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:00:31,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:00:31,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:00:31,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:00:31,066 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:00:31,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:00:31,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:00:31,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:00:31,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/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_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-10-21 20:00:31,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:00:31,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:00:31,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:00:31,423 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:00:31,424 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:00:31,425 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-21 20:00:31,540 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/de6b9b60e/ad52813076b54ae3b1508443c809bfb9/FLAG3d13a7b37 [2021-10-21 20:00:32,112 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:00:32,113 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-21 20:00:32,120 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/de6b9b60e/ad52813076b54ae3b1508443c809bfb9/FLAG3d13a7b37 [2021-10-21 20:00:32,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/de6b9b60e/ad52813076b54ae3b1508443c809bfb9 [2021-10-21 20:00:32,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:00:32,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:00:32,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:00:32,494 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:00:32,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:00:32,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,502 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae6f406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32, skipping insertion in model container [2021-10-21 20:00:32,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,509 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:00:32,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:00:32,683 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_18b6e167-70f8-45fc-9d21-244d7353522f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-21 20:00:32,696 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:00:32,706 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:00:32,719 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_18b6e167-70f8-45fc-9d21-244d7353522f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-21 20:00:32,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:00:32,757 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:00:32,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32 WrapperNode [2021-10-21 20:00:32,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:00:32,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:00:32,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:00:32,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:00:32,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:00:32,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:00:32,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:00:32,808 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:00:32,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:00:32,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:00:32,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:00:32,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:00:32,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (1/1) ... [2021-10-21 20:00:32,859 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:00:32,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:00:32,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:00:32,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:00:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:00:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:00:32,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:00:32,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:00:33,174 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:00:33,175 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-21 20:00:33,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:00:33 BoogieIcfgContainer [2021-10-21 20:00:33,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:00:33,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:00:33,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:00:33,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:00:33,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:00:32" (1/3) ... [2021-10-21 20:00:33,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7d9955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:00:33, skipping insertion in model container [2021-10-21 20:00:33,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:32" (2/3) ... [2021-10-21 20:00:33,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7d9955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:00:33, skipping insertion in model container [2021-10-21 20:00:33,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:00:33" (3/3) ... [2021-10-21 20:00:33,189 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-21 20:00:33,195 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:00:33,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 20:00:33,273 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:00:33,282 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 20:00:33,283 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 20:00:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:00:33,301 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:00:33,302 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:00:33,303 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:00:33,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:00:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-21 20:00:33,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:00:33,321 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281667303] [2021-10-21 20:00:33,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:00:33,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:00:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:00:33,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:00:33,506 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:00:33,507 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281667303] [2021-10-21 20:00:33,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281667303] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:00:33,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:00:33,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 20:00:33,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444926541] [2021-10-21 20:00:33,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-21 20:00:33,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:00:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-21 20:00:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 20:00:33,540 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:00:33,555 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-21 20:00:33,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-21 20:00:33,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-21 20:00:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:00:33,566 INFO L225 Difference]: With dead ends: 21 [2021-10-21 20:00:33,567 INFO L226 Difference]: Without dead ends: 8 [2021-10-21 20:00:33,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 20:00:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-21 20:00:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-21 20:00:33,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-21 20:00:33,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-21 20:00:33,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:00:33,614 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-21 20:00:33,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:33,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-21 20:00:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:00:33,616 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:00:33,616 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:00:33,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:00:33,617 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:00:33,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:00:33,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-21 20:00:33,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:00:33,625 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040909462] [2021-10-21 20:00:33,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:00:33,626 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:00:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:00:33,692 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 20:00:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 20:00:33,768 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 20:00:33,768 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 20:00:33,770 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:00:33,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:00:33,780 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:00:33,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:00:33 BoogieIcfgContainer [2021-10-21 20:00:33,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:00:33,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:00:33,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:00:33,805 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:00:33,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:00:33" (3/4) ... [2021-10-21 20:00:33,808 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-21 20:00:33,809 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:00:33,811 INFO L168 Benchmark]: Toolchain (without parser) took 1321.61 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 76.3 MB in the beginning and 106.6 MB in the end (delta: -30.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:00:33,812 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 107.0 MB. Free memory is still 61.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:00:33,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.48 ms. Allocated memory is still 107.0 MB. Free memory was 76.3 MB in the beginning and 80.4 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:00:33,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.14 ms. Allocated memory is still 107.0 MB. Free memory was 80.4 MB in the beginning and 79.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:00:33,814 INFO L168 Benchmark]: Boogie Preprocessor took 34.58 ms. Allocated memory is still 107.0 MB. Free memory was 79.1 MB in the beginning and 78.2 MB in the end (delta: 955.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:00:33,815 INFO L168 Benchmark]: RCFGBuilder took 333.22 ms. Allocated memory is still 107.0 MB. Free memory was 78.2 MB in the beginning and 69.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 20:00:33,816 INFO L168 Benchmark]: TraceAbstraction took 625.32 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 68.6 MB in the beginning and 107.3 MB in the end (delta: -38.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:00:33,817 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 106.6 MB in the end (delta: 683.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:00:33,821 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.34 ms. Allocated memory is still 107.0 MB. Free memory is still 61.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 265.48 ms. Allocated memory is still 107.0 MB. Free memory was 76.3 MB in the beginning and 80.4 MB in the end (delta: -4.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.14 ms. Allocated memory is still 107.0 MB. Free memory was 80.4 MB in the beginning and 79.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.58 ms. Allocated memory is still 107.0 MB. Free memory was 79.1 MB in the beginning and 78.2 MB in the end (delta: 955.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 333.22 ms. Allocated memory is still 107.0 MB. Free memory was 78.2 MB in the beginning and 69.0 MB in the end (delta: 9.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 625.32 ms. Allocated memory was 107.0 MB in the beginning and 134.2 MB in the end (delta: 27.3 MB). Free memory was 68.6 MB in the beginning and 107.3 MB in the end (delta: -38.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.62 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 106.6 MB in the end (delta: 683.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L16] reach_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 506.4ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 9.2ms, AutomataDifference: 55.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 21.6ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.1ms SsaConstructionTime, 76.5ms SatisfiabilityAnalysisTime, 91.6ms InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-21 20:00:33,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:00:36,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:00:36,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:00:36,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:00:36,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:00:36,866 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:00:36,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:00:36,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:00:36,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:00:36,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:00:36,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:00:36,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:00:36,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:00:36,893 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:00:36,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:00:36,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:00:36,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:00:36,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:00:36,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:00:36,916 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:00:36,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:00:36,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:00:36,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:00:36,925 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:00:36,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:00:36,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:00:36,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:00:36,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:00:36,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:00:36,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:00:36,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:00:36,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:00:36,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:00:36,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:00:36,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:00:36,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:00:36,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:00:36,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:00:36,948 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:00:36,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:00:36,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:00:36,951 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-10-21 20:00:36,986 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:00:36,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:00:36,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:00:36,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:00:36,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:00:36,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:00:36,992 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:00:36,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:00:36,992 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:00:36,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:00:36,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:00:36,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:00:36,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:00:36,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:00:36,995 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-21 20:00:36,996 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-21 20:00:36,996 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:00:36,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:00:36,997 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:00:36,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:00:36,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:00:36,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:00:36,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:00:36,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:00:36,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:00:36,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:00:36,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:00:37,000 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-21 20:00:37,000 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-21 20:00:37,000 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:00:37,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:00:37,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:00:37,001 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:00:37,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-21 20:00:37,002 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_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/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_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-10-21 20:00:37,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:00:37,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:00:37,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:00:37,500 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:00:37,501 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:00:37,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-21 20:00:37,604 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/8f047b1d9/5a10a7392340418a916fc2c8265c3a25/FLAGea24c50c8 [2021-10-21 20:00:38,237 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:00:38,239 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-21 20:00:38,247 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/8f047b1d9/5a10a7392340418a916fc2c8265c3a25/FLAGea24c50c8 [2021-10-21 20:00:38,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/data/8f047b1d9/5a10a7392340418a916fc2c8265c3a25 [2021-10-21 20:00:38,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:00:38,572 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:00:38,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:00:38,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:00:38,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:00:38,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65465280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38, skipping insertion in model container [2021-10-21 20:00:38,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:00:38,622 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:00:38,767 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_18b6e167-70f8-45fc-9d21-244d7353522f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-21 20:00:38,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:00:38,796 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:00:38,856 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_18b6e167-70f8-45fc-9d21-244d7353522f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-21 20:00:38,863 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:00:38,882 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:00:38,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38 WrapperNode [2021-10-21 20:00:38,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:00:38,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:00:38,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:00:38,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:00:38,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,927 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:00:38,928 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:00:38,928 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:00:38,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:00:38,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,942 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,949 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,956 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:00:38,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:00:38,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:00:38,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:00:38,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (1/1) ... [2021-10-21 20:00:38,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:00:38,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:00:38,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:00:39,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:00:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-21 20:00:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:00:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:00:39,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:00:43,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:00:43,590 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-21 20:00:43,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:00:43 BoogieIcfgContainer [2021-10-21 20:00:43,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:00:43,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:00:43,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:00:43,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:00:43,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:00:38" (1/3) ... [2021-10-21 20:00:43,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bebad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:00:43, skipping insertion in model container [2021-10-21 20:00:43,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:00:38" (2/3) ... [2021-10-21 20:00:43,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49bebad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:00:43, skipping insertion in model container [2021-10-21 20:00:43,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:00:43" (3/3) ... [2021-10-21 20:00:43,604 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-21 20:00:43,611 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:00:43,611 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 20:00:43,680 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:00:43,688 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 20:00:43,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 20:00:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:00:43,721 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:00:43,722 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:00:43,723 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:00:43,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:00:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-21 20:00:43,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 20:00:43,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928786068] [2021-10-21 20:00:43,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:00:43,746 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 20:00:43,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 20:00:43,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 20:00:43,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-21 20:00:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:00:44,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-21 20:00:44,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:00:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:00:45,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 20:00:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:00:45,111 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 20:00:45,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928786068] [2021-10-21 20:00:45,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928786068] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 20:00:45,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:00:45,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-21 20:00:45,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879304083] [2021-10-21 20:00:45,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-21 20:00:45,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 20:00:45,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-21 20:00:45,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 20:00:45,142 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:00:45,155 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-21 20:00:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-21 20:00:45,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-21 20:00:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:00:45,164 INFO L225 Difference]: With dead ends: 21 [2021-10-21 20:00:45,165 INFO L226 Difference]: Without dead ends: 8 [2021-10-21 20:00:45,167 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-21 20:00:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-21 20:00:45,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-21 20:00:45,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-21 20:00:45,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-21 20:00:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:00:45,199 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-21 20:00:45,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:00:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-21 20:00:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:00:45,200 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:00:45,200 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:00:45,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-21 20:00:45,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 20:00:45,418 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:00:45,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:00:45,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-21 20:00:45,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 20:00:45,420 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288622341] [2021-10-21 20:00:45,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:00:45,421 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 20:00:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 20:00:45,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 20:00:45,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-21 20:00:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:00:47,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-21 20:00:47,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:01:03,911 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (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)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-21 20:02:51,152 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (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 .cse3) .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 ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from false [2021-10-21 20:02:53,230 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (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 .cse3) .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 ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from true [2021-10-21 20:03:45,438 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-10-21 20:03:47,502 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-10-21 20:03:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:03:47,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 20:04:03,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .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 c_ULTIMATE.start_main_~I~0 .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-10-21 20:04:05,519 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .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 c_ULTIMATE.start_main_~I~0 .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-10-21 20:04:25,746 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .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 c_ULTIMATE.start_main_~I~0 .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-10-21 20:04:27,894 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .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 c_ULTIMATE.start_main_~I~0 .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-10-21 20:05:21,673 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (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 v_ULTIMATE.start_main_~I~0_8 .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.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from false [2021-10-21 20:05:23,843 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (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 v_ULTIMATE.start_main_~I~0_8 .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.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from true [2021-10-21 20:05:23,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:05:23,844 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 20:05:23,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288622341] [2021-10-21 20:05:23,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288622341] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 20:05:23,845 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:05:23,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-21 20:05:23,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006308139] [2021-10-21 20:05:23,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 20:05:23,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 20:05:23,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 20:05:23,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-10-21 20:05:23,850 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:05:25,960 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (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 v_ULTIMATE.start_main_~I~0_8 .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.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-21 20:05:28,116 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (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 v_ULTIMATE.start_main_~I~0_8 .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.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-21 20:05:30,233 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (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 .cse1) .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.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-10-21 20:05:32,378 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (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 .cse1) .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.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-10-21 20:05:34,497 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (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 .cse1) .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.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from false [2021-10-21 20:05:36,651 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (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 .cse1) .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.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from true [2021-10-21 20:05:38,770 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (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)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-21 20:05:40,899 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (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 .cse3) .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 ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-10-21 20:05:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:05:40,953 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2021-10-21 20:05:40,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 20:05:40,954 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-21 20:05:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:05:40,954 INFO L225 Difference]: With dead ends: 12 [2021-10-21 20:05:40,955 INFO L226 Difference]: Without dead ends: 8 [2021-10-21 20:05:40,956 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40961.0ms TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-10-21 20:05:40,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-21 20:05:40,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-21 20:05:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:05:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2021-10-21 20:05:40,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2021-10-21 20:05:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:05:40,959 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2021-10-21 20:05:40,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:05:40,960 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2021-10-21 20:05:40,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-21 20:05:40,960 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:05:40,961 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:05:40,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-21 20:05:41,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 20:05:41,173 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:05:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:05:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2021-10-21 20:05:41,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-21 20:05:41,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349844457] [2021-10-21 20:05:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:05:41,176 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-21 20:05:41,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat [2021-10-21 20:05:41,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-21 20:05:41,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-21 20:05:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:05:53,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-21 20:05:53,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:06:09,431 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .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)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-21 20:07:59,451 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (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 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from true [2021-10-21 20:08:52,012 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (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 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-10-21 20:08:54,101 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (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 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-10-21 20:08:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:08:54,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-21 20:09:09,784 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-21 20:09:11,917 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-21 20:09:31,802 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-10-21 20:09:33,933 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-10-21 20:10:27,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from false [2021-10-21 20:10:29,675 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from true [2021-10-21 20:10:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:10:29,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-21 20:10:29,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349844457] [2021-10-21 20:10:29,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349844457] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-21 20:10:29,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:10:29,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-21 20:10:29,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341861716] [2021-10-21 20:10:29,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 20:10:29,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-21 20:10:29,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 20:10:29,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2021-10-21 20:10:29,680 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:10:31,801 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-21 20:10:33,926 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-21 20:10:36,053 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-10-21 20:10:38,184 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-10-21 20:10:40,312 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-10-21 20:10:42,438 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .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.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-10-21 20:10:44,581 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .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)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-21 20:10:46,717 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (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 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4))))) is different from false [2021-10-21 20:10:46,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:10:46,727 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2021-10-21 20:10:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 20:10:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-21 20:10:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:10:46,728 INFO L225 Difference]: With dead ends: 8 [2021-10-21 20:10:46,728 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 20:10:46,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40643.3ms TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2021-10-21 20:10:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 20:10:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 20:10:46,730 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-10-21 20:10:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 20:10:46,730 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-10-21 20:10:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:10:46,730 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 20:10:46,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 20:10:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 20:10:46,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 20:10:46,733 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:10:46,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-21 20:10:46,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/mathsat -unsat_core_generation=3 [2021-10-21 20:10:46,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 20:10:46,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:10:46,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:10:46,971 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 20:10:46,971 INFO L860 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-10-21 20:10:46,971 INFO L857 garLoopResultBuilder]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2021-10-21 20:10:46,972 INFO L857 garLoopResultBuilder]: For program point L13(lines 27 28) no Hoare annotation was computed. [2021-10-21 20:10:46,972 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 20:10:46,972 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 20:10:46,972 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 20:10:46,973 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-10-21 20:10:46,973 INFO L857 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-10-21 20:10:46,973 INFO L857 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-10-21 20:10:46,973 INFO L857 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-10-21 20:10:46,973 INFO L860 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-10-21 20:10:46,977 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:10:46,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:10:46 BoogieIcfgContainer [2021-10-21 20:10:46,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:10:46,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:10:46,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:10:46,982 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:10:46,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:00:43" (3/4) ... [2021-10-21 20:10:46,985 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 20:10:46,994 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-21 20:10:46,994 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-21 20:10:46,995 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:10:46,995 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:10:47,032 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:10:47,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:10:47,034 INFO L168 Benchmark]: Toolchain (without parser) took 608460.78 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 40.7 MB in the beginning and 39.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2021-10-21 20:10:47,035 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 60.8 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:10:47,035 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.74 ms. Allocated memory is still 60.8 MB. Free memory was 40.6 MB in the beginning and 43.5 MB in the end (delta: -3.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-21 20:10:47,036 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.89 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 42.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:10:47,037 INFO L168 Benchmark]: Boogie Preprocessor took 28.64 ms. Allocated memory is still 60.8 MB. Free memory was 41.8 MB in the beginning and 40.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:10:47,037 INFO L168 Benchmark]: RCFGBuilder took 4635.89 ms. Allocated memory is still 60.8 MB. Free memory was 40.7 MB in the beginning and 31.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:10:47,038 INFO L168 Benchmark]: TraceAbstraction took 603386.08 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 30.7 MB in the beginning and 41.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2021-10-21 20:10:47,039 INFO L168 Benchmark]: Witness Printer took 50.32 ms. Allocated memory is still 77.6 MB. Free memory was 41.3 MB in the beginning and 39.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:10:47,042 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.28 ms. Allocated memory is still 60.8 MB. Free memory is still 41.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 309.74 ms. Allocated memory is still 60.8 MB. Free memory was 40.6 MB in the beginning and 43.5 MB in the end (delta: -3.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.89 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 42.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.64 ms. Allocated memory is still 60.8 MB. Free memory was 41.8 MB in the beginning and 40.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4635.89 ms. Allocated memory is still 60.8 MB. Free memory was 40.7 MB in the beginning and 31.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 603386.08 ms. Allocated memory was 60.8 MB in the beginning and 77.6 MB in the end (delta: 16.8 MB). Free memory was 30.7 MB in the beginning and 41.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * Witness Printer took 50.32 ms. Allocated memory is still 77.6 MB. Free memory was 41.3 MB in the beginning and 39.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 603299.6ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 23.8ms, AutomataDifference: 34202.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 35.8ms, InitialAbstractionConstructionTime: 10.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 11 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 105.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 81604.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred 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.0ms DumpTime, AutomataMinimizationStatistics: 17.9ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 29.1ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 43.3ms SsaConstructionTime, 14801.0ms SatisfiabilityAnalysisTime, 553267.5ms InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 1563 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-10-21 20:10:47,281 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-21 20:10:47,315 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_18b6e167-70f8-45fc-9d21-244d7353522f/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...