./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0730b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-newlib/double_req_bl_0730b.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 788527977e7ebd7aa0a832758f41b65d3cbd270a ..................................................................................................................................................................................................................................................................................... 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 -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-newlib/double_req_bl_0730b.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 788527977e7ebd7aa0a832758f41b65d3cbd270a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:42:53,248 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:42:53,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:42:53,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:42:53,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:42:53,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:42:53,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:42:53,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:42:53,270 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:42:53,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:42:53,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:42:53,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:42:53,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:42:53,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:42:53,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:42:53,280 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:42:53,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:42:53,282 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:42:53,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:42:53,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:42:53,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:42:53,296 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:42:53,299 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:42:53,300 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:42:53,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:42:53,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:42:53,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:42:53,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:42:53,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:42:53,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:42:53,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:42:53,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:42:53,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:42:53,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:42:53,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:42:53,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:42:53,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:42:53,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:42:53,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:42:53,322 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:42:53,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:42:53,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:42:53,345 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:42:53,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:42:53,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:42:53,348 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:42:53,348 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:42:53,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:42:53,349 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:42:53,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:42:53,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:42:53,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:42:53,351 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:42:53,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:42:53,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:42:53,352 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:42:53,352 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:42:53,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:42:53,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:42:53,353 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:42:53,353 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:42:53,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:42:53,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:42:53,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:42:53,354 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:42:53,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:42:53,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:42:53,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:42:53,356 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:42:53,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:42:53,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 788527977e7ebd7aa0a832758f41b65d3cbd270a [2019-11-27 23:42:53,670 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:42:53,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:42:53,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:42:53,690 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:42:53,691 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:42:53,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0730b.c [2019-11-27 23:42:53,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49eb63f84/a9e9d3a5432d4a948bfa580f9ef91a97/FLAG87e48898d [2019-11-27 23:42:54,280 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:42:54,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730b.c [2019-11-27 23:42:54,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49eb63f84/a9e9d3a5432d4a948bfa580f9ef91a97/FLAG87e48898d [2019-11-27 23:42:54,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49eb63f84/a9e9d3a5432d4a948bfa580f9ef91a97 [2019-11-27 23:42:54,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:42:54,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:42:54,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:42:54,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:42:54,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:42:54,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:42:54" (1/1) ... [2019-11-27 23:42:54,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33519a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:54, skipping insertion in model container [2019-11-27 23:42:54,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:42:54" (1/1) ... [2019-11-27 23:42:54,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:42:54,696 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:42:54,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:42:54,950 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:42:55,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:42:55,084 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:42:55,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55 WrapperNode [2019-11-27 23:42:55,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:42:55,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:42:55,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:42:55,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:42:55,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:42:55,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:42:55,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:42:55,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:42:55,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (1/1) ... [2019-11-27 23:42:55,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:42:55,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:42:55,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:42:55,194 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:42:55,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (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 [2019-11-27 23:42:55,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:42:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-27 23:42:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:42:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:42:55,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:42:55,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:42:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:42:55,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:42:55,828 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:42:55,828 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:42:55,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:42:55 BoogieIcfgContainer [2019-11-27 23:42:55,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:42:55,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:42:55,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:42:55,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:42:55,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:42:54" (1/3) ... [2019-11-27 23:42:55,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65467d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:42:55, skipping insertion in model container [2019-11-27 23:42:55,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:55" (2/3) ... [2019-11-27 23:42:55,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65467d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:42:55, skipping insertion in model container [2019-11-27 23:42:55,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:42:55" (3/3) ... [2019-11-27 23:42:55,839 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730b.c [2019-11-27 23:42:55,850 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:42:55,858 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:42:55,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:42:55,899 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:42:55,899 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:42:55,900 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:42:55,900 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:42:55,901 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:42:55,901 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:42:55,901 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:42:55,901 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:42:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-27 23:42:55,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 23:42:55,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:42:55,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:42:55,928 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:42:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:42:55,936 INFO L82 PathProgramCache]: Analyzing trace with hash 361085180, now seen corresponding path program 1 times [2019-11-27 23:42:55,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:42:55,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21620853] [2019-11-27 23:42:55,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:42:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:42:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:42:56,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21620853] [2019-11-27 23:42:56,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:42:56,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:42:56,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811958438] [2019-11-27 23:42:56,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:42:56,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:42:56,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:42:56,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:42:56,102 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2019-11-27 23:42:56,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:42:56,132 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2019-11-27 23:42:56,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:42:56,134 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-27 23:42:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:42:56,149 INFO L225 Difference]: With dead ends: 104 [2019-11-27 23:42:56,149 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 23:42:56,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:42:56,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 23:42:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-27 23:42:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-27 23:42:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2019-11-27 23:42:56,205 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 8 [2019-11-27 23:42:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:42:56,206 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2019-11-27 23:42:56,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:42:56,207 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2019-11-27 23:42:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:42:56,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:42:56,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:42:56,208 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:42:56,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:42:56,209 INFO L82 PathProgramCache]: Analyzing trace with hash 331839487, now seen corresponding path program 1 times [2019-11-27 23:42:56,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:42:56,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809504585] [2019-11-27 23:42:56,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:42:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:42:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:42:56,294 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:42:56,294 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:42:56,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:42:56 BoogieIcfgContainer [2019-11-27 23:42:56,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:42:56,329 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:42:56,329 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:42:56,330 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:42:56,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:42:55" (3/4) ... [2019-11-27 23:42:56,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:42:56,335 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:42:56,338 INFO L168 Benchmark]: Toolchain (without parser) took 1687.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 959.0 MB in the beginning and 1.0 GB in the end (delta: -85.1 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:42:56,339 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:42:56,340 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:42:56,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:42:56,341 INFO L168 Benchmark]: Boogie Preprocessor took 47.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:42:56,342 INFO L168 Benchmark]: RCFGBuilder took 637.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:42:56,343 INFO L168 Benchmark]: TraceAbstraction took 497.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:42:56,344 INFO L168 Benchmark]: Witness Printer took 5.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:42:56,349 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.97 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.70 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 637.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 497.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.85 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33, overapproximation of bitwiseAnd at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 153. Possible FailurePath: [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L149] double x = -0.0; [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (ix0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (ix1) = ew_u.parts.lsw [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L154] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 73 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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.1.24-30f4e4a [2019-11-27 23:42:58,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:42:58,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:42:58,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:42:58,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:42:58,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:42:58,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:42:58,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:42:58,510 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:42:58,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:42:58,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:42:58,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:42:58,517 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:42:58,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:42:58,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:42:58,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:42:58,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:42:58,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:42:58,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:42:58,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:42:58,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:42:58,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:42:58,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:42:58,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:42:58,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:42:58,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:42:58,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:42:58,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:42:58,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:42:58,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:42:58,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:42:58,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:42:58,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:42:58,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:42:58,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:42:58,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:42:58,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:42:58,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:42:58,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:42:58,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:42:58,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:42:58,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:42:58,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:42:58,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:42:58,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:42:58,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:42:58,568 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:42:58,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:42:58,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:42:58,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:42:58,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:42:58,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:42:58,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:42:58,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:42:58,570 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:42:58,570 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:42:58,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:42:58,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:42:58,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:42:58,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:42:58,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:42:58,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:42:58,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:42:58,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:42:58,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:42:58,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:42:58,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:42:58,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:42:58,574 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:42:58,574 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:42:58,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:42:58,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:42:58,575 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 788527977e7ebd7aa0a832758f41b65d3cbd270a [2019-11-27 23:42:58,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:42:58,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:42:58,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:42:58,922 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:42:58,922 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:42:58,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0730b.c [2019-11-27 23:42:58,993 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a660c15/2d096af356a144c6b5af85a7b99b400d/FLAG866ca26ad [2019-11-27 23:42:59,472 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:42:59,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0730b.c [2019-11-27 23:42:59,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a660c15/2d096af356a144c6b5af85a7b99b400d/FLAG866ca26ad [2019-11-27 23:42:59,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38a660c15/2d096af356a144c6b5af85a7b99b400d [2019-11-27 23:42:59,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:42:59,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:42:59,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:42:59,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:42:59,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:42:59,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:42:59" (1/1) ... [2019-11-27 23:42:59,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edcc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:42:59, skipping insertion in model container [2019-11-27 23:42:59,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:42:59" (1/1) ... [2019-11-27 23:42:59,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:42:59,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:43:00,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:43:00,151 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:43:00,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:43:00,296 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:43:00,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00 WrapperNode [2019-11-27 23:43:00,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:43:00,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:43:00,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:43:00,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:43:00,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:43:00,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:43:00,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:43:00,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:43:00,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (1/1) ... [2019-11-27 23:43:00,406 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:43:00,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:43:00,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:43:00,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:43:00,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (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 [2019-11-27 23:43:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-27 23:43:00,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-27 23:43:00,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:43:00,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:43:00,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:43:00,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:43:00,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 23:43:00,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:43:04,786 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:43:04,786 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:43:04,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:43:04 BoogieIcfgContainer [2019-11-27 23:43:04,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:43:04,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:43:04,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:43:04,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:43:04,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:42:59" (1/3) ... [2019-11-27 23:43:04,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3b5490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:43:04, skipping insertion in model container [2019-11-27 23:43:04,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:43:00" (2/3) ... [2019-11-27 23:43:04,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3b5490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:43:04, skipping insertion in model container [2019-11-27 23:43:04,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:43:04" (3/3) ... [2019-11-27 23:43:04,799 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730b.c [2019-11-27 23:43:04,809 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:43:04,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:43:04,830 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:43:04,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:43:04,854 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:43:04,854 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:43:04,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:43:04,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:43:04,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:43:04,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:43:04,856 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:43:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2019-11-27 23:43:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 23:43:04,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:43:04,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:43:04,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:43:04,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:43:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 361085180, now seen corresponding path program 1 times [2019-11-27 23:43:04,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:43:04,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712541290] [2019-11-27 23:43:04,900 INFO L94 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 [2019-11-27 23:43:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:43:05,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:43:05,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:43:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:05,287 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:43:05,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:05,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712541290] [2019-11-27 23:43:05,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:43:05,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:43:05,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878378979] [2019-11-27 23:43:05,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:43:05,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:43:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:43:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:43:05,319 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2019-11-27 23:43:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:43:05,358 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2019-11-27 23:43:05,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:43:05,361 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-27 23:43:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:43:05,386 INFO L225 Difference]: With dead ends: 104 [2019-11-27 23:43:05,387 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 23:43:05,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:43:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 23:43:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-27 23:43:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-27 23:43:05,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2019-11-27 23:43:05,451 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 8 [2019-11-27 23:43:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:43:05,452 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2019-11-27 23:43:05,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:43:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2019-11-27 23:43:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 23:43:05,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:43:05,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:43:05,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:43:05,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:43:05,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:43:05,670 INFO L82 PathProgramCache]: Analyzing trace with hash 331839487, now seen corresponding path program 1 times [2019-11-27 23:43:05,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:43:05,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197149194] [2019-11-27 23:43:05,672 INFO L94 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 [2019-11-27 23:43:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:43:06,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 23:43:06,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:43:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:06,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:43:06,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:06,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197149194] [2019-11-27 23:43:06,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:43:06,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:43:06,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824751358] [2019-11-27 23:43:06,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:43:06,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:43:06,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:43:06,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:43:06,211 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand 6 states. [2019-11-27 23:43:07,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:43:07,678 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2019-11-27 23:43:08,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:43:08,064 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-27 23:43:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:43:08,065 INFO L225 Difference]: With dead ends: 59 [2019-11-27 23:43:08,065 INFO L226 Difference]: Without dead ends: 17 [2019-11-27 23:43:08,067 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:43:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-27 23:43:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-27 23:43:08,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-27 23:43:08,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-27 23:43:08,072 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2019-11-27 23:43:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:43:08,072 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-27 23:43:08,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:43:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-27 23:43:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:43:08,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:43:08,074 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:43:08,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:43:08,279 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:43:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:43:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1929218748, now seen corresponding path program 1 times [2019-11-27 23:43:08,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:43:08,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557769432] [2019-11-27 23:43:08,285 INFO L94 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 [2019-11-27 23:43:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:43:08,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 23:43:08,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:43:08,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:08,443 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:43:08,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:43:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:08,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557769432] [2019-11-27 23:43:08,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:43:08,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-27 23:43:08,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59906833] [2019-11-27 23:43:08,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:43:08,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:43:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:43:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:43:08,487 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-11-27 23:43:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:43:10,915 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-11-27 23:43:10,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:43:10,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-27 23:43:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:43:10,916 INFO L225 Difference]: With dead ends: 29 [2019-11-27 23:43:10,916 INFO L226 Difference]: Without dead ends: 26 [2019-11-27 23:43:10,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:43:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-27 23:43:10,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2019-11-27 23:43:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-27 23:43:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-11-27 23:43:10,923 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2019-11-27 23:43:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:43:10,923 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-11-27 23:43:10,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:43:10,924 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-11-27 23:43:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 23:43:10,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:43:10,925 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:43:11,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:43:11,138 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:43:11,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:43:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash 239121058, now seen corresponding path program 1 times [2019-11-27 23:43:11,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:43:11,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958754243] [2019-11-27 23:43:11,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-27 23:43:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:43:12,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:43:12,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:43:12,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-11-27 23:43:12,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-27 23:43:12,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2019-11-27 23:43:12,158 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,188 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2019-11-27 23:43:12,206 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,228 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,238 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2019-11-27 23:43:12,240 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,251 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,251 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,279 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,281 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:43:12,281 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:34 [2019-11-27 23:43:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:12,330 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:43:12,425 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 66 treesize of output 68 [2019-11-27 23:43:12,476 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 71 [2019-11-27 23:43:12,479 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,516 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-27 23:43:12,532 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,562 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,572 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 25 [2019-11-27 23:43:12,575 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,589 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,590 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:43:12,609 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:43:12,610 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:43:12,610 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:33 [2019-11-27 23:43:12,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:12,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958754243] [2019-11-27 23:43:12,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:43:12,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:43:12,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129680696] [2019-11-27 23:43:12,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:43:12,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:43:12,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:43:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:43:12,653 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2019-11-27 23:43:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:43:12,717 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-11-27 23:43:12,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:43:12,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-27 23:43:12,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:43:12,719 INFO L225 Difference]: With dead ends: 26 [2019-11-27 23:43:12,719 INFO L226 Difference]: Without dead ends: 16 [2019-11-27 23:43:12,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:43:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-27 23:43:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-27 23:43:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-27 23:43:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2019-11-27 23:43:12,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 12 [2019-11-27 23:43:12,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:43:12,726 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2019-11-27 23:43:12,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:43:12,726 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2019-11-27 23:43:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:43:12,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:43:12,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:43:12,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:43:12,938 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:43:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:43:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 264903321, now seen corresponding path program 1 times [2019-11-27 23:43:12,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:43:12,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704258474] [2019-11-27 23:43:12,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:43:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:43:13,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-27 23:43:13,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:43:13,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:43:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:13,176 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:43:13,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:43:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:43:13,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704258474] [2019-11-27 23:43:13,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:43:13,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 14 [2019-11-27 23:43:13,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404593733] [2019-11-27 23:43:13,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:43:13,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:43:13,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:43:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:43:13,452 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 14 states. [2019-11-27 23:43:13,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:43:13,809 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-11-27 23:43:13,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:43:13,810 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-11-27 23:43:13,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:43:13,810 INFO L225 Difference]: With dead ends: 16 [2019-11-27 23:43:13,811 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:43:13,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:43:13,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:43:13,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:43:13,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:43:13,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:43:13,813 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-11-27 23:43:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:43:13,813 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:43:13,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:43:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:43:13,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:43:14,021 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:43:14,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:43:14,230 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-27 23:43:14,353 INFO L242 CegarLoopResult]: At program point L126(lines 19 127) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start___ieee754_sqrt_~x .cse0) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_skolemized_v_prenex_2_3)) (.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|))) (and (= ULTIMATE.start___ieee754_sqrt_~ix1~0 .cse1) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.neg (_ +zero 11 53))) (= .cse2 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) .cse1) (= ULTIMATE.start___ieee754_sqrt_~ix0~0 .cse2)))) (= |ULTIMATE.start___ieee754_sqrt_#res| .cse0))) [2019-11-27 23:43:14,353 INFO L246 CegarLoopResult]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L85-2(lines 85 94) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L44(lines 44 55) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L44-2(lines 44 55) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L36(lines 36 41) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L242 CegarLoopResult]: At program point L69-2(lines 69 79) the Hoare annotation is: false [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L36-2(lines 36 41) no Hoare annotation was computed. [2019-11-27 23:43:14,354 INFO L246 CegarLoopResult]: For program point L69-3(lines 69 79) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L242 CegarLoopResult]: At program point L45-2(lines 45 49) the Hoare annotation is: false [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point L45-3(lines 45 49) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point L87(lines 87 88) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point L120-1(lines 120 125) no Hoare annotation was computed. [2019-11-27 23:43:14,355 INFO L246 CegarLoopResult]: For program point L153-2(lines 153 156) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L242 CegarLoopResult]: At program point L120-2(lines 120 125) the Hoare annotation is: false [2019-11-27 23:43:14,356 INFO L246 CegarLoopResult]: For program point L87-2(lines 87 88) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L246 CegarLoopResult]: For program point L120-3(lines 120 125) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L246 CegarLoopResult]: For program point L104(lines 104 112) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L246 CegarLoopResult]: For program point L71(lines 71 75) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L246 CegarLoopResult]: For program point L71-2(lines 71 75) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L246 CegarLoopResult]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-27 23:43:14,356 INFO L242 CegarLoopResult]: At program point L138(lines 129 139) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start___ieee754_sqrt_~x .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_skolemized_v_prenex_2_3)) (.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|))) (and (= ULTIMATE.start___ieee754_sqrt_~ix1~0 .cse1) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.neg (_ +zero 11 53))) (= .cse2 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) .cse1) (= ULTIMATE.start___ieee754_sqrt_~ix0~0 .cse2)))) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (= |ULTIMATE.start___ieee754_sqrt_#res| .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0))) [2019-11-27 23:43:14,357 INFO L246 CegarLoopResult]: For program point L39(lines 39 40) no Hoare annotation was computed. [2019-11-27 23:43:14,357 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:43:14,357 INFO L246 CegarLoopResult]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-27 23:43:14,357 INFO L246 CegarLoopResult]: For program point L90-2(lines 90 91) no Hoare annotation was computed. [2019-11-27 23:43:14,357 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2019-11-27 23:43:14,357 INFO L242 CegarLoopResult]: At program point L82-2(lines 82 98) the Hoare annotation is: false [2019-11-27 23:43:14,357 INFO L246 CegarLoopResult]: For program point L82-3(lines 19 127) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point L107(lines 107 112) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point L132-1(lines 132 136) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L242 CegarLoopResult]: At program point L132-2(lines 132 136) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start___ieee754_sqrt_~x .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) v_skolemized_v_prenex_2_3)) (.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|))) (and (= ULTIMATE.start___ieee754_sqrt_~ix1~0 .cse1) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.neg (_ +zero 11 53))) (= .cse2 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|) .cse1) (= ULTIMATE.start___ieee754_sqrt_~ix0~0 .cse2)))) (= |ULTIMATE.start___ieee754_sqrt_#res| .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0))) [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point L132-3(lines 132 136) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point L58(lines 58 61) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point L25-1(lines 25 30) no Hoare annotation was computed. [2019-11-27 23:43:14,358 INFO L246 CegarLoopResult]: For program point L58-2(lines 58 61) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L242 CegarLoopResult]: At program point L25-2(lines 25 30) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_sqrt_~x (fp.neg (_ +zero 11 53))) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2019-11-27 23:43:14,359 INFO L246 CegarLoopResult]: For program point L25-3(lines 19 127) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L246 CegarLoopResult]: For program point L50-2(lines 50 51) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L242 CegarLoopResult]: At program point L50-3(lines 50 51) the Hoare annotation is: false [2019-11-27 23:43:14,359 INFO L246 CegarLoopResult]: For program point L50-4(lines 50 51) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L246 CegarLoopResult]: For program point L108(lines 108 109) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L246 CegarLoopResult]: For program point L108-2(lines 108 109) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L246 CegarLoopResult]: For program point L100(lines 100 114) no Hoare annotation was computed. [2019-11-27 23:43:14,359 INFO L249 CegarLoopResult]: At program point L158(lines 141 159) the Hoare annotation is: true [2019-11-27 23:43:14,360 INFO L246 CegarLoopResult]: For program point L117(lines 117 118) no Hoare annotation was computed. [2019-11-27 23:43:14,360 INFO L246 CegarLoopResult]: For program point L117-2(lines 117 118) no Hoare annotation was computed. [2019-11-27 23:43:14,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,385 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,388 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,389 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,392 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,393 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:43:14 BoogieIcfgContainer [2019-11-27 23:43:14,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:43:14,396 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:43:14,396 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:43:14,396 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:43:14,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:43:04" (3/4) ... [2019-11-27 23:43:14,402 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:43:14,416 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-27 23:43:14,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-27 23:43:14,417 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:43:14,448 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_skolemized_v_prenex_2_3 : bv64, v_skolemized_q#valueAsBitvector_6 : bv64 :: (((ix1 == v_skolemized_v_prenex_2_3[31:0] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_6[63:32] == v_skolemized_v_prenex_2_3[63:32]) && v_skolemized_q#valueAsBitvector_6[31:0] == v_skolemized_v_prenex_2_3[31:0]) && ix0 == v_skolemized_q#valueAsBitvector_6[63:32])) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:43:14,449 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_skolemized_v_prenex_2_3 : bv64, v_skolemized_q#valueAsBitvector_6 : bv64 :: (((ix1 == v_skolemized_v_prenex_2_3[31:0] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_6[63:32] == v_skolemized_v_prenex_2_3[63:32]) && v_skolemized_q#valueAsBitvector_6[31:0] == v_skolemized_v_prenex_2_3[31:0]) && ix0 == v_skolemized_q#valueAsBitvector_6[63:32])) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:43:14,449 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_skolemized_v_prenex_2_3 : bv64, v_skolemized_q#valueAsBitvector_6 : bv64 :: (((ix1 == v_skolemized_v_prenex_2_3[31:0] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_6[63:32] == v_skolemized_v_prenex_2_3[63:32]) && v_skolemized_q#valueAsBitvector_6[31:0] == v_skolemized_v_prenex_2_3[31:0]) && ix0 == v_skolemized_q#valueAsBitvector_6[63:32])) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_q#valueAsBitvector_7[63:32])) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:43:14,497 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:43:14,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:43:14,499 INFO L168 Benchmark]: Toolchain (without parser) took 14649.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 961.7 MB in the beginning and 854.4 MB in the end (delta: 107.3 MB). Peak memory consumption was 251.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:43:14,499 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:43:14,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:43:14,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:43:14,501 INFO L168 Benchmark]: Boogie Preprocessor took 62.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:43:14,501 INFO L168 Benchmark]: RCFGBuilder took 4371.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:43:14,501 INFO L168 Benchmark]: TraceAbstraction took 9606.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.0 MB in the end (delta: 233.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:43:14,502 INFO L168 Benchmark]: Witness Printer took 101.37 ms. Allocated memory is still 1.2 GB. Free memory was 861.0 MB in the beginning and 854.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:43:14,504 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 444.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -172.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4371.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9606.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.0 MB in the end (delta: 233.3 MB). Peak memory consumption was 233.3 MB. Max. memory is 11.5 GB. * Witness Printer took 101.37 ms. Allocated memory is still 1.2 GB. Free memory was 861.0 MB in the beginning and 854.4 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 129]: Loop Invariant [2019-11-27 23:43:14,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:43:14,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_skolemized_v_prenex_2_3 : bv64, v_skolemized_q#valueAsBitvector_6 : bv64 :: (((ix1 == v_skolemized_v_prenex_2_3[31:0] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_6[63:32] == v_skolemized_v_prenex_2_3[63:32]) && v_skolemized_q#valueAsBitvector_6[31:0] == v_skolemized_v_prenex_2_3[31:0]) && ix0 == v_skolemized_q#valueAsBitvector_6[63:32])) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_q#valueAsBitvector_7[63:32])) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 132]: Loop Invariant [2019-11-27 23:43:14,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] Derived loop invariant: (((((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_skolemized_v_prenex_2_3 : bv64, v_skolemized_q#valueAsBitvector_6 : bv64 :: (((ix1 == v_skolemized_v_prenex_2_3[31:0] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_6[63:32] == v_skolemized_v_prenex_2_3[63:32]) && v_skolemized_q#valueAsBitvector_6[31:0] == v_skolemized_v_prenex_2_3[31:0]) && ix0 == v_skolemized_q#valueAsBitvector_6[63:32])) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant [2019-11-27 23:43:14,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,529 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-27 23:43:14,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:43:14,530 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] Derived loop invariant: ((x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(sign, 2147483648bv32) == 0bv32) && (\exists v_skolemized_v_prenex_2_3 : bv64, v_skolemized_q#valueAsBitvector_6 : bv64 :: (((ix1 == v_skolemized_v_prenex_2_3[31:0] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_6[63:32] == v_skolemized_v_prenex_2_3[63:32]) && v_skolemized_q#valueAsBitvector_6[31:0] == v_skolemized_v_prenex_2_3[31:0]) && ix0 == v_skolemized_q#valueAsBitvector_6[63:32])) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 117 SDtfs, 169 SDslu, 74 SDs, 0 SdLazy, 65 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 187 HoareAnnotationTreeSize, 10 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 100 ConstructedInterpolants, 18 QuantifiedInterpolants, 7290 SizeOfPredicates, 28 NumberOfNonLiveVariables, 194 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...