./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:03:08,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:03:08,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:03:08,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:03:08,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:03:08,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:03:08,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:03:08,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:03:08,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:03:08,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:03:08,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:03:08,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:03:08,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:03:08,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:03:08,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:03:08,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:03:08,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:03:08,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:03:08,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:03:08,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:03:08,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:03:08,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:03:08,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:03:08,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:03:08,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:03:08,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:03:08,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:03:08,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:03:08,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:03:08,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:03:08,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:03:08,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:03:08,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:03:08,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:03:08,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:03:08,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:03:08,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:03:08,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:03:08,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:03:08,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:03:08,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:03:08,555 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 07:03:08,569 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:03:08,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:03:08,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:03:08,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:03:08,572 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:03:08,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:03:08,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:03:08,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:03:08,574 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:03:08,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:03:08,574 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:03:08,575 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 07:03:08,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:03:08,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:03:08,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:03:08,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:03:08,576 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:03:08,576 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:03:08,576 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:03:08,576 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:03:08,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:03:08,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:03:08,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:03:08,577 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:03:08,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:03:08,577 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:03:08,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:03:08,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:03:08,578 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 07:03:08,579 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 07:03:08,579 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:03:08,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:03:08,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:03:08,579 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:03:08,579 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 [2021-12-17 07:03:08,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:03:08,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:03:08,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:03:08,790 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:03:08,790 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:03:08,791 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2021-12-17 07:03:08,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2941277/33ea1e58a82b4931b5c7e2a418951510/FLAG40eb57321 [2021-12-17 07:03:09,211 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:03:09,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2021-12-17 07:03:09,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2941277/33ea1e58a82b4931b5c7e2a418951510/FLAG40eb57321 [2021-12-17 07:03:09,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2941277/33ea1e58a82b4931b5c7e2a418951510 [2021-12-17 07:03:09,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:03:09,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:03:09,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:03:09,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:03:09,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:03:09,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5406762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09, skipping insertion in model container [2021-12-17 07:03:09,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:03:09,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:03:09,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2021-12-17 07:03:09,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:03:09,407 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:03:09,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2021-12-17 07:03:09,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:03:09,428 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:03:09,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09 WrapperNode [2021-12-17 07:03:09,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:03:09,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:03:09,430 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:03:09,430 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:03:09,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,450 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2021-12-17 07:03:09,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:03:09,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:03:09,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:03:09,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:03:09,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:03:09,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:03:09,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:03:09,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:03:09,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (1/1) ... [2021-12-17 07:03:09,477 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:03:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:03:09,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:03:09,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:03:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:03:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 07:03:09,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:03:09,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:03:09,574 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:03:09,575 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:03:09,649 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:03:09,653 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:03:09,655 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 07:03:09,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:03:09 BoogieIcfgContainer [2021-12-17 07:03:09,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:03:09,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:03:09,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:03:09,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:03:09,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:03:09" (1/3) ... [2021-12-17 07:03:09,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51075fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:03:09, skipping insertion in model container [2021-12-17 07:03:09,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:09" (2/3) ... [2021-12-17 07:03:09,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51075fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:03:09, skipping insertion in model container [2021-12-17 07:03:09,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:03:09" (3/3) ... [2021-12-17 07:03:09,668 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2021-12-17 07:03:09,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:03:09,671 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:03:09,714 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:03:09,721 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-12-17 07:03:09,722 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:03:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 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-12-17 07:03:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:03:09,746 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:03:09,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:03:09,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:03:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:03:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2021-12-17 07:03:09,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:03:09,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014077857] [2021-12-17 07:03:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:03:09,759 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:03:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:03:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:03:09,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 07:03:09,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014077857] [2021-12-17 07:03:09,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014077857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:03:09,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:03:09,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:03:09,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272320748] [2021-12-17 07:03:09,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:03:09,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:03:09,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 07:03:09,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:03:09,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:03:09,934 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-17 07:03:09,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:03:09,959 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2021-12-17 07:03:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:03:09,961 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-12-17 07:03:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:03:09,966 INFO L225 Difference]: With dead ends: 36 [2021-12-17 07:03:09,966 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 07:03:09,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:03:09,980 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:03:09,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:03:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 07:03:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 07:03:09,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:03:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-17 07:03:10,000 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2021-12-17 07:03:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:03:10,000 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-17 07:03:10,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-17 07:03:10,000 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-17 07:03:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:03:10,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:03:10,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:03:10,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 07:03:10,001 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:03:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:03:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2021-12-17 07:03:10,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 07:03:10,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103964066] [2021-12-17 07:03:10,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:03:10,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 07:03:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:03:10,033 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 07:03:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 07:03:10,071 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 07:03:10,071 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 07:03:10,073 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:03:10,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 07:03:10,079 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-17 07:03:10,081 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:03:10,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:03:10 BoogieIcfgContainer [2021-12-17 07:03:10,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:03:10,115 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:03:10,115 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:03:10,115 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:03:10,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:03:09" (3/4) ... [2021-12-17 07:03:10,118 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:03:10,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:03:10,119 INFO L158 Benchmark]: Toolchain (without parser) took 889.07ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 70.8MB in the end (delta: -11.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:03:10,119 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:03:10,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.58ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 69.9MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:03:10,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.19ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:03:10,124 INFO L158 Benchmark]: Boogie Preprocessor took 14.31ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 67.0MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 07:03:10,125 INFO L158 Benchmark]: RCFGBuilder took 190.83ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 57.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 07:03:10,125 INFO L158 Benchmark]: TraceAbstraction took 456.57ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 71.1MB in the end (delta: -14.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2021-12-17 07:03:10,126 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 70.8MB in the end (delta: 312.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:03:10,131 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.18ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 65.8MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.58ms. Allocated memory is still 94.4MB. Free memory was 59.3MB in the beginning and 69.9MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.19ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 68.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.31ms. Allocated memory is still 94.4MB. Free memory was 68.2MB in the beginning and 67.0MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 190.83ms. Allocated memory is still 94.4MB. Free memory was 67.0MB in the beginning and 57.4MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 456.57ms. Allocated memory is still 94.4MB. Free memory was 56.9MB in the beginning and 71.1MB in the end (delta: -14.3MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 94.4MB. Free memory was 71.1MB in the beginning and 70.8MB in the end (delta: 312.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: 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 52, overapproximation of someUnaryDOUBLEoperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L15] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. VAL [_EPS=1/1000000, d=1, epsilon=1/100000000] [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L11] COND FALSE !(!cond) VAL [\old(cond)=1, _EPS=1/1000000, cond=1] [L48] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L50] CALL, EXPR SqrtR(dd) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; VAL [\old(Input)=50, _EPS=1/1000000, Input=50] [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 VAL [\old(Input)=50, _EPS=1/1000000, Input=50, xn=1] [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 VAL [\old(Input)=50, _EPS=1/1000000, cond=0, i=0, Input=50, xn=1, xn=1] [L28] COND FALSE !(\read(cond)) VAL [\old(Input)=50, _EPS=1/1000000, cond=0, i=0, Input=50, xn=1, xn=1] [L37] return 1.0 / xnp1; VAL [\old(Input)=50, _EPS=1/1000000, cond=0, i=0, Input=50, xn=1, xn=1] [L50] RET, EXPR SqrtR(dd) [L50] r = SqrtR(dd) [L52] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L13] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L13] reach_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 21 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 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-12-17 07:03:10,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 07:03:11,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 07:03:11,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 07:03:11,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 07:03:11,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 07:03:11,912 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 07:03:11,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 07:03:11,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 07:03:11,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 07:03:11,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 07:03:11,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 07:03:11,932 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 07:03:11,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 07:03:11,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 07:03:11,936 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 07:03:11,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 07:03:11,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 07:03:11,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 07:03:11,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 07:03:11,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 07:03:11,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 07:03:11,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 07:03:11,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 07:03:11,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 07:03:11,955 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 07:03:11,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 07:03:11,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 07:03:11,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 07:03:11,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 07:03:11,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 07:03:11,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 07:03:11,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 07:03:11,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 07:03:11,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 07:03:11,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 07:03:11,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 07:03:11,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 07:03:11,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 07:03:11,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 07:03:11,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 07:03:11,965 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 07:03:11,969 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 07:03:11,990 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 07:03:11,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 07:03:11,991 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 07:03:11,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 07:03:11,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 07:03:11,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 07:03:11,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 07:03:11,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 07:03:11,993 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 07:03:11,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 07:03:11,994 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 07:03:11,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 07:03:11,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 07:03:11,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 07:03:11,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 07:03:11,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 07:03:11,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 07:03:11,996 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 07:03:11,996 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 07:03:11,996 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 07:03:11,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 07:03:11,996 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 07:03:11,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 07:03:11,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 07:03:11,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 07:03:11,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 07:03:11,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:03:11,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 07:03:11,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 07:03:11,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 07:03:11,998 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 07:03:11,998 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 07:03:11,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 07:03:11,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 07:03:11,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 07:03:11,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 07:03:11,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 07:03:11,999 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 [2021-12-17 07:03:12,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 07:03:12,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 07:03:12,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 07:03:12,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 07:03:12,295 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 07:03:12,296 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2021-12-17 07:03:12,338 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a970a5d1/bb08b9bac84140ddbe06d81c8808dda6/FLAG1b0dbeadd [2021-12-17 07:03:12,640 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 07:03:12,640 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2021-12-17 07:03:12,646 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a970a5d1/bb08b9bac84140ddbe06d81c8808dda6/FLAG1b0dbeadd [2021-12-17 07:03:13,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a970a5d1/bb08b9bac84140ddbe06d81c8808dda6 [2021-12-17 07:03:13,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 07:03:13,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 07:03:13,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 07:03:13,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 07:03:13,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 07:03:13,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbb723c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13, skipping insertion in model container [2021-12-17 07:03:13,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 07:03:13,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 07:03:13,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2021-12-17 07:03:13,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:03:13,249 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 07:03:13,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2021-12-17 07:03:13,297 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 07:03:13,308 INFO L208 MainTranslator]: Completed translation [2021-12-17 07:03:13,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13 WrapperNode [2021-12-17 07:03:13,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 07:03:13,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 07:03:13,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 07:03:13,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 07:03:13,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,329 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,348 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2021-12-17 07:03:13,349 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 07:03:13,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 07:03:13,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 07:03:13,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 07:03:13,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 07:03:13,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 07:03:13,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 07:03:13,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 07:03:13,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (1/1) ... [2021-12-17 07:03:13,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 07:03:13,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:03:13,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 07:03:13,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 07:03:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 07:03:13,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 07:03:13,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 07:03:13,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 07:03:13,497 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 07:03:13,498 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 07:03:21,440 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 07:03:21,444 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 07:03:21,444 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-17 07:03:21,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:03:21 BoogieIcfgContainer [2021-12-17 07:03:21,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 07:03:21,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 07:03:21,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 07:03:21,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 07:03:21,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:03:13" (1/3) ... [2021-12-17 07:03:21,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f6792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:03:21, skipping insertion in model container [2021-12-17 07:03:21,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:03:13" (2/3) ... [2021-12-17 07:03:21,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f6792b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:03:21, skipping insertion in model container [2021-12-17 07:03:21,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:03:21" (3/3) ... [2021-12-17 07:03:21,452 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2021-12-17 07:03:21,456 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 07:03:21,456 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 07:03:21,491 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 07:03:21,502 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-12-17 07:03:21,502 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 07:03:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 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-12-17 07:03:21,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:03:21,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:03:21,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:03:21,520 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:03:21,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:03:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2021-12-17 07:03:21,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:03:21,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146630760] [2021-12-17 07:03:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:03:21,536 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:03:21,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:03:21,538 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:03:21,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 07:03:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:03:22,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 07:03:22,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:03:22,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:03:22,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:03:22,850 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:03:22,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146630760] [2021-12-17 07:03:22,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146630760] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:03:22,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:03:22,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 07:03:22,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048566680] [2021-12-17 07:03:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:03:22,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 07:03:22,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:03:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 07:03:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:03:22,876 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-17 07:03:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:03:22,884 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2021-12-17 07:03:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 07:03:22,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2021-12-17 07:03:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:03:22,890 INFO L225 Difference]: With dead ends: 36 [2021-12-17 07:03:22,891 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 07:03:22,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 07:03:22,895 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:03:22,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 07:03:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 07:03:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 07:03:22,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 07:03:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-17 07:03:22,915 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2021-12-17 07:03:22,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:03:22,916 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-17 07:03:22,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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-12-17 07:03:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-17 07:03:22,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:03:22,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:03:22,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:03:22,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 07:03:23,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:03:23,124 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:03:23,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:03:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2021-12-17 07:03:23,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:03:23,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007971099] [2021-12-17 07:03:23,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:03:23,126 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:03:23,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:03:23,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:03:23,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 07:03:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:03:24,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 07:03:24,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:03:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:03:25,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:03:25,194 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:03:25,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007971099] [2021-12-17 07:03:25,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007971099] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:03:25,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:03:25,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 07:03:25,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461690491] [2021-12-17 07:03:25,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:03:25,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 07:03:25,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:03:25,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 07:03:25,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:03:25,197 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-12-17 07:03:28,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:03:30,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:03:33,324 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:03:36,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:03:38,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:03:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:03:39,246 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2021-12-17 07:03:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 07:03:39,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2021-12-17 07:03:39,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:03:39,247 INFO L225 Difference]: With dead ends: 34 [2021-12-17 07:03:39,247 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 07:03:39,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-17 07:03:39,249 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2021-12-17 07:03:39,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 5 Unknown, 0 Unchecked, 14.0s Time] [2021-12-17 07:03:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 07:03:39,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 07:03:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-12-17 07:03:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2021-12-17 07:03:39,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 12 [2021-12-17 07:03:39,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:03:39,253 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2021-12-17 07:03:39,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-12-17 07:03:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2021-12-17 07:03:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 07:03:39,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:03:39,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:03:39,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 07:03:39,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:03:39,454 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:03:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:03:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -274400360, now seen corresponding path program 1 times [2021-12-17 07:03:39,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:03:39,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960836359] [2021-12-17 07:03:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:03:39,456 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:03:39,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:03:39,459 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:03:39,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 07:03:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:03:42,626 WARN L261 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-17 07:03:42,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:04:02,202 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))))) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from false [2021-12-17 07:04:35,619 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse1 .cse2))))) (or (and (or .cse0 (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |ULTIMATE.start_SqrtR_~linf~0#1|))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |ULTIMATE.start_SqrtR_~linf~0#1|)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3)) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.div c_currentRoundingMode .cse3 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))) is different from false [2021-12-17 07:04:37,707 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse1 .cse2))))) (or (and (or .cse0 (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |ULTIMATE.start_SqrtR_~linf~0#1|))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32))) (and (not .cse0) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |ULTIMATE.start_SqrtR_~linf~0#1|)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3)) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.div c_currentRoundingMode .cse3 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))) is different from true [2021-12-17 07:05:06,533 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse0) .cse1) (fp.mul c_currentRoundingMode .cse0 .cse1)))) (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |ULTIMATE.start_SqrtR_~linf~0#1|))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.div c_currentRoundingMode .cse2 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))) is different from false [2021-12-17 07:05:08,616 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse0) .cse1) (fp.mul c_currentRoundingMode .cse0 .cse1)))) (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53))) (not (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |ULTIMATE.start_SqrtR_~linf~0#1|))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.div c_currentRoundingMode .cse2 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))) is different from true [2021-12-17 07:05:14,393 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:20,072 WARN L227 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:25,899 WARN L227 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:31,338 WARN L227 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:37,042 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:42,843 WARN L227 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:45,267 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode .cse1 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse2 .cse2))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.lt .cse0 |ULTIMATE.start_SqrtR_~linf~0#1|)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse1)) (= |c_ULTIMATE.start_SqrtR_#res#1| (fp.div c_currentRoundingMode .cse1 .cse2)) (not (fp.gt .cse0 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))))))))) is different from false [2021-12-17 07:05:50,924 WARN L227 SmtUtils]: Spent 5.62s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:05:59,083 WARN L227 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:07,252 WARN L227 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:13,015 WARN L227 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:18,752 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:24,053 WARN L227 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:29,749 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:35,452 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:43,545 WARN L227 SmtUtils]: Spent 5.65s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:49,252 WARN L227 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:06:54,948 WARN L227 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:00,252 WARN L227 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:05,941 WARN L227 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:11,635 WARN L227 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:17,345 WARN L227 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:23,012 WARN L227 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:28,688 WARN L227 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:34,357 WARN L227 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:40,112 WARN L227 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:45,810 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:54,021 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:07:59,717 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:05,438 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 9 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:11,176 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:16,893 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 9 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:22,622 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:28,381 WARN L227 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:34,117 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:39,844 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:45,547 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 9 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:51,321 WARN L227 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 9 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:08:57,020 WARN L227 SmtUtils]: Spent 5.70s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:02,709 WARN L227 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:08,439 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:14,171 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:19,880 WARN L227 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:25,617 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:28,093 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse7 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse6) .cse7))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse0 .cse4))) (let ((.cse2 (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (.cse1 (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))) (not (fp.gt .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse5 |ULTIMATE.start_SqrtR_~linf~0#1|)))))))) is different from false [2021-12-17 07:09:30,410 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse7 (fp.add roundNearestTiesToEven .cse4 .cse4))) (let ((.cse5 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse6) .cse7))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse0 .cse4))) (let ((.cse2 (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (.cse1 (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1 .cse2) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (not .cse2) (not .cse1)))))) (not (fp.gt .cse5 (fp.mul roundNearestTiesToEven .cse6 .cse7))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse5 |ULTIMATE.start_SqrtR_~linf~0#1|)))))))) is different from true [2021-12-17 07:09:38,605 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:46,808 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:52,544 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:09:58,290 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:03,724 WARN L227 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:09,513 WARN L227 SmtUtils]: Spent 5.79s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:15,282 WARN L227 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:23,469 WARN L227 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:29,213 WARN L227 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:34,947 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:40,294 WARN L227 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:45,979 WARN L227 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:51,714 WARN L227 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:10:57,475 WARN L227 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:11:03,259 WARN L227 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:11:09,008 WARN L227 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:11:14,764 WARN L227 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 10 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:11:20,512 WARN L227 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 6 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:11:26,258 WARN L227 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 15 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:11:28,702 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2) .cse3))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (not (fp.gt .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse3))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse0 .cse5))) (or (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse1 |ULTIMATE.start_SqrtR_~linf~0#1|)))))))) is different from false [2021-12-17 07:11:31,003 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_SqrtR_~linf~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse3 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse1 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2) .cse3))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (not (fp.gt .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse3))) (let ((.cse4 (fp.div roundNearestTiesToEven .cse0 .cse5))) (or (not (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0))))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse1 |ULTIMATE.start_SqrtR_~linf~0#1|)))))))) is different from true [2021-12-17 07:11:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 07:11:31,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 07:11:31,004 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:11:31,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960836359] [2021-12-17 07:11:31,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960836359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 07:11:31,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:11:31,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 07:11:31,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813506883] [2021-12-17 07:11:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 07:11:31,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 07:11:31,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 07:11:31,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 07:11:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=10, NotChecked=90, Total=156 [2021-12-17 07:11:31,006 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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-12-17 07:11:40,048 WARN L227 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 32 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:11:48,322 WARN L227 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 35 DAG size of output: 27 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 07:11:51,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:11:53,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:11:56,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:11:58,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:00,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 07:12:01,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 07:12:01,525 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-12-17 07:12:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 07:12:01,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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 12 [2021-12-17 07:12:01,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 07:12:01,528 INFO L225 Difference]: With dead ends: 28 [2021-12-17 07:12:01,528 INFO L226 Difference]: Without dead ends: 26 [2021-12-17 07:12:01,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=48, Invalid=56, Unknown=10, NotChecked=126, Total=240 [2021-12-17 07:12:01,529 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2021-12-17 07:12:01,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 5 Unknown, 83 Unchecked, 14.2s Time] [2021-12-17 07:12:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-12-17 07:12:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-12-17 07:12:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-12-17 07:12:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-12-17 07:12:01,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2021-12-17 07:12:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 07:12:01,534 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-12-17 07:12:01,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0) internal successors, (12), 12 states have internal predecessors, (12), 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-12-17 07:12:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-12-17 07:12:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 07:12:01,535 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 07:12:01,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 07:12:01,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 07:12:01,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 07:12:01,743 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 07:12:01,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 07:12:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash 944524751, now seen corresponding path program 1 times [2021-12-17 07:12:01,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 07:12:01,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318574104] [2021-12-17 07:12:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:12:01,744 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 07:12:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 07:12:01,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 07:12:01,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 07:12:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:12:10,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 07:12:10,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:12:58,197 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (not .cse0) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)) (not .cse1)) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4))))) is different from false [2021-12-17 07:13:00,268 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (not .cse0) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)) (not .cse1)) (and (or .cse0 .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4))))) is different from true [2021-12-17 07:13:27,950 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)))) (not (fp.lt .cse0 (fp.neg .cse1))))) is different from false [2021-12-17 07:13:30,025 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= |c_ULTIMATE.start_SqrtR_~xnp1~0#1| (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)))) (not (fp.lt .cse0 (fp.neg .cse1))))) is different from true [2021-12-17 07:13:35,248 WARN L227 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 23 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:13:40,486 WARN L227 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:13:45,723 WARN L227 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 22 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:13:56,033 WARN L227 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 07:13:56,609 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-17 07:13:56,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 07:13:56,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318574104] [2021-12-17 07:13:56,610 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-12-17 07:13:56,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1438469097] [2021-12-17 07:13:56,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:13:56,611 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-17 07:13:56,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-17 07:13:56,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-12-17 07:13:56,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-17 07:13:56,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-12-17 07:14:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:14:06,211 WARN L261 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 07:14:06,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:14:06,213 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-12-17 07:14:06,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932285478] [2021-12-17 07:14:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 07:14:06,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 07:14:06,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 07:14:06,214 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 07:14:06,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 07:17:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 07:17:56,588 WARN L261 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-17 07:17:56,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 07:17:56,589 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-12-17 07:17:56,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-17 07:17:56,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-17 07:17:56,589 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-17 07:17:56,589 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-17 07:17:56,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 07:17:56,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 07:17:56,995 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2021-12-17 07:17:57,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 137 [2021-12-17 07:17:57,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2021-12-17 07:17:57,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-17 07:17:57,244 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-17 07:17:57,246 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 07:17:57,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 07:17:57 BoogieIcfgContainer [2021-12-17 07:17:57,257 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 07:17:57,257 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 07:17:57,257 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 07:17:57,257 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 07:17:57,258 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:03:21" (3/4) ... [2021-12-17 07:17:57,260 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 07:17:57,260 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 07:17:57,260 INFO L158 Benchmark]: Toolchain (without parser) took 884179.12ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.6MB in the beginning and 35.8MB in the end (delta: -11.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:17:57,261 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 48.2MB. Free memory was 30.8MB in the beginning and 30.7MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:17:57,261 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.83ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.5MB in the beginning and 42.0MB in the end (delta: -17.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2021-12-17 07:17:57,262 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.59ms. Allocated memory is still 58.7MB. Free memory was 42.0MB in the beginning and 40.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:17:57,262 INFO L158 Benchmark]: Boogie Preprocessor took 36.73ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 38.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 07:17:57,262 INFO L158 Benchmark]: RCFGBuilder took 8058.13ms. Allocated memory is still 58.7MB. Free memory was 38.8MB in the beginning and 40.2MB in the end (delta: -1.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2021-12-17 07:17:57,262 INFO L158 Benchmark]: TraceAbstraction took 875810.10ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 36.2MB in the end (delta: 3.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2021-12-17 07:17:57,263 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 58.7MB. Free memory was 36.2MB in the beginning and 35.8MB in the end (delta: 353.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 07:17:57,264 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.19ms. Allocated memory is still 48.2MB. Free memory was 30.8MB in the beginning and 30.7MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.83ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 24.5MB in the beginning and 42.0MB in the end (delta: -17.5MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.59ms. Allocated memory is still 58.7MB. Free memory was 42.0MB in the beginning and 40.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.73ms. Allocated memory is still 58.7MB. Free memory was 40.3MB in the beginning and 38.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8058.13ms. Allocated memory is still 58.7MB. Free memory was 38.8MB in the beginning and 40.2MB in the end (delta: -1.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 875810.10ms. Allocated memory is still 58.7MB. Free memory was 39.8MB in the beginning and 36.2MB in the end (delta: 3.6MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 58.7MB. Free memory was 36.2MB in the beginning and 35.8MB in the end (delta: 353.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L15] double _EPS = 1e-6; [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L11] COND FALSE !(!cond) [L48] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L50] CALL, EXPR SqrtR(dd) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 [L28] COND TRUE \read(cond) [L29] xnp1 = xn + xn*(1-Input*xn*xn) / 2.0 [L30] residu = 2.0*(xnp1-xn) [L31] xn = xnp1 [L32] lsup = _EPS * (xn+xnp1) [L33] linf = -lsup [L34] cond = ((residu > lsup) || (residu < linf)) [L35] i++ [L28] COND FALSE !(\read(cond)) [L37] return 1.0 / xnp1; [L50] RET, EXPR SqrtR(dd) [L50] r = SqrtR(dd) [L52] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 875.8s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 44.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 28.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 26.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 41.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 13.7s SatisfiabilityAnalysisTime, 575.9s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 6 QuantifiedInterpolants, 848 SizeOfPredicates, 26 NumberOfNonLiveVariables, 168 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN