./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc 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_Householder_constant.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 ce03bf6872f0cdac7da47b07acbc22acdd73caa8 .......................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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_Householder_constant.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 ce03bf6872f0cdac7da47b07acbc22acdd73caa8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:41:00,381 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:41:00,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:41:00,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:41:00,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:41:00,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:41:00,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:41:00,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:41:00,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:41:00,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:41:00,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:41:00,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:41:00,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:41:00,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:41:00,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:41:00,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:41:00,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:41:00,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:41:00,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:41:00,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:41:00,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:41:00,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:41:00,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:41:00,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:41:00,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:41:00,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:41:00,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:41:00,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:41:00,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:41:00,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:41:00,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:41:00,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:41:00,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:41:00,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:41:00,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:41:00,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:41:00,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:41:00,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:41:00,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:41:00,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:41:00,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:41:00,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 22:41:00,624 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:41:00,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:41:00,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:41:00,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:41:00,630 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:41:00,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:41:00,631 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:41:00,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 22:41:00,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:41:00,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:41:00,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:41:00,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:41:00,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:41:00,635 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:41:00,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:41:00,635 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:41:00,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:41:00,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:41:00,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:41:00,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:41:00,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:41:00,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:41:00,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:41:00,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:41:00,639 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:41:00,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 22:41:00,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 22:41:00,640 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:41:00,640 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:41:00,640 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 -> ce03bf6872f0cdac7da47b07acbc22acdd73caa8 [2020-10-24 22:41:01,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:41:01,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:41:01,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:41:01,139 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:41:01,141 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:41:01,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2020-10-24 22:41:01,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b843288/dd580081074247538ea3e40e3997b75f/FLAGfdff84228 [2020-10-24 22:41:01,884 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:41:01,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2020-10-24 22:41:01,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b843288/dd580081074247538ea3e40e3997b75f/FLAGfdff84228 [2020-10-24 22:41:02,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b843288/dd580081074247538ea3e40e3997b75f [2020-10-24 22:41:02,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:41:02,285 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:41:02,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:41:02,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:41:02,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:41:02,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17622b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02, skipping insertion in model container [2020-10-24 22:41:02,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:41:02,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:41:02,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:41:02,644 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:41:02,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:41:02,690 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:41:02,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02 WrapperNode [2020-10-24 22:41:02,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:41:02,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:41:02,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:41:02,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:41:02,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:41:02,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:41:02,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:41:02,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:41:02,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... [2020-10-24 22:41:02,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:41:02,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:41:02,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:41:02,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:41:02,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:41:02,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 22:41:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:41:02,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:41:02,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:41:03,382 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:41:03,383 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-24 22:41:03,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:03 BoogieIcfgContainer [2020-10-24 22:41:03,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:41:03,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:41:03,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:41:03,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:41:03,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:41:02" (1/3) ... [2020-10-24 22:41:03,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748f58e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:03, skipping insertion in model container [2020-10-24 22:41:03,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:02" (2/3) ... [2020-10-24 22:41:03,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748f58e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:03, skipping insertion in model container [2020-10-24 22:41:03,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:03" (3/3) ... [2020-10-24 22:41:03,414 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2020-10-24 22:41:03,450 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:41:03,462 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:41:03,485 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:41:03,536 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:41:03,537 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:41:03,537 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:41:03,537 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:41:03,538 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:41:03,538 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:41:03,538 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:41:03,538 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:41:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-10-24 22:41:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:41:03,585 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:41:03,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:41:03,589 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:41:03,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:41:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2020-10-24 22:41:03,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:41:03,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52207285] [2020-10-24 22:41:03,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:41:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:41:03,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:41:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:41:03,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:41:03,910 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 22:41:03,911 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 22:41:03,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 22:41:03,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:41:03 BoogieIcfgContainer [2020-10-24 22:41:03,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:41:03,959 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:41:03,959 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:41:03,960 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:41:03,961 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:03" (3/4) ... [2020-10-24 22:41:03,965 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:41:03,965 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:41:03,969 INFO L168 Benchmark]: Toolchain (without parser) took 1688.59 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 27.7 MB in the beginning and 39.1 MB in the end (delta: -11.4 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. [2020-10-24 22:41:03,970 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 50.3 MB. Free memory is still 33.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:41:03,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.46 ms. Allocated memory is still 50.3 MB. Free memory was 27.0 MB in the beginning and 30.3 MB in the end (delta: -3.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-24 22:41:03,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 50.3 MB. Free memory was 30.1 MB in the beginning and 28.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:41:03,973 INFO L168 Benchmark]: Boogie Preprocessor took 58.84 ms. Allocated memory is still 50.3 MB. Free memory was 28.6 MB in the beginning and 27.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:41:03,974 INFO L168 Benchmark]: RCFGBuilder took 567.62 ms. Allocated memory is still 50.3 MB. Free memory was 27.5 MB in the beginning and 28.4 MB in the end (delta: -885.8 kB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-10-24 22:41:03,975 INFO L168 Benchmark]: TraceAbstraction took 564.91 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 27.9 MB in the beginning and 39.7 MB in the end (delta: -11.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:41:03,976 INFO L168 Benchmark]: Witness Printer took 6.31 ms. Allocated memory is still 60.8 MB. Free memory was 39.4 MB in the beginning and 39.1 MB in the end (delta: 273.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:41:03,982 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.36 ms. Allocated memory is still 50.3 MB. Free memory is still 33.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 402.46 ms. Allocated memory is still 50.3 MB. Free memory was 27.0 MB in the beginning and 30.3 MB in the end (delta: -3.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.21 ms. Allocated memory is still 50.3 MB. Free memory was 30.1 MB in the beginning and 28.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.84 ms. Allocated memory is still 50.3 MB. Free memory was 28.6 MB in the beginning and 27.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 567.62 ms. Allocated memory is still 50.3 MB. Free memory was 27.5 MB in the beginning and 28.4 MB in the end (delta: -885.8 kB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 564.91 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 27.9 MB in the beginning and 39.7 MB in the end (delta: -11.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 6.31 ms. Allocated memory is still 60.8 MB. Free memory was 39.4 MB in the beginning and 39.1 MB in the end (delta: 273.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = 1. VAL [_EPS=1/1000000] [L51] COND TRUE d <= 20. [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [_EPS=1/1000000] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [_EPS=1/1000000] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [_EPS=1/1000000] [L35] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L44] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L53] r = SqrtR(d) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L3] __assert_fail("0", "sqrt_Householder_constant.c", 3, "reach_error") VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:41:06,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:41:06,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:41:06,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:41:06,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:41:06,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:41:06,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:41:06,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:41:07,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:41:07,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:41:07,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:41:07,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:41:07,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:41:07,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:41:07,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:41:07,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:41:07,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:41:07,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:41:07,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:41:07,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:41:07,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:41:07,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:41:07,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:41:07,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:41:07,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:41:07,061 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:41:07,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:41:07,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:41:07,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:41:07,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:41:07,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:41:07,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:41:07,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:41:07,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:41:07,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:41:07,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:41:07,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:41:07,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:41:07,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:41:07,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:41:07,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:41:07,079 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 22:41:07,134 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:41:07,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:41:07,138 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:41:07,139 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:41:07,139 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:41:07,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:41:07,140 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:41:07,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:41:07,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:41:07,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:41:07,142 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:41:07,142 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:41:07,143 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 22:41:07,143 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 22:41:07,143 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:41:07,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:41:07,144 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:41:07,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:41:07,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:41:07,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:41:07,145 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:41:07,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:41:07,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:41:07,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:41:07,146 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:41:07,146 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:41:07,147 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 22:41:07,147 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 22:41:07,147 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:41:07,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:41:07,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 22:41:07,148 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 -> ce03bf6872f0cdac7da47b07acbc22acdd73caa8 [2020-10-24 22:41:07,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:41:07,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:41:07,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:41:07,612 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:41:07,614 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:41:07,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2020-10-24 22:41:07,695 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ec0b21d/42ad3cddf42e4f71a5da9047c632c917/FLAG14a4eb8c1 [2020-10-24 22:41:08,450 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:41:08,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2020-10-24 22:41:08,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ec0b21d/42ad3cddf42e4f71a5da9047c632c917/FLAG14a4eb8c1 [2020-10-24 22:41:08,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04ec0b21d/42ad3cddf42e4f71a5da9047c632c917 [2020-10-24 22:41:08,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:41:08,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:41:08,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:41:08,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:41:08,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:41:08,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:08" (1/1) ... [2020-10-24 22:41:08,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a5b32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:08, skipping insertion in model container [2020-10-24 22:41:08,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:41:08" (1/1) ... [2020-10-24 22:41:08,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:41:08,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:41:09,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:41:09,091 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:41:09,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:41:09,158 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:41:09,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09 WrapperNode [2020-10-24 22:41:09,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:41:09,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:41:09,161 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:41:09,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:41:09,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:41:09,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:41:09,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:41:09,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:41:09,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,227 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,227 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... [2020-10-24 22:41:09,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:41:09,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:41:09,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:41:09,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:41:09,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:41:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 22:41:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:41:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:41:09,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:41:19,397 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:41:19,398 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-24 22:41:19,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:19 BoogieIcfgContainer [2020-10-24 22:41:19,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:41:19,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:41:19,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:41:19,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:41:19,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:41:08" (1/3) ... [2020-10-24 22:41:19,407 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137a807c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:19, skipping insertion in model container [2020-10-24 22:41:19,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:41:09" (2/3) ... [2020-10-24 22:41:19,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137a807c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:41:19, skipping insertion in model container [2020-10-24 22:41:19,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:41:19" (3/3) ... [2020-10-24 22:41:19,410 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2020-10-24 22:41:19,424 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:41:19,430 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:41:19,445 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:41:19,474 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:41:19,475 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:41:19,475 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:41:19,475 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:41:19,475 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:41:19,475 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:41:19,476 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:41:19,476 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:41:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-10-24 22:41:19,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:41:19,505 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:41:19,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:41:19,506 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:41:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:41:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2020-10-24 22:41:19,529 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:41:19,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824681956] [2020-10-24 22:41:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 22:41:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:41:21,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-24 22:41:21,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:41:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:41:21,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:41:23,555 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from false [2020-10-24 22:41:25,678 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from true [2020-10-24 22:41:32,935 WARN L193 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2020-10-24 22:41:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:41:32,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824681956] [2020-10-24 22:41:32,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:41:32,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 22:41:32,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774681693] [2020-10-24 22:41:32,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 22:41:32,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:41:32,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 22:41:32,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2020-10-24 22:41:32,968 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 8 states. [2020-10-24 22:41:35,168 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_SqrtR_~xn~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from true [2020-10-24 22:41:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:41:58,446 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2020-10-24 22:41:58,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 22:41:58,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2020-10-24 22:41:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:41:58,548 INFO L225 Difference]: With dead ends: 39 [2020-10-24 22:41:58,549 INFO L226 Difference]: Without dead ends: 16 [2020-10-24 22:41:58,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2020-10-24 22:41:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-10-24 22:41:58,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-24 22:41:58,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-24 22:41:58,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2020-10-24 22:41:58,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2020-10-24 22:41:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:41:58,589 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2020-10-24 22:41:58,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 22:41:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2020-10-24 22:41:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 22:41:58,590 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:41:58,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:41:58,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 22:41:58,805 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:41:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:41:58,808 INFO L82 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2020-10-24 22:41:58,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:41:58,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207254903] [2020-10-24 22:41:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 22:42:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:42:01,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 22:42:01,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:42:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:42:01,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:42:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:42:01,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207254903] [2020-10-24 22:42:01,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:42:01,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 22:42:01,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347480735] [2020-10-24 22:42:01,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 22:42:01,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:42:01,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 22:42:01,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 22:42:01,372 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand 6 states. [2020-10-24 22:42:17,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:42:17,206 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-10-24 22:42:17,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 22:42:17,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-24 22:42:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:42:17,601 INFO L225 Difference]: With dead ends: 27 [2020-10-24 22:42:17,601 INFO L226 Difference]: Without dead ends: 17 [2020-10-24 22:42:17,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-24 22:42:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-10-24 22:42:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2020-10-24 22:42:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-24 22:42:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-10-24 22:42:17,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2020-10-24 22:42:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:42:17,614 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-24 22:42:17,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 22:42:17,616 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-10-24 22:42:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 22:42:17,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:42:17,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:42:17,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 22:42:17,832 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:42:17,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:42:17,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2020-10-24 22:42:17,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:42:17,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729804006] [2020-10-24 22:42:17,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 22:42:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:42:21,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-24 22:42:21,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:42:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:42:21,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:42:24,468 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:42:26,863 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:42:29,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:42:32,517 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:42:35,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:42:37,620 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:42:40,180 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-10-24 22:42:42,759 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-10-24 22:42:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-10-24 22:42:42,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729804006] [2020-10-24 22:42:42,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:42:42,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-10-24 22:42:42,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105051773] [2020-10-24 22:42:42,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 22:42:42,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:42:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 22:42:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=83, Unknown=8, NotChecked=84, Total=210 [2020-10-24 22:42:42,801 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 15 states. [2020-10-24 22:42:47,983 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-10-24 22:42:50,555 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-10-24 22:42:53,155 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:42:55,738 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:42:58,593 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (= c_ULTIMATE.start_SqrtR_~xn~0 .cse0) (= c_ULTIMATE.start_SqrtR_~Input .cse0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse1 .cse0)))) is different from true [2020-10-24 22:43:02,862 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) .cse1) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) c_ULTIMATE.start_SqrtR_~xnp1~0) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:43:58,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:43:58,553 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-10-24 22:43:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 22:43:58,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2020-10-24 22:43:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:43:58,557 INFO L225 Difference]: With dead ends: 33 [2020-10-24 22:43:58,557 INFO L226 Difference]: Without dead ends: 31 [2020-10-24 22:43:58,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=56, Invalid=118, Unknown=14, NotChecked=232, Total=420 [2020-10-24 22:43:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-10-24 22:43:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2020-10-24 22:43:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-24 22:43:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-24 22:43:58,571 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2020-10-24 22:43:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:43:58,571 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-24 22:43:58,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 22:43:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-24 22:43:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 22:43:58,573 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:43:58,573 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:43:58,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 22:43:58,785 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:43:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:43:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2020-10-24 22:43:58,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:43:58,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261689829] [2020-10-24 22:43:58,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-24 22:44:04,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-24 22:44:04,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 22:44:04,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 22:44:04,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:44:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-24 22:44:08,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:44:11,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:44:13,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:44:16,529 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:44:19,501 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input) c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:45:26,442 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2020-10-24 22:46:13,447 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xn~0) c_ULTIMATE.start_SqrtR_~xn~0))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2020-10-24 22:46:29,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-10-24 22:46:39,918 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-10-24 22:47:06,180 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-10-24 22:47:30,110 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-10-24 22:47:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-10-24 22:47:30,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261689829] [2020-10-24 22:47:30,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 22:47:30,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2020-10-24 22:47:30,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131084974] [2020-10-24 22:47:30,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 22:47:30,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:47:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 22:47:30,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=83, Unknown=10, NotChecked=110, Total=240 [2020-10-24 22:47:30,185 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 16 states. [2020-10-24 22:47:58,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-10-24 22:48:48,540 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_main_~d~0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~d~0 .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~d~0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2020-10-24 22:49:13,381 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (fp.div c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse4 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse1) .cse1) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) .cse1))))) .cse6))) (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_SqrtR_~Input .cse2) .cse2) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse2) .cse2))))))) .cse6))))) (and (fp.geq .cse0 .cse1) (= c_ULTIMATE.start_SqrtR_~Input .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2020-10-24 22:49:31,529 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 22:49:31,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 22:49:31,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 22:49:31,733 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-10-24 22:49:31,740 INFO L168 Benchmark]: Toolchain (without parser) took 502953.62 ms. Allocated memory is still 46.1 MB. Free memory was 30.3 MB in the beginning and 20.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:49:31,741 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 37.7 MB. Free memory was 22.1 MB in the beginning and 22.1 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:49:31,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.40 ms. Allocated memory is still 46.1 MB. Free memory was 29.6 MB in the beginning and 30.4 MB in the end (delta: -803.6 kB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-24 22:49:31,743 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.44 ms. Allocated memory is still 46.1 MB. Free memory was 30.3 MB in the beginning and 28.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:49:31,743 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 27.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:49:31,744 INFO L168 Benchmark]: RCFGBuilder took 10151.37 ms. Allocated memory is still 46.1 MB. Free memory was 27.3 MB in the beginning and 24.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. [2020-10-24 22:49:31,745 INFO L168 Benchmark]: TraceAbstraction took 492336.61 ms. Allocated memory is still 46.1 MB. Free memory was 23.5 MB in the beginning and 20.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 1.4 MB. Max. memory is 16.1 GB. [2020-10-24 22:49:31,749 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.35 ms. Allocated memory is still 37.7 MB. Free memory was 22.1 MB in the beginning and 22.1 MB in the end (delta: 1.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 364.40 ms. Allocated memory is still 46.1 MB. Free memory was 29.6 MB in the beginning and 30.4 MB in the end (delta: -803.6 kB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.44 ms. Allocated memory is still 46.1 MB. Free memory was 30.3 MB in the beginning and 28.7 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.08 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 27.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10151.37 ms. Allocated memory is still 46.1 MB. Free memory was 27.3 MB in the beginning and 24.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 9.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 492336.61 ms. Allocated memory is still 46.1 MB. Free memory was 23.5 MB in the beginning and 20.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 1.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...