./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.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_1232a.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 4284cb37841cd94fe17da64cc250a8a1e69c6375 .............................................................................................................................................................................................................................................................................................................................................................. 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_1232a.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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45:32,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:45:32,453 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:45:32,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:45:32,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:45:32,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:45:32,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:45:32,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:45:32,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:45:32,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:45:32,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:45:32,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:45:32,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:45:32,501 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:45:32,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:45:32,503 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:45:32,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:45:32,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:45:32,506 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:45:32,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:45:32,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:45:32,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:45:32,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:45:32,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:45:32,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:45:32,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:45:32,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:45:32,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:45:32,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:45:32,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:45:32,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:45:32,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:45:32,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:45:32,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:45:32,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:45:32,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:45:32,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:45:32,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:45:32,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:45:32,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:45:32,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:45:32,525 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:45:32,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:45:32,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:45:32,560 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:45:32,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:45:32,560 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:45:32,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:45:32,561 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:45:32,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:45:32,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:45:32,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:45:32,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:45:32,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:45:32,564 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:45:32,564 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:45:32,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:45:32,565 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:45:32,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:45:32,565 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:45:32,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:45:32,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:45:32,566 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:45:32,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:32,566 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:45:32,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:45:32,567 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:45:32,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:45:32,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:45:32,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:45:32,568 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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-27 23:45:32,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:45:32,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:45:32,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:45:32,921 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:45:32,921 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:45:32,922 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-27 23:45:32,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78da9d97d/2bc27a0d3ebd4d829f9f61daade80f4f/FLAG644b2252b [2019-11-27 23:45:33,488 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:45:33,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-27 23:45:33,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78da9d97d/2bc27a0d3ebd4d829f9f61daade80f4f/FLAG644b2252b [2019-11-27 23:45:33,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78da9d97d/2bc27a0d3ebd4d829f9f61daade80f4f [2019-11-27 23:45:33,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:45:33,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:45:33,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:33,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:45:33,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:45:33,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:33" (1/1) ... [2019-11-27 23:45:33,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172c1d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:33, skipping insertion in model container [2019-11-27 23:45:33,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:33" (1/1) ... [2019-11-27 23:45:33,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:45:33,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:45:34,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:34,154 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:45:34,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:34,307 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:45:34,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34 WrapperNode [2019-11-27 23:45:34,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:34,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:34,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:45:34,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:45:34,315 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:45:34" (1/1) ... [2019-11-27 23:45:34,324 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:45:34" (1/1) ... [2019-11-27 23:45:34,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:34,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:45:34,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:45:34,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:45:34,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (1/1) ... [2019-11-27 23:45:34,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:45:34,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:45:34,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:45:34,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:45:34,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (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:45:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:45:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:45:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:45:34,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:45:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:45:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:45:34,884 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:45:34,884 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:45:34,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:34 BoogieIcfgContainer [2019-11-27 23:45:34,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:45:34,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:45:34,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:45:34,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:45:34,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:45:33" (1/3) ... [2019-11-27 23:45:34,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57748896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:34, skipping insertion in model container [2019-11-27 23:45:34,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:34" (2/3) ... [2019-11-27 23:45:34,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57748896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:34, skipping insertion in model container [2019-11-27 23:45:34,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:34" (3/3) ... [2019-11-27 23:45:34,894 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-27 23:45:34,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:45:34,911 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:45:34,923 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:45:34,944 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:45:34,945 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:45:34,945 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:45:34,945 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:45:34,945 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:45:34,946 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:45:34,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:45:34,946 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:45:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-27 23:45:34,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:45:34,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:34,966 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:34,966 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:34,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:34,972 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-27 23:45:34,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:34,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062693538] [2019-11-27 23:45:34,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:35,098 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:45:35,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062693538] [2019-11-27 23:45:35,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:35,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:45:35,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9834003] [2019-11-27 23:45:35,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:45:35,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:45:35,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:35,123 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-27 23:45:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:35,146 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-27 23:45:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:45:35,148 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 23:45:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:35,159 INFO L225 Difference]: With dead ends: 62 [2019-11-27 23:45:35,159 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 23:45:35,162 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:45:35,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 23:45:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-27 23:45:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-27 23:45:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-27 23:45:35,199 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-27 23:45:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:35,199 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-27 23:45:35,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:45:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-27 23:45:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:45:35,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:35,200 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:35,201 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-27 23:45:35,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:35,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100920119] [2019-11-27 23:45:35,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:35,306 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:45:35,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100920119] [2019-11-27 23:45:35,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:35,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:45:35,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279712479] [2019-11-27 23:45:35,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:45:35,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:35,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:45:35,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:45:35,311 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-27 23:45:35,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:35,397 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-27 23:45:35,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:45:35,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-27 23:45:35,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:35,400 INFO L225 Difference]: With dead ends: 53 [2019-11-27 23:45:35,401 INFO L226 Difference]: Without dead ends: 44 [2019-11-27 23:45:35,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:45:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-27 23:45:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-27 23:45:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:45:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-27 23:45:35,413 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-27 23:45:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:35,414 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-27 23:45:35,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:45:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-27 23:45:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:45:35,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:35,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:35,417 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:35,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:35,417 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-27 23:45:35,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:35,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522255685] [2019-11-27 23:45:35,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:35,535 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:45:35,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522255685] [2019-11-27 23:45:35,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:35,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:45:35,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990017369] [2019-11-27 23:45:35,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:45:35,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:35,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:45:35,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:45:35,538 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-27 23:45:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:35,614 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-27 23:45:35,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:45:35,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-27 23:45:35,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:35,618 INFO L225 Difference]: With dead ends: 55 [2019-11-27 23:45:35,618 INFO L226 Difference]: Without dead ends: 46 [2019-11-27 23:45:35,619 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:45:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-27 23:45:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-27 23:45:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:45:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-27 23:45:35,630 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-27 23:45:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:35,632 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-27 23:45:35,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:45:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-27 23:45:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:45:35,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:35,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:35,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:35,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:35,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-27 23:45:35,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:35,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636668506] [2019-11-27 23:45:35,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:45:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:45:35,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:45:35,700 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:45:35,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:45:35 BoogieIcfgContainer [2019-11-27 23:45:35,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:45:35,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:45:35,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:45:35,725 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:45:35,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:34" (3/4) ... [2019-11-27 23:45:35,729 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:45:35,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:45:35,731 INFO L168 Benchmark]: Toolchain (without parser) took 1913.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -47.3 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:35,732 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:35,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:35,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.73 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:45:35,734 INFO L168 Benchmark]: Boogie Preprocessor took 37.43 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:45:35,735 INFO L168 Benchmark]: RCFGBuilder took 484.75 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: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:35,735 INFO L168 Benchmark]: TraceAbstraction took 838.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:35,736 INFO L168 Benchmark]: Witness Printer took 3.93 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:45:35,740 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 488.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -118.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.73 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 37.43 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. * RCFGBuilder took 484.75 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: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 838.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 42.7 MB). Peak memory consumption was 42.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.93 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: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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:45:37,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:45:37,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:45:37,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:45:37,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:45:37,760 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:45:37,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:45:37,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:45:37,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:45:37,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:45:37,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:45:37,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:45:37,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:45:37,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:45:37,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:45:37,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:45:37,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:45:37,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:45:37,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:45:37,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:45:37,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:45:37,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:45:37,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:45:37,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:45:37,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:45:37,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:45:37,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:45:37,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:45:37,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:45:37,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:45:37,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:45:37,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:45:37,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:45:37,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:45:37,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:45:37,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:45:37,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:45:37,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:45:37,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:45:37,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:45:37,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:45:37,832 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:45:37,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:45:37,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:45:37,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:45:37,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:45:37,876 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:45:37,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:45:37,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:45:37,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:45:37,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:45:37,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:45:37,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:45:37,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:45:37,878 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:45:37,879 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:45:37,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:45:37,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:45:37,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:45:37,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:45:37,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:45:37,880 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:45:37,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:45:37,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:45:37,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:37,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:45:37,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:45:37,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:45:37,882 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:45:37,883 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:45:37,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:45:37,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:45:37,883 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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-27 23:45:38,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:45:38,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:45:38,239 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:45:38,240 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:45:38,240 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:45:38,242 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-27 23:45:38,309 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda8e1267/0aa7617badf64f8b9699f678404bc2f5/FLAGcfdeda41f [2019-11-27 23:45:38,765 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:45:38,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-27 23:45:38,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda8e1267/0aa7617badf64f8b9699f678404bc2f5/FLAGcfdeda41f [2019-11-27 23:45:39,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fda8e1267/0aa7617badf64f8b9699f678404bc2f5 [2019-11-27 23:45:39,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:45:39,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:45:39,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:39,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:45:39,153 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:45:39,154 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4e3de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39, skipping insertion in model container [2019-11-27 23:45:39,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:45:39,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:45:39,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:39,433 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:45:39,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:39,608 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:45:39,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39 WrapperNode [2019-11-27 23:45:39,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:39,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:39,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:45:39,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:45:39,621 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:45:39" (1/1) ... [2019-11-27 23:45:39,649 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:45:39" (1/1) ... [2019-11-27 23:45:39,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:39,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:45:39,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:45:39,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:45:39,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (1/1) ... [2019-11-27 23:45:39,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:45:39,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:45:39,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:45:39,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:45:39,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (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:45:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-27 23:45:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:45:39,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:45:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:45:39,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:45:39,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:45:40,354 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:45:40,354 INFO L297 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-27 23:45:40,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:40 BoogieIcfgContainer [2019-11-27 23:45:40,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:45:40,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:45:40,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:45:40,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:45:40,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:45:39" (1/3) ... [2019-11-27 23:45:40,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25313d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:40, skipping insertion in model container [2019-11-27 23:45:40,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:39" (2/3) ... [2019-11-27 23:45:40,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25313d6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:40, skipping insertion in model container [2019-11-27 23:45:40,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:40" (3/3) ... [2019-11-27 23:45:40,365 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-27 23:45:40,375 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:45:40,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:45:40,395 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:45:40,421 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:45:40,421 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:45:40,421 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:45:40,421 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:45:40,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:45:40,422 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:45:40,422 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:45:40,422 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:45:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-27 23:45:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 23:45:40,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:40,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:40,441 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:40,447 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-27 23:45:40,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:40,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805204090] [2019-11-27 23:45:40,457 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:45:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:40,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:45:40,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:40,579 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:45:40,579 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:40,583 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:45:40,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805204090] [2019-11-27 23:45:40,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:40,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:45:40,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730461669] [2019-11-27 23:45:40,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:45:40,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:40,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:45:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:40,602 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-27 23:45:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:40,621 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-27 23:45:40,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:45:40,622 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-27 23:45:40,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:40,634 INFO L225 Difference]: With dead ends: 62 [2019-11-27 23:45:40,634 INFO L226 Difference]: Without dead ends: 29 [2019-11-27 23:45:40,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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:45:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-27 23:45:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-27 23:45:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-27 23:45:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-27 23:45:40,674 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-27 23:45:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:40,675 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-27 23:45:40,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:45:40,675 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-27 23:45:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-27 23:45:40,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:40,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:40,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:45:40,891 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:40,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-27 23:45:40,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:40,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181298055] [2019-11-27 23:45:40,897 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:45:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:40,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:45:40,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:41,016 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:45:41,017 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:41,040 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:45:41,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181298055] [2019-11-27 23:45:41,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:41,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:45:41,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603726129] [2019-11-27 23:45:41,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:45:41,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:45:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:45:41,044 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-27 23:45:41,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:41,168 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-27 23:45:41,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:45:41,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-27 23:45:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:41,170 INFO L225 Difference]: With dead ends: 68 [2019-11-27 23:45:41,170 INFO L226 Difference]: Without dead ends: 59 [2019-11-27 23:45:41,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:45:41,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-27 23:45:41,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-27 23:45:41,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-27 23:45:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-27 23:45:41,180 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-27 23:45:41,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:41,180 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-27 23:45:41,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:45:41,180 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-27 23:45:41,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 23:45:41,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:41,182 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:41,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:45:41,406 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:41,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-27 23:45:41,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:41,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292368141] [2019-11-27 23:45:41,411 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:45:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:41,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:45:41,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:41,548 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:45:41,548 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:41,588 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:45:41,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292368141] [2019-11-27 23:45:41,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:41,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:45:41,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383208246] [2019-11-27 23:45:41,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:45:41,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:41,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:45:41,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:45:41,591 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-27 23:45:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:41,696 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-27 23:45:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:45:41,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-27 23:45:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:41,698 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:45:41,698 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 23:45:41,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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:45:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 23:45:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-27 23:45:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:45:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-27 23:45:41,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-27 23:45:41,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:41,705 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-27 23:45:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:45:41,706 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-27 23:45:41,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:45:41,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:41,707 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:41,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:45:41,920 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:41,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-27 23:45:41,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:41,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288289674] [2019-11-27 23:45:41,922 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:45:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:42,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:45:42,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:42,063 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:45:42,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:42,080 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:45:42,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288289674] [2019-11-27 23:45:42,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:42,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:45:42,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111194198] [2019-11-27 23:45:42,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:45:42,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:45:42,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:45:42,083 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-27 23:45:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:42,182 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-27 23:45:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:45:42,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-27 23:45:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:42,184 INFO L225 Difference]: With dead ends: 65 [2019-11-27 23:45:42,184 INFO L226 Difference]: Without dead ends: 56 [2019-11-27 23:45:42,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:45:42,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-27 23:45:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-27 23:45:42,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:45:42,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-27 23:45:42,193 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-27 23:45:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:42,193 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-27 23:45:42,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:45:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-27 23:45:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:45:42,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:42,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:42,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:45:42,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-27 23:45:42,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:42,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080990437] [2019-11-27 23:45:42,401 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:45:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:42,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-27 23:45:42,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:42,535 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:45:42,535 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:42,569 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:45:42,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080990437] [2019-11-27 23:45:42,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:42,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-27 23:45:42,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80746630] [2019-11-27 23:45:42,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:45:42,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:42,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:45:42,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:45:42,571 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-27 23:45:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:42,587 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-27 23:45:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:45:42,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 23:45:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:42,589 INFO L225 Difference]: With dead ends: 40 [2019-11-27 23:45:42,589 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:45:42,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:45:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:45:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-27 23:45:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:45:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-27 23:45:42,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-27 23:45:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:42,596 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-27 23:45:42,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:45:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-27 23:45:42,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:45:42,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:42,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:42,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:45:42,798 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-27 23:45:42,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:42,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642878611] [2019-11-27 23:45:42,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:42,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:45:42,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:42,995 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:45:42,995 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:42,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:43,057 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:45:43,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642878611] [2019-11-27 23:45:43,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:43,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-27 23:45:43,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159701166] [2019-11-27 23:45:43,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:45:43,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:43,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:45:43,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:45:43,060 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-27 23:45:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:43,205 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-27 23:45:43,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:45:43,205 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-27 23:45:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:43,206 INFO L225 Difference]: With dead ends: 42 [2019-11-27 23:45:43,206 INFO L226 Difference]: Without dead ends: 39 [2019-11-27 23:45:43,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:45:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-27 23:45:43,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-27 23:45:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-27 23:45:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-27 23:45:43,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-27 23:45:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:43,213 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-27 23:45:43,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:45:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-27 23:45:43,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:45:43,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:43,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:43,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 23:45:43,416 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:43,416 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-27 23:45:43,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:43,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591534595] [2019-11-27 23:45:43,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:43,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:43,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:45:43,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:43,556 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:45:43,556 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:43,708 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:45:43,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591534595] [2019-11-27 23:45:43,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:43,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-27 23:45:43,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192518079] [2019-11-27 23:45:43,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:45:43,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:43,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:45:43,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:45:43,712 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-27 23:45:43,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:43,842 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-27 23:45:43,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:45:43,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-27 23:45:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:43,844 INFO L225 Difference]: With dead ends: 45 [2019-11-27 23:45:43,844 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:43,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:45:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:43,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-27 23:45:43,851 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-27 23:45:43,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:43,851 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-27 23:45:43,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:45:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-27 23:45:43,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:45:43,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:43,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:44,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 23:45:44,066 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:44,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:44,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-27 23:45:44,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:44,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474991828] [2019-11-27 23:45:44,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:44,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:44,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 23:45:44,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:44,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:44,322 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:45:44,322 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:44,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:44,600 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:45:44,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474991828] [2019-11-27 23:45:44,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:44,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-27 23:45:44,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829028277] [2019-11-27 23:45:44,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:45:44,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:44,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:45:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:45:44,603 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-27 23:45:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:44,960 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-27 23:45:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:45:44,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-27 23:45:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:44,961 INFO L225 Difference]: With dead ends: 27 [2019-11-27 23:45:44,962 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:45:44,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:45:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:45:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:45:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:45:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:45:44,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-27 23:45:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:44,964 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:45:44,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:45:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:45:44,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:45:45,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 23:45:45,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:45:45,589 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,589 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,590 INFO L246 CegarLoopResult]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-11-27 23:45:45,590 INFO L242 CegarLoopResult]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-27 23:45:45,590 INFO L246 CegarLoopResult]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-11-27 23:45:45,590 INFO L246 CegarLoopResult]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-11-27 23:45:45,590 INFO L242 CegarLoopResult]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-27 23:45:45,591 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-27 23:45:45,591 INFO L246 CegarLoopResult]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-11-27 23:45:45,591 INFO L246 CegarLoopResult]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-11-27 23:45:45,591 INFO L246 CegarLoopResult]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-27 23:45:45,591 INFO L246 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-27 23:45:45,592 INFO L246 CegarLoopResult]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-11-27 23:45:45,592 INFO L242 CegarLoopResult]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (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))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (fp.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-27 23:45:45,592 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-27 23:45:45,592 INFO L246 CegarLoopResult]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-11-27 23:45:45,593 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-11-27 23:45:45,593 INFO L246 CegarLoopResult]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-11-27 23:45:45,593 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,595 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-11-27 23:45:45,596 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-27 23:45:45,597 INFO L242 CegarLoopResult]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (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))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-27 23:45:45,597 INFO L246 CegarLoopResult]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-11-27 23:45:45,597 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:45:45,597 INFO L242 CegarLoopResult]: At program point L42(lines 18 43) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3))) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-27 23:45:45,598 INFO L242 CegarLoopResult]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (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))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-27 23:45:45,598 INFO L246 CegarLoopResult]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-27 23:45:45,598 INFO L246 CegarLoopResult]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-11-27 23:45:45,598 INFO L249 CegarLoopResult]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-11-27 23:45:45,598 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-27 23:45:45,599 INFO L246 CegarLoopResult]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-27 23:45:45,600 INFO L242 CegarLoopResult]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (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))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-27 23:45:45,616 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:45:45 BoogieIcfgContainer [2019-11-27 23:45:45,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:45:45,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:45:45,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:45:45,679 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:45:45,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:40" (3/4) ... [2019-11-27 23:45:45,683 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:45:45,703 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-27 23:45:45,703 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-27 23:45:45,704 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:45:45,733 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() [2019-11-27 23:45:45,734 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:45:45,734 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:45:45,735 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:45:45,735 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-27 23:45:45,777 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:45:45,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:45:45,780 INFO L168 Benchmark]: Toolchain (without parser) took 6631.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -197.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:45,780 INFO L168 Benchmark]: CDTParser took 0.20 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:45:45,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.39 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:45:45,786 INFO L168 Benchmark]: Boogie Preprocessor took 78.45 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,787 INFO L168 Benchmark]: RCFGBuilder took 579.24 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,787 INFO L168 Benchmark]: TraceAbstraction took 5320.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.9 MB). Peak memory consumption was 305.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,787 INFO L168 Benchmark]: Witness Printer took 99.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:45,795 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.20 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 460.70 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -128.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 85.39 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 78.45 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 579.24 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: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5320.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -104.9 MB). Peak memory consumption was 305.8 MB. Max. memory is 11.5 GB. * Witness Printer took 99.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 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_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_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,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_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,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_v_prenex_2_3,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_v_prenex_2_3,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_v_prenex_2_3,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_v_prenex_2_3,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_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_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_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_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_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] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: 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: 54]: Loop Invariant [2019-11-27 23:45:45,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-27 23:45:45,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2019-11-27 23:45:45,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,812 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,813 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-27 23:45:45,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 45]: Loop Invariant [2019-11-27 23:45:45,814 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,815 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,816 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 57]: Loop Invariant [2019-11-27 23:45:45,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,817 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,818 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,819 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,820 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-11-27 23:45:45,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,821 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,822 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-27 23:45:45,823 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\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()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 221 HoareAnnotationTreeSize, 8 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 28 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21300 SizeOfPredicates, 38 NumberOfNonLiveVariables, 473 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...