./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1071.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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/float_req_bl_1071.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 cbf38875841624eee0d839935b3b6d34a59b0b20 ....................................................................................................................................................................................................................................................................................................................................... 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 -ea -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/float_req_bl_1071.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 cbf38875841624eee0d839935b3b6d34a59b0b20 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:53:36,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:53:36,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:53:36,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:53:36,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:53:36,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:53:36,402 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:53:36,416 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:53:36,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:53:36,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:53:36,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:53:36,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:53:36,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:53:36,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:53:36,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:53:36,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:53:36,438 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:53:36,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:53:36,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:53:36,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:53:36,453 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:53:36,457 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:53:36,460 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:53:36,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:53:36,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:53:36,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:53:36,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:53:36,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:53:36,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:53:36,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:53:36,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:53:36,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:53:36,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:53:36,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:53:36,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:53:36,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:53:36,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:53:36,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:53:36,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:53:36,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:53:36,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:53:36,482 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:53:36,503 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:53:36,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:53:36,506 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:53:36,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:53:36,507 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:53:36,507 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:53:36,508 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:53:36,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:53:36,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:53:36,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:53:36,510 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:53:36,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:53:36,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:53:36,511 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:53:36,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:53:36,512 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:53:36,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:53:36,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:53:36,513 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:53:36,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:53:36,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:53:36,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:53:36,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:53:36,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:53:36,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:53:36,515 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:53:36,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:53:36,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:53:36,516 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:53:36,516 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 -> cbf38875841624eee0d839935b3b6d34a59b0b20 [2020-07-28 17:53:36,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:53:36,833 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:53:36,837 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:53:36,839 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:53:36,840 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:53:36,841 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2020-07-28 17:53:36,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd103ee6e/c2d865497deb4fda830ca33dd3bf6bbc/FLAG868673dad [2020-07-28 17:53:37,384 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:53:37,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2020-07-28 17:53:37,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd103ee6e/c2d865497deb4fda830ca33dd3bf6bbc/FLAG868673dad [2020-07-28 17:53:37,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd103ee6e/c2d865497deb4fda830ca33dd3bf6bbc [2020-07-28 17:53:37,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:53:37,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:53:37,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:53:37,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:53:37,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:53:37,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:53:37" (1/1) ... [2020-07-28 17:53:37,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f13286f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:37, skipping insertion in model container [2020-07-28 17:53:37,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:53:37" (1/1) ... [2020-07-28 17:53:37,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:53:37,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:53:38,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:53:38,079 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:53:38,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:53:38,131 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:53:38,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38 WrapperNode [2020-07-28 17:53:38,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:53:38,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:53:38,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:53:38,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:53:38,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,238 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:53:38,239 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:53:38,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:53:38,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:53:38,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,267 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... [2020-07-28 17:53:38,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:53:38,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:53:38,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:53:38,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:53:38,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:53:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:53:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:53:38,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:53:38,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:53:38,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:53:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:53:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:53:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:53:38,752 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:53:38,753 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:53:38,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:38 BoogieIcfgContainer [2020-07-28 17:53:38,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:53:38,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:53:38,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:53:38,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:53:38,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:53:37" (1/3) ... [2020-07-28 17:53:38,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c434ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:53:38, skipping insertion in model container [2020-07-28 17:53:38,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:38" (2/3) ... [2020-07-28 17:53:38,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c434ae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:53:38, skipping insertion in model container [2020-07-28 17:53:38,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:38" (3/3) ... [2020-07-28 17:53:38,767 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1071.c [2020-07-28 17:53:38,778 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:53:38,786 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:53:38,803 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:53:38,828 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:53:38,828 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:53:38,828 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:53:38,828 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:53:38,829 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:53:38,829 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:53:38,829 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:53:38,829 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:53:38,847 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-28 17:53:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:53:38,860 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:38,861 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:38,862 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:38,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1945097259, now seen corresponding path program 1 times [2020-07-28 17:53:38,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:53:38,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208794841] [2020-07-28 17:53:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:53:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:39,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {24#true} is VALID [2020-07-28 17:53:39,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {24#true} is VALID [2020-07-28 17:53:39,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-28 17:53:39,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} trunc_float_~signbit~0 := (if ~bitwiseAnd(trunc_float_~w~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_float_~w~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_float_~w~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);trunc_float_~exponent_less_127~0 := ~bitwiseAnd(trunc_float_~w~0, 2139095040) / 8388608 - 127; {25#false} is VALID [2020-07-28 17:53:39,014 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(trunc_float_~exponent_less_127~0 < 23); {25#false} is VALID [2020-07-28 17:53:39,014 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} assume 255 == trunc_float_~exponent_less_127~0;trunc_float_#res := ~someBinaryArithmeticFLOAToperation(trunc_float_~x, trunc_float_~x); {25#false} is VALID [2020-07-28 17:53:39,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x, isnan_float_~x) then 1 else 0); {25#false} is VALID [2020-07-28 17:53:39,015 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} main_#t~ret7 := isnan_float_#res;assume -2147483648 <= main_#t~ret7 && main_#t~ret7 <= 2147483647; {25#false} is VALID [2020-07-28 17:53:39,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == main_#t~ret7;havoc main_#t~ret7; {25#false} is VALID [2020-07-28 17:53:39,016 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-28 17:53:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:39,019 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208794841] [2020-07-28 17:53:39,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:39,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:53:39,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259488187] [2020-07-28 17:53:39,032 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:53:39,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:39,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:53:39,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:39,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:53:39,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:53:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:53:39,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:53:39,100 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-28 17:53:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:39,163 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2020-07-28 17:53:39,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:53:39,164 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:53:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:39,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:53:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2020-07-28 17:53:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:53:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2020-07-28 17:53:39,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2020-07-28 17:53:39,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:39,297 INFO L225 Difference]: With dead ends: 40 [2020-07-28 17:53:39,297 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 17:53:39,301 INFO L675 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 [2020-07-28 17:53:39,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 17:53:39,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 17:53:39,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:39,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:39,338 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:39,339 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:39,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:39,342 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-28 17:53:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 17:53:39,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:39,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:39,343 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:39,343 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:39,346 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-28 17:53:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 17:53:39,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:39,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:39,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:39,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:53:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-28 17:53:39,351 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2020-07-28 17:53:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:39,352 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-28 17:53:39,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:53:39,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 17:53:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:53:39,353 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:39,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:39,354 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:53:39,354 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash -390209938, now seen corresponding path program 1 times [2020-07-28 17:53:39,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:53:39,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362217170] [2020-07-28 17:53:39,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:53:39,449 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:53:39,450 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:53:39,457 INFO L168 Benchmark]: Toolchain (without parser) took 1679.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:39,457 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:53:39,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 940.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:39,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:39,460 INFO L168 Benchmark]: Boogie Preprocessor took 33.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:53:39,461 INFO L168 Benchmark]: RCFGBuilder took 484.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:39,462 INFO L168 Benchmark]: TraceAbstraction took 695.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:39,466 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.82 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 352.73 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 940.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 940.1 MB in the beginning and 1.1 GB in the end (delta: -190.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 484.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 695.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:53:41,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:53:41,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:53:41,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:53:41,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:53:41,623 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:53:41,625 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:53:41,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:53:41,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:53:41,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:53:41,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:53:41,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:53:41,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:53:41,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:53:41,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:53:41,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:53:41,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:53:41,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:53:41,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:53:41,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:53:41,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:53:41,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:53:41,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:53:41,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:53:41,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:53:41,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:53:41,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:53:41,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:53:41,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:53:41,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:53:41,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:53:41,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:53:41,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:53:41,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:53:41,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:53:41,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:53:41,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:53:41,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:53:41,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:53:41,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:53:41,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:53:41,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:53:41,680 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:53:41,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:53:41,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:53:41,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:53:41,683 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:53:41,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:53:41,683 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:53:41,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:53:41,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:53:41,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:53:41,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:53:41,685 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:53:41,685 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:53:41,685 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:53:41,686 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:53:41,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:53:41,686 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:53:41,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:53:41,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:53:41,687 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:53:41,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:53:41,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:53:41,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:53:41,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:53:41,688 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:53:41,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:53:41,689 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:53:41,689 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:53:41,689 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:53:41,690 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:53:41,690 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:53:41,690 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 -> cbf38875841624eee0d839935b3b6d34a59b0b20 [2020-07-28 17:53:42,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:53:42,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:53:42,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:53:42,068 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:53:42,071 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:53:42,072 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2020-07-28 17:53:42,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45809dbab/d9a63aeec86e4e099bcf1bdd008ae6ab/FLAG2b78c629b [2020-07-28 17:53:42,541 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:53:42,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1071.c [2020-07-28 17:53:42,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45809dbab/d9a63aeec86e4e099bcf1bdd008ae6ab/FLAG2b78c629b [2020-07-28 17:53:42,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45809dbab/d9a63aeec86e4e099bcf1bdd008ae6ab [2020-07-28 17:53:42,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:53:42,925 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:53:42,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:53:42,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:53:42,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:53:42,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:53:42" (1/1) ... [2020-07-28 17:53:42,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674049d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:42, skipping insertion in model container [2020-07-28 17:53:42,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:53:42" (1/1) ... [2020-07-28 17:53:42,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:53:42,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:53:43,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:53:43,166 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:53:43,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:53:43,316 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:53:43,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43 WrapperNode [2020-07-28 17:53:43,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:53:43,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:53:43,318 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:53:43,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:53:43,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,372 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:53:43,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:53:43,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:53:43,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:53:43,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... [2020-07-28 17:53:43,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:53:43,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:53:43,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:53:43,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:53:43,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:53:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:53:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-07-28 17:53:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:53:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:53:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:53:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-07-28 17:53:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:53:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:53:43,909 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:53:43,910 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:53:43,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:43 BoogieIcfgContainer [2020-07-28 17:53:43,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:53:43,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:53:43,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:53:43,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:53:43,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:53:42" (1/3) ... [2020-07-28 17:53:43,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:53:43, skipping insertion in model container [2020-07-28 17:53:43,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:43" (2/3) ... [2020-07-28 17:53:43,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0068a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:53:43, skipping insertion in model container [2020-07-28 17:53:43,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:43" (3/3) ... [2020-07-28 17:53:43,924 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1071.c [2020-07-28 17:53:43,946 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:53:43,956 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:53:43,971 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:53:43,995 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:53:43,995 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:53:43,995 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:53:43,995 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:53:43,996 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:53:43,996 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:53:43,996 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:53:43,996 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:53:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-28 17:53:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:53:44,019 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:44,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:44,020 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:44,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:44,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1945097259, now seen corresponding path program 1 times [2020-07-28 17:53:44,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:44,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832754994] [2020-07-28 17:53:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 17:53:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:44,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:53:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:44,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:44,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {24#true} is VALID [2020-07-28 17:53:44,221 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {24#true} is VALID [2020-07-28 17:53:44,222 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-28 17:53:44,223 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {25#false} is VALID [2020-07-28 17:53:44,223 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {25#false} is VALID [2020-07-28 17:53:44,223 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} assume 255bv32 == trunc_float_~exponent_less_127~0;trunc_float_#res := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x, trunc_float_~x); {25#false} is VALID [2020-07-28 17:53:44,224 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {25#false} is VALID [2020-07-28 17:53:44,224 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} main_#t~ret7 := isnan_float_#res; {25#false} is VALID [2020-07-28 17:53:44,224 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {25#false} is VALID [2020-07-28 17:53:44,225 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-28 17:53:44,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:44,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:44,243 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-28 17:53:44,243 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {25#false} is VALID [2020-07-28 17:53:44,244 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} main_#t~ret7 := isnan_float_#res; {25#false} is VALID [2020-07-28 17:53:44,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {25#false} is VALID [2020-07-28 17:53:44,245 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} assume 255bv32 == trunc_float_~exponent_less_127~0;trunc_float_#res := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x, trunc_float_~x); {25#false} is VALID [2020-07-28 17:53:44,245 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {25#false} is VALID [2020-07-28 17:53:44,245 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {25#false} is VALID [2020-07-28 17:53:44,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-28 17:53:44,248 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {24#true} is VALID [2020-07-28 17:53:44,248 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {24#true} is VALID [2020-07-28 17:53:44,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:44,250 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832754994] [2020-07-28 17:53:44,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:44,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:53:44,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572499851] [2020-07-28 17:53:44,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:53:44,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:44,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:53:44,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:44,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:53:44,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:44,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:53:44,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:53:44,314 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-28 17:53:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:44,413 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2020-07-28 17:53:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:53:44,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:53:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:53:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2020-07-28 17:53:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:53:44,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2020-07-28 17:53:44,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2020-07-28 17:53:44,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:44,557 INFO L225 Difference]: With dead ends: 40 [2020-07-28 17:53:44,557 INFO L226 Difference]: Without dead ends: 18 [2020-07-28 17:53:44,563 INFO L675 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 [2020-07-28 17:53:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-28 17:53:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-28 17:53:44,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:44,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:44,635 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:44,636 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:44,638 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-28 17:53:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 17:53:44,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:44,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:44,641 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:44,641 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-28 17:53:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:44,648 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-28 17:53:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 17:53:44,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:44,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:44,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:44,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:53:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-28 17:53:44,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2020-07-28 17:53:44,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:44,661 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-28 17:53:44,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:53:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-28 17:53:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:53:44,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:44,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:44,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:53:44,880 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -390209938, now seen corresponding path program 1 times [2020-07-28 17:53:44,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:44,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160836278] [2020-07-28 17:53:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 17:53:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:44,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:53:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:44,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:45,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {193#true} is VALID [2020-07-28 17:53:45,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {193#true} is VALID [2020-07-28 17:53:45,102 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#true} call trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);call trunc_float_#t~mem0 := read~intINTTYPE4(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);trunc_float_~w~0 := trunc_float_#t~mem0;call write~intFLOATTYPE4(trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);havoc trunc_float_#t~union1;havoc trunc_float_#t~mem0;call ULTIMATE.dealloc(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset);havoc trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset; {193#true} is VALID [2020-07-28 17:53:45,102 INFO L280 TraceCheckUtils]: 3: Hoare triple {193#true} goto; {193#true} is VALID [2020-07-28 17:53:45,109 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#true} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {210#(exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0))} is VALID [2020-07-28 17:53:45,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {210#(exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0))} assume !~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {214#(and (not (bvslt ULTIMATE.start_trunc_float_~exponent_less_127~0 (_ bv23 32))) (exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0)))} is VALID [2020-07-28 17:53:45,123 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#(and (not (bvslt ULTIMATE.start_trunc_float_~exponent_less_127~0 (_ bv23 32))) (exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0)))} assume 255bv32 == trunc_float_~exponent_less_127~0;trunc_float_#res := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x, trunc_float_~x); {194#false} is VALID [2020-07-28 17:53:45,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {194#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {194#false} is VALID [2020-07-28 17:53:45,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {194#false} main_#t~ret7 := isnan_float_#res; {194#false} is VALID [2020-07-28 17:53:45,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {194#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {194#false} is VALID [2020-07-28 17:53:45,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#false} assume !false; {194#false} is VALID [2020-07-28 17:53:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:45,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:45,173 INFO L280 TraceCheckUtils]: 10: Hoare triple {194#false} assume !false; {194#false} is VALID [2020-07-28 17:53:45,174 INFO L280 TraceCheckUtils]: 9: Hoare triple {194#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {194#false} is VALID [2020-07-28 17:53:45,174 INFO L280 TraceCheckUtils]: 8: Hoare triple {194#false} main_#t~ret7 := isnan_float_#res; {194#false} is VALID [2020-07-28 17:53:45,174 INFO L280 TraceCheckUtils]: 7: Hoare triple {194#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {194#false} is VALID [2020-07-28 17:53:45,176 INFO L280 TraceCheckUtils]: 6: Hoare triple {242#(not (= (_ bv255 32) ULTIMATE.start_trunc_float_~exponent_less_127~0))} assume 255bv32 == trunc_float_~exponent_less_127~0;trunc_float_#res := ~fp.add~FLOAT(currentRoundingMode, trunc_float_~x, trunc_float_~x); {194#false} is VALID [2020-07-28 17:53:45,177 INFO L280 TraceCheckUtils]: 5: Hoare triple {242#(not (= (_ bv255 32) ULTIMATE.start_trunc_float_~exponent_less_127~0))} assume !~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {242#(not (= (_ bv255 32) ULTIMATE.start_trunc_float_~exponent_less_127~0))} is VALID [2020-07-28 17:53:45,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {193#true} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {242#(not (= (_ bv255 32) ULTIMATE.start_trunc_float_~exponent_less_127~0))} is VALID [2020-07-28 17:53:45,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {193#true} goto; {193#true} is VALID [2020-07-28 17:53:45,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {193#true} call trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);call trunc_float_#t~mem0 := read~intINTTYPE4(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);trunc_float_~w~0 := trunc_float_#t~mem0;call write~intFLOATTYPE4(trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);havoc trunc_float_#t~union1;havoc trunc_float_#t~mem0;call ULTIMATE.dealloc(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset);havoc trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset; {193#true} is VALID [2020-07-28 17:53:45,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {193#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {193#true} is VALID [2020-07-28 17:53:45,180 INFO L280 TraceCheckUtils]: 0: Hoare triple {193#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {193#true} is VALID [2020-07-28 17:53:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:45,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160836278] [2020-07-28 17:53:45,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:45,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2020-07-28 17:53:45,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742130781] [2020-07-28 17:53:45,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-28 17:53:45,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:45,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:53:45,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:45,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:53:45,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:45,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:53:45,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:53:45,228 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 5 states. [2020-07-28 17:53:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:45,474 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2020-07-28 17:53:45,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:53:45,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-28 17:53:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:53:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2020-07-28 17:53:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:53:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2020-07-28 17:53:45,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2020-07-28 17:53:45,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:45,603 INFO L225 Difference]: With dead ends: 29 [2020-07-28 17:53:45,603 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 17:53:45,605 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:53:45,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 17:53:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2020-07-28 17:53:45,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:45,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 18 states. [2020-07-28 17:53:45,627 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 18 states. [2020-07-28 17:53:45,627 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 18 states. [2020-07-28 17:53:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:45,631 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-28 17:53:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-28 17:53:45,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:45,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:45,632 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 24 states. [2020-07-28 17:53:45,632 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 24 states. [2020-07-28 17:53:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:45,636 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-28 17:53:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2020-07-28 17:53:45,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:45,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:45,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:45,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:53:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-28 17:53:45,643 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 11 [2020-07-28 17:53:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:45,643 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-28 17:53:45,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:53:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-28 17:53:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:53:45,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:45,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:45,862 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:53:45,862 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:45,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 843742638, now seen corresponding path program 1 times [2020-07-28 17:53:45,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:45,864 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203555462] [2020-07-28 17:53:45,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 17:53:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:45,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-28 17:53:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:45,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:46,057 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:53:46,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {369#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {369#true} is VALID [2020-07-28 17:53:46,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {369#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} call trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);call trunc_float_#t~mem0 := read~intINTTYPE4(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);trunc_float_~w~0 := trunc_float_#t~mem0;call write~intFLOATTYPE4(trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);havoc trunc_float_#t~union1;havoc trunc_float_#t~mem0;call ULTIMATE.dealloc(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset);havoc trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset; {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,112 INFO L280 TraceCheckUtils]: 3: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} goto; {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,113 INFO L280 TraceCheckUtils]: 4: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} assume !~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,116 INFO L280 TraceCheckUtils]: 6: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} assume !(255bv32 == trunc_float_~exponent_less_127~0); {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,119 INFO L280 TraceCheckUtils]: 7: Hoare triple {377#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} trunc_float_#res := trunc_float_~x; {396#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:53:46,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {396#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {400#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} is VALID [2020-07-28 17:53:46,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {400#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)} main_#t~ret7 := isnan_float_#res; {404#(= (bvadd |ULTIMATE.start_main_#t~ret7| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:53:46,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {404#(= (bvadd |ULTIMATE.start_main_#t~ret7| (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {370#false} is VALID [2020-07-28 17:53:46,131 INFO L280 TraceCheckUtils]: 11: Hoare triple {370#false} assume !false; {370#false} is VALID [2020-07-28 17:53:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:46,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:46,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {370#false} assume !false; {370#false} is VALID [2020-07-28 17:53:46,288 INFO L280 TraceCheckUtils]: 10: Hoare triple {414#(not (= |ULTIMATE.start_main_#t~ret7| (_ bv0 32)))} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {370#false} is VALID [2020-07-28 17:53:46,290 INFO L280 TraceCheckUtils]: 9: Hoare triple {418#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} main_#t~ret7 := isnan_float_#res; {414#(not (= |ULTIMATE.start_main_#t~ret7| (_ bv0 32)))} is VALID [2020-07-28 17:53:46,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {422#(not (fp.eq |ULTIMATE.start_trunc_float_#res| |ULTIMATE.start_trunc_float_#res|))} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {418#(not (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))} is VALID [2020-07-28 17:53:46,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} trunc_float_#res := trunc_float_~x; {422#(not (fp.eq |ULTIMATE.start_trunc_float_#res| |ULTIMATE.start_trunc_float_#res|))} is VALID [2020-07-28 17:53:46,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} assume !(255bv32 == trunc_float_~exponent_less_127~0); {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,292 INFO L280 TraceCheckUtils]: 5: Hoare triple {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} assume !~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,296 INFO L280 TraceCheckUtils]: 3: Hoare triple {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} goto; {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,297 INFO L280 TraceCheckUtils]: 2: Hoare triple {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} call trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);call trunc_float_#t~mem0 := read~intINTTYPE4(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);trunc_float_~w~0 := trunc_float_#t~mem0;call write~intFLOATTYPE4(trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);havoc trunc_float_#t~union1;havoc trunc_float_#t~mem0;call ULTIMATE.dealloc(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset);havoc trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset; {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {369#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {426#(not (fp.eq ULTIMATE.start_trunc_float_~x ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:46,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {369#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {369#true} is VALID [2020-07-28 17:53:46,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:46,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203555462] [2020-07-28 17:53:46,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:46,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-07-28 17:53:46,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659672615] [2020-07-28 17:53:46,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-07-28 17:53:46,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:46,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:53:46,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:46,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:53:46,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:46,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:53:46,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:53:46,371 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 10 states. [2020-07-28 17:53:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:47,105 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-28 17:53:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:53:47,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-07-28 17:53:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:53:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-28 17:53:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:53:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-07-28 17:53:47,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2020-07-28 17:53:47,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:47,178 INFO L225 Difference]: With dead ends: 24 [2020-07-28 17:53:47,178 INFO L226 Difference]: Without dead ends: 17 [2020-07-28 17:53:47,179 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:53:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-07-28 17:53:47,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-28 17:53:47,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:47,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2020-07-28 17:53:47,194 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 17:53:47,194 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 17:53:47,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:47,197 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-28 17:53:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-28 17:53:47,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:47,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:47,198 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2020-07-28 17:53:47,198 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2020-07-28 17:53:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:47,199 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-28 17:53:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-28 17:53:47,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:47,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:47,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:47,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 17:53:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2020-07-28 17:53:47,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2020-07-28 17:53:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:47,202 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2020-07-28 17:53:47,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:53:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2020-07-28 17:53:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:53:47,203 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:47,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:47,413 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:53:47,414 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2105231138, now seen corresponding path program 1 times [2020-07-28 17:53:47,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:47,417 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861610744] [2020-07-28 17:53:47,417 INFO L95 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 [2020-07-28 17:53:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:47,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:53:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:47,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:47,606 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {541#true} is VALID [2020-07-28 17:53:47,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {549#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} is VALID [2020-07-28 17:53:47,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {549#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x))} call trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);call trunc_float_#t~mem0 := read~intINTTYPE4(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);trunc_float_~w~0 := trunc_float_#t~mem0;call write~intFLOATTYPE4(trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);havoc trunc_float_#t~union1;havoc trunc_float_#t~mem0;call ULTIMATE.dealloc(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset);havoc trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset; {553#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start_trunc_float_~w~0) ((_ extract 30 23) ULTIMATE.start_trunc_float_~w~0) ((_ extract 22 0) ULTIMATE.start_trunc_float_~w~0)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:53:47,617 INFO L280 TraceCheckUtils]: 3: Hoare triple {553#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start_trunc_float_~w~0) ((_ extract 30 23) ULTIMATE.start_trunc_float_~w~0) ((_ extract 22 0) ULTIMATE.start_trunc_float_~w~0)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {553#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start_trunc_float_~w~0) ((_ extract 30 23) ULTIMATE.start_trunc_float_~w~0) ((_ extract 22 0) ULTIMATE.start_trunc_float_~w~0)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2020-07-28 17:53:47,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {553#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start_trunc_float_~w~0) ((_ extract 30 23) ULTIMATE.start_trunc_float_~w~0) ((_ extract 22 0) ULTIMATE.start_trunc_float_~w~0)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {560#(exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) ULTIMATE.start_trunc_float_~w~0) ((_ extract 30 23) ULTIMATE.start_trunc_float_~w~0) ((_ extract 22 0) ULTIMATE.start_trunc_float_~w~0)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0)))} is VALID [2020-07-28 17:53:47,626 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#(exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) ULTIMATE.start_trunc_float_~w~0) ((_ extract 30 23) ULTIMATE.start_trunc_float_~w~0) ((_ extract 22 0) ULTIMATE.start_trunc_float_~w~0)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0)))} assume ~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {542#false} is VALID [2020-07-28 17:53:47,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {542#false} assume !~bvslt32(trunc_float_~exponent_less_127~0, 0bv32); {542#false} is VALID [2020-07-28 17:53:47,626 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#false} call trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvor32(trunc_float_~signbit~0, ~bvand32(trunc_float_~w~0, ~bvnot32(~bvashr32(8388607bv32, trunc_float_~exponent_less_127~0)))), trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, 4bv32);call trunc_float_#t~mem4 := read~intFLOATTYPE4(trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, 4bv32);trunc_float_~x := trunc_float_#t~mem4;call write~intINTTYPE4(trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, 4bv32);havoc trunc_float_#t~mem4;havoc trunc_float_#t~union5;call ULTIMATE.dealloc(trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset);havoc trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset; {542#false} is VALID [2020-07-28 17:53:47,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {542#false} goto; {542#false} is VALID [2020-07-28 17:53:47,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#false} trunc_float_#res := trunc_float_~x; {542#false} is VALID [2020-07-28 17:53:47,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {542#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {542#false} is VALID [2020-07-28 17:53:47,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {542#false} main_#t~ret7 := isnan_float_#res; {542#false} is VALID [2020-07-28 17:53:47,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {542#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {542#false} is VALID [2020-07-28 17:53:47,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {542#false} assume !false; {542#false} is VALID [2020-07-28 17:53:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:47,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:47,801 INFO L280 TraceCheckUtils]: 13: Hoare triple {542#false} assume !false; {542#false} is VALID [2020-07-28 17:53:47,801 INFO L280 TraceCheckUtils]: 12: Hoare triple {542#false} assume 0bv32 == main_#t~ret7;havoc main_#t~ret7; {542#false} is VALID [2020-07-28 17:53:47,802 INFO L280 TraceCheckUtils]: 11: Hoare triple {542#false} main_#t~ret7 := isnan_float_#res; {542#false} is VALID [2020-07-28 17:53:47,802 INFO L280 TraceCheckUtils]: 10: Hoare triple {542#false} main_#t~ret6 := trunc_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;isnan_float_#in~x := main_~res~0;havoc isnan_float_#res;havoc isnan_float_~x;isnan_float_~x := isnan_float_#in~x;isnan_float_#res := (if !~fp.eq~FLOAT(isnan_float_~x, isnan_float_~x) then 1bv32 else 0bv32); {542#false} is VALID [2020-07-28 17:53:47,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {542#false} trunc_float_#res := trunc_float_~x; {542#false} is VALID [2020-07-28 17:53:47,802 INFO L280 TraceCheckUtils]: 8: Hoare triple {542#false} goto; {542#false} is VALID [2020-07-28 17:53:47,802 INFO L280 TraceCheckUtils]: 7: Hoare triple {542#false} call trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvor32(trunc_float_~signbit~0, ~bvand32(trunc_float_~w~0, ~bvnot32(~bvashr32(8388607bv32, trunc_float_~exponent_less_127~0)))), trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, 4bv32);call trunc_float_#t~mem4 := read~intFLOATTYPE4(trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, 4bv32);trunc_float_~x := trunc_float_#t~mem4;call write~intINTTYPE4(trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, 4bv32);havoc trunc_float_#t~mem4;havoc trunc_float_#t~union5;call ULTIMATE.dealloc(trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset);havoc trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset; {542#false} is VALID [2020-07-28 17:53:47,803 INFO L280 TraceCheckUtils]: 6: Hoare triple {542#false} assume !~bvslt32(trunc_float_~exponent_less_127~0, 0bv32); {542#false} is VALID [2020-07-28 17:53:47,803 INFO L280 TraceCheckUtils]: 5: Hoare triple {612#(not (bvslt ULTIMATE.start_trunc_float_~exponent_less_127~0 (_ bv23 32)))} assume ~bvslt32(trunc_float_~exponent_less_127~0, 23bv32); {542#false} is VALID [2020-07-28 17:53:47,805 INFO L280 TraceCheckUtils]: 4: Hoare triple {616#(not (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))} trunc_float_~signbit~0 := ~bvand32(2147483648bv32, trunc_float_~w~0);trunc_float_~exponent_less_127~0 := ~bvsub32(~bvashr32(~bvand32(2139095040bv32, trunc_float_~w~0), 23bv32), 127bv32); {612#(not (bvslt ULTIMATE.start_trunc_float_~exponent_less_127~0 (_ bv23 32)))} is VALID [2020-07-28 17:53:47,806 INFO L280 TraceCheckUtils]: 3: Hoare triple {616#(not (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))} goto; {616#(not (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))} is VALID [2020-07-28 17:53:47,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {623#(forall ((v_ULTIMATE.start_trunc_float_~w~0_8 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_ULTIMATE.start_trunc_float_~w~0_8) ((_ extract 30 23) v_ULTIMATE.start_trunc_float_~w~0_8) ((_ extract 22 0) v_ULTIMATE.start_trunc_float_~w~0_8)) ULTIMATE.start_trunc_float_~x)) (not (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) v_ULTIMATE.start_trunc_float_~w~0_8) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))))} call trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(trunc_float_~x, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);call trunc_float_#t~mem0 := read~intINTTYPE4(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);trunc_float_~w~0 := trunc_float_#t~mem0;call write~intFLOATTYPE4(trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, 4bv32);havoc trunc_float_#t~union1;havoc trunc_float_#t~mem0;call ULTIMATE.dealloc(trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset);havoc trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset; {616#(not (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))} is VALID [2020-07-28 17:53:47,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {541#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());trunc_float_#in~x := main_~x~0;havoc trunc_float_#res;havoc trunc_float_#t~mem0, trunc_float_#t~union1, trunc_float_~#gf_u~0.base, trunc_float_~#gf_u~0.offset, trunc_float_#t~mem2, trunc_float_#t~union3, trunc_float_~#sf_u~0.base, trunc_float_~#sf_u~0.offset, trunc_float_#t~mem4, trunc_float_#t~union5, trunc_float_~#sf_u~1.base, trunc_float_~#sf_u~1.offset, trunc_float_~x, trunc_float_~signbit~0, trunc_float_~w~0, trunc_float_~exponent_less_127~0;trunc_float_~x := trunc_float_#in~x;havoc trunc_float_~signbit~0;havoc trunc_float_~w~0;havoc trunc_float_~exponent_less_127~0; {623#(forall ((v_ULTIMATE.start_trunc_float_~w~0_8 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_ULTIMATE.start_trunc_float_~w~0_8) ((_ extract 30 23) v_ULTIMATE.start_trunc_float_~w~0_8) ((_ extract 22 0) v_ULTIMATE.start_trunc_float_~w~0_8)) ULTIMATE.start_trunc_float_~x)) (not (bvslt (bvadd (bvashr (bvand (_ bv2139095040 32) v_ULTIMATE.start_trunc_float_~w~0_8) (_ bv23 32)) (_ bv4294967169 32)) (_ bv23 32)))))} is VALID [2020-07-28 17:53:47,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {541#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {541#true} is VALID [2020-07-28 17:53:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:53:47,815 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861610744] [2020-07-28 17:53:47,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:47,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:53:47,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650668535] [2020-07-28 17:53:47,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-28 17:53:47,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:47,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:53:47,866 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:47,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:53:47,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:47,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:53:47,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:53:47,867 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 8 states. [2020-07-28 17:53:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:48,060 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-07-28 17:53:48,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:53:48,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-07-28 17:53:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:53:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-28 17:53:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:53:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-28 17:53:48,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2020-07-28 17:53:48,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:48,107 INFO L225 Difference]: With dead ends: 17 [2020-07-28 17:53:48,107 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:53:48,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:53:48,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:53:48,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:53:48,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:48,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:48,109 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:48,109 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:48,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:48,109 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:53:48,109 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:53:48,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:48,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:48,110 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:48,110 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:48,111 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:53:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:53:48,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:48,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:48,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:48,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:53:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:53:48,112 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-28 17:53:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:48,112 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:53:48,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:53:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:53:48,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:48,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:53:48,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:53:48,510 INFO L268 CegarLoopResult]: For program point L56(lines 56 59) no Hoare annotation was computed. [2020-07-28 17:53:48,511 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x)) (exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0)) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2020-07-28 17:53:48,511 INFO L264 CegarLoopResult]: At program point L40(lines 12 41) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x)) (exists ((ULTIMATE.start_trunc_float_~w~0 (_ BitVec 32))) (= (bvadd (bvashr (bvand (_ bv2139095040 32) ULTIMATE.start_trunc_float_~w~0) (_ bv23 32)) (_ bv4294967169 32)) ULTIMATE.start_trunc_float_~exponent_less_127~0)) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_trunc_float_#res| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2020-07-28 17:53:48,511 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:53:48,511 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:53:48,512 INFO L271 CegarLoopResult]: At program point L61(lines 46 62) the Hoare annotation is: true [2020-07-28 17:53:48,512 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:53:48,512 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-28 17:53:48,512 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L268 CegarLoopResult]: For program point L24-1(lines 24 28) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 28) the Hoare annotation is: false [2020-07-28 17:53:48,513 INFO L268 CegarLoopResult]: For program point L37(lines 37 38) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L268 CegarLoopResult]: For program point L21(lines 21 39) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L268 CegarLoopResult]: For program point L21-1(lines 21 39) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L268 CegarLoopResult]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2020-07-28 17:53:48,513 INFO L264 CegarLoopResult]: At program point L30-2(lines 30 34) the Hoare annotation is: false [2020-07-28 17:53:48,514 INFO L268 CegarLoopResult]: For program point L22(lines 22 35) no Hoare annotation was computed. [2020-07-28 17:53:48,514 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2020-07-28 17:53:48,514 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 18) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)) ULTIMATE.start_trunc_float_~x)) [2020-07-28 17:53:48,514 INFO L268 CegarLoopResult]: For program point L14-3(lines 14 18) no Hoare annotation was computed. [2020-07-28 17:53:48,519 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:53:48,520 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:53:48,520 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:53:48,520 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 17:53:48,520 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:53:48,521 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:53:48,521 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-28 17:53:48,521 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 17:53:48,521 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 17:53:48,521 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 17:53:48,522 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 17:53:48,522 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 17:53:48,522 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 17:53:48,522 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:53:48,522 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-28 17:53:48,523 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:53:48,523 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-28 17:53:48,533 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2020-07-28 17:53:48,533 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:53:48,533 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 17:53:48,533 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:53:48,533 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:53:48,533 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:53:48,534 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:53:48,534 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:53:48,534 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:53:48,534 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:53:48,535 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:53:48,535 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:53:48,535 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:53:48,541 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,542 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,545 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,546 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,547 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,548 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,549 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,550 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:53:48 BoogieIcfgContainer [2020-07-28 17:53:48,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:53:48,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:53:48,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:53:48,553 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:53:48,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:43" (3/4) ... [2020-07-28 17:53:48,558 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:53:48,569 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2020-07-28 17:53:48,570 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-28 17:53:48,570 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:53:48,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-07-28 17:53:48,598 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists ULTIMATE.start_trunc_float_~w~0 : bv32 :: ~bvadd64(~bvashr32(~bvand32(2139095040bv32, ULTIMATE.start_trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2020-07-28 17:53:48,599 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1bv32 == \result && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x)) && (\exists ULTIMATE.start_trunc_float_~w~0 : bv32 :: ~bvadd64(~bvashr32(~bvand32(2139095040bv32, ULTIMATE.start_trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2020-07-28 17:53:48,622 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:53:48,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:53:48,625 INFO L168 Benchmark]: Toolchain (without parser) took 5701.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 960.2 MB in the beginning and 834.5 MB in the end (delta: 125.8 MB). Peak memory consumption was 277.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:48,626 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:53:48,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:48,627 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:48,627 INFO L168 Benchmark]: Boogie Preprocessor took 39.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:53:48,628 INFO L168 Benchmark]: RCFGBuilder took 502.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:48,629 INFO L168 Benchmark]: TraceAbstraction took 4636.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.3 MB in the end (delta: 271.7 MB). Peak memory consumption was 271.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:48,629 INFO L168 Benchmark]: Witness Printer took 69.52 ms. Allocated memory is still 1.2 GB. Free memory was 841.3 MB in the beginning and 834.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:48,633 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 502.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4636.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 841.3 MB in the end (delta: 271.7 MB). Peak memory consumption was 271.7 MB. Max. memory is 11.5 GB. * Witness Printer took 69.52 ms. Allocated memory is still 1.2 GB. Free memory was 841.3 MB in the beginning and 834.5 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 57]: 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: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 44]: Loop Invariant [2020-07-28 17:53:48,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((1bv32 == \result && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x)) && (\exists ULTIMATE.start_trunc_float_~w~0 : bv32 :: ~bvadd64(~bvashr32(~bvand32(2139095040bv32, ULTIMATE.start_trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 14]: Loop Invariant [2020-07-28 17:53:48,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 12]: Loop Invariant [2020-07-28 17:53:48,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:53:48,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_trunc_float_~w~0,QUANTIFIED] [2020-07-28 17:53:48,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists ULTIMATE.start_trunc_float_~w~0 : bv32 :: ~bvadd64(~bvashr32(~bvand32(2139095040bv32, ULTIMATE.start_trunc_float_~w~0), 23bv32), 4294967169bv32) == exponent_less_127)) && (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.3s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 54 SDtfs, 39 SDslu, 99 SDs, 0 SdLazy, 51 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 10 NumberOfFragments, 63 HoareAnnotationTreeSize, 6 FomulaSimplifications, 32 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 86 ConstructedInterpolants, 14 QuantifiedInterpolants, 3279 SizeOfPredicates, 21 NumberOfNonLiveVariables, 130 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...